Minimum delay algorithm based on time aggregated graph in DTN network

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Peng WANG, Hong-yan LI, Tao ZHANG, Peng-yun LI
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2017-10-01
Series:Tongxin xuebao
Subjects:
DTN network
time aggregated graph
optimal path
CGR algorithm
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!

Similar Items

Similar Items