Minimum delay algorithm based on time aggregated graph in DTN network
The DTN network has the characteristics of dynamic topology change,thus the routing algorithm of static network can not solve the routing problem of time-varying network,and can not support fast transmission of given tasks.The existing time-variant routing algorithm CGR (contact graph routing) uses...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2017-10-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017228/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539491229073408 |
|---|---|
| author | Peng WANG Hong-yan LI Tao ZHANG Peng-yun LI |
| author_facet | Peng WANG Hong-yan LI Tao ZHANG Peng-yun LI |
| author_sort | Peng WANG |
| collection | DOAJ |
| description | The DTN network has the characteristics of dynamic topology change,thus the routing algorithm of static network can not solve the routing problem of time-varying network,and can not support fast transmission of given tasks.The existing time-variant routing algorithm CGR (contact graph routing) uses the earliest contact to obtain the shortest path,but because of the influence of the order of the connectivity period,the CGR algorithm has low link utilization.To solve this problem,the method of finding the shortest path was proposed.Besides,in order to characterize the relation between the different connect periods of the same link,the time series of node cache was added to the time aggregated graph.Based on this,the end-to-end multi-path shortest delay routing algorithm for the known task requirements was proposed.Finally,the feasibility of the algorithm was proved by an example. |
| format | Article |
| id | doaj-art-31ff838d3d2b455899362e65249a1505 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2017-10-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-31ff838d3d2b455899362e65249a15052025-01-14T07:13:34ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2017-10-01381859714313Minimum delay algorithm based on time aggregated graph in DTN networkPeng WANGHong-yan LITao ZHANGPeng-yun LIThe DTN network has the characteristics of dynamic topology change,thus the routing algorithm of static network can not solve the routing problem of time-varying network,and can not support fast transmission of given tasks.The existing time-variant routing algorithm CGR (contact graph routing) uses the earliest contact to obtain the shortest path,but because of the influence of the order of the connectivity period,the CGR algorithm has low link utilization.To solve this problem,the method of finding the shortest path was proposed.Besides,in order to characterize the relation between the different connect periods of the same link,the time series of node cache was added to the time aggregated graph.Based on this,the end-to-end multi-path shortest delay routing algorithm for the known task requirements was proposed.Finally,the feasibility of the algorithm was proved by an example.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017228/DTN networktime aggregated graphoptimal pathCGR algorithm |
| spellingShingle | Peng WANG Hong-yan LI Tao ZHANG Peng-yun LI Minimum delay algorithm based on time aggregated graph in DTN network Tongxin xuebao DTN network time aggregated graph optimal path CGR algorithm |
| title | Minimum delay algorithm based on time aggregated graph in DTN network |
| title_full | Minimum delay algorithm based on time aggregated graph in DTN network |
| title_fullStr | Minimum delay algorithm based on time aggregated graph in DTN network |
| title_full_unstemmed | Minimum delay algorithm based on time aggregated graph in DTN network |
| title_short | Minimum delay algorithm based on time aggregated graph in DTN network |
| title_sort | minimum delay algorithm based on time aggregated graph in dtn network |
| topic | DTN network time aggregated graph optimal path CGR algorithm |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017228/ |
| work_keys_str_mv | AT pengwang minimumdelayalgorithmbasedontimeaggregatedgraphindtnnetwork AT hongyanli minimumdelayalgorithmbasedontimeaggregatedgraphindtnnetwork AT taozhang minimumdelayalgorithmbasedontimeaggregatedgraphindtnnetwork AT pengyunli minimumdelayalgorithmbasedontimeaggregatedgraphindtnnetwork |