A improved Prophet routing based on congestion level of nodes in DTN
The Prophet routing algorithm is a multi-copy algorithm which is based on historical information and transitive probability,which selects the relay node with a high probability to encounter the destination node.However,the selection of a relay node does not consider the current congestion level of node.Even if the current relay node has a high delivery probability to the destination node,it may also drop messages because of congestion.The traditional Prophet routing algorithm only takes the delivery probability into account without considering each connection time.For this purpose,we propose an improved routing algorithm which is based on nodes congestion level(PROPHET-CLN),not only solves the problem of selection according to delivery probability,but also assigns the right size of messages based on the capability of nodes.Simulation results show that compared with Prophet,this algorithm could not only improve the delivery rate but also significantly reduce the overhead of network and average latency.
Delay Tolerant Networks Nodes Congestion Level Prophet Relay Node
Guizhu Wang Jian Tao Hui Zhang Dong Pan
Key Laboratory of Intelligent Computing and Signal Processing,Ministry of Education,Anhui University,Hefei 230039,China
国际会议
重庆
英文
1666-1669
2017-03-25（万方平台首次上网日期，不代表论文的发表时间）