The prevalent multi-copy routing algorithms in mobile opportunistic networks(MONs)easily cause network congestion.This paper introduces a disjoint-path(DP)routing algorithm,where each node can only transmit packets on...The prevalent multi-copy routing algorithms in mobile opportunistic networks(MONs)easily cause network congestion.This paper introduces a disjoint-path(DP)routing algorithm,where each node can only transmit packets once except the source node,to effectively control the number of packet copies in the network.The discrete continuous time Markov chain(CTMC)was utilized to analyze the state transition between nodes,and the copy numbers of packets with the DP routing algorithm were calculated.Simulation results indicate that DP has a great improvement in terms of packet delivery ratio,average delivery delay,average network overhead,energy and average hop count.展开更多
多路径路由算法可以均衡负载、提高可靠性,但是A d Hoc网络的无线多播特性(WM A)使得多路径数据传输存在严重的冲突隐患,即便是节点不相交的多路径,以并发的方式来进行数据传输的效率并没有理论上的高.为此本文提出基于相关因子的节点...多路径路由算法可以均衡负载、提高可靠性,但是A d Hoc网络的无线多播特性(WM A)使得多路径数据传输存在严重的冲突隐患,即便是节点不相交的多路径,以并发的方式来进行数据传输的效率并没有理论上的高.为此本文提出基于相关因子的节点不相交的多路径路由算法(NDCF),该算法引入相关因子来衡量多条节点不相交路径以并发的方式进行数据传输时发生冲突的可能性的大小,从而选择冲突可能性最小的节点不相交路径.仿真结果表明,NDCF算法可明显提高数据包的投递率,降低端到端的传输时延.展开更多
基金the National Natural Science Foundation of China under Grants U1804164,61902112 and U1404602in part by the Science and Technology Foundation of Henan Educational Committee under Grants 19A510015,20A520019,20A520020.
文摘The prevalent multi-copy routing algorithms in mobile opportunistic networks(MONs)easily cause network congestion.This paper introduces a disjoint-path(DP)routing algorithm,where each node can only transmit packets once except the source node,to effectively control the number of packet copies in the network.The discrete continuous time Markov chain(CTMC)was utilized to analyze the state transition between nodes,and the copy numbers of packets with the DP routing algorithm were calculated.Simulation results indicate that DP has a great improvement in terms of packet delivery ratio,average delivery delay,average network overhead,energy and average hop count.
文摘多路径路由算法可以均衡负载、提高可靠性,但是A d Hoc网络的无线多播特性(WM A)使得多路径数据传输存在严重的冲突隐患,即便是节点不相交的多路径,以并发的方式来进行数据传输的效率并没有理论上的高.为此本文提出基于相关因子的节点不相交的多路径路由算法(NDCF),该算法引入相关因子来衡量多条节点不相交路径以并发的方式进行数据传输时发生冲突的可能性的大小,从而选择冲突可能性最小的节点不相交路径.仿真结果表明,NDCF算法可明显提高数据包的投递率,降低端到端的传输时延.
