战场环境下基于节点移动性的DTN路由算法
|
摘要
针对某些战场环境下源节点和目的节点之间缺少稳定的端到端路径,提出一种基于节点移动性的容迟容断网络(Delay/Disruptive Tolerant Network,DTN)路由算法MRA(Mobility-based Routing Algorithm):根据运动水平指数和历史接触信息,尽量将消息副本传送给战场环境下移动性更高的节点。通过ONE仿真,相比于Epidemic、Spray and Wait、PROPHET 3种经典算法,MRA算法以牺牲一定的平均时延为代价,得到了较高的消息投递率和可观的网络负载率。
Aimed at some battlefield environment is lacking of the stable end-to-end path between the source node and the destination node,the paper forwarded a mobility-based routing algorithm(MRA)in DTN. MRA transfers message replicas to the higher motion level index node in battlefield environment according to the motion level index and historical contact information. Comparing to Epidemic,Spray and Wait,PROPHET,the MRA algorithm achieved a higher message delivery rate and a considerable overhead ratio at the expense of a certain lower average delay by ONE simulator.
Aimed at some battlefield environment is lacking of the stable end-to-end path between the source node and the destination node,the paper forwarded a mobility-based routing algorithm(MRA)in DTN. MRA transfers message replicas to the higher motion level index node in battlefield environment according to the motion level index and historical contact information. Comparing to Epidemic,Spray and Wait,PROPHET,the MRA algorithm achieved a higher message delivery rate and a considerable overhead ratio at the expense of a certain lower average delay by ONE simulator.
引文
[1]苏金树,胡乔林,赵宝康,等.容迟容断网络路由技术[J].软件学报,2010,21(1):119-132.
[2]PHILIP G,VALTTERI N,JO咬RG O.Fragmentational algorithms for DTN links[J].Computer Communications,2013,36(3):279-290.
[3]VAHDAT A,BECKER D.Epidemic routing for partially connected ad hoc networks[R].Technical Report,Report CS-200006(Duke University,Durham,2000).
[4]SPYROPOULOUS T,PSOUNIS K,RAGHAVENDRA C S.Spray and wait:an efficient routing scheme for intermittently connected mobile networks[C]//Proceedings of the 2005ACM SIG-COMM Workshop on Delay-Tolerant Networking(SIGCOMM’05).Philadelphia,USA,2005:252-259.
[5]NGUYEN H A,GIORDANO S,PUIATTI A.Probabilistic routing protocol for intermittently connected mobile ad hoc network[C]//Proceedings of IEEE International Symposium on a World of Wireless,Mobile and Multimedia Networks.Espoo,Finland,2007:1-6.
[6]CHEN H L,LOU W.Contact expectation based routing for delay tolerant networks[J].Ad Hoc Networks,2015,36(2016):828-836.
[7]GAO W,CAO G,User-centric data dissemination in disruption tolerant networks[C]//in Proc.30th IEEE Conference on Computer Communications(INFOCOM)mini-conference,2011:3119-3127.doi:10.1109/INFCOM.2011.5935157.
[8]FABBRI F,VERDONE R.A sociability-based routing scheme for delay-tolerant networks[J].In EURASIP Journal on Wireless Communications and Networking 2011:1-13.doi:10.1155/2011/251408.
[9]ZENG Y.Directional routing and scheduling for green vehicular delay tolerant networks[J].Wirel.Netw,2013,19(2):161-173.
[10]LI P.Reliable multicast with pipelined network coding using opportunistic feeding and routing[J].IEEE Transaction on Parallel&Distributed Systems,2014,25(12):3246-3273.
[11]LIU L.Physarum optimization:a biology-inspired algorithm for the Steiner tree problem in networks[J].IEEE Trans.Comput,2015,64(3):819-832.
[12]倪辰辰,李千目,姜怡,等.基于轻型机步野战场景的DTN通信策略设计与性能分析[J].电信科学,2013,10(10):123-130.
[2]PHILIP G,VALTTERI N,JO咬RG O.Fragmentational algorithms for DTN links[J].Computer Communications,2013,36(3):279-290.
[3]VAHDAT A,BECKER D.Epidemic routing for partially connected ad hoc networks[R].Technical Report,Report CS-200006(Duke University,Durham,2000).
[4]SPYROPOULOUS T,PSOUNIS K,RAGHAVENDRA C S.Spray and wait:an efficient routing scheme for intermittently connected mobile networks[C]//Proceedings of the 2005ACM SIG-COMM Workshop on Delay-Tolerant Networking(SIGCOMM’05).Philadelphia,USA,2005:252-259.
[5]NGUYEN H A,GIORDANO S,PUIATTI A.Probabilistic routing protocol for intermittently connected mobile ad hoc network[C]//Proceedings of IEEE International Symposium on a World of Wireless,Mobile and Multimedia Networks.Espoo,Finland,2007:1-6.
[6]CHEN H L,LOU W.Contact expectation based routing for delay tolerant networks[J].Ad Hoc Networks,2015,36(2016):828-836.
[7]GAO W,CAO G,User-centric data dissemination in disruption tolerant networks[C]//in Proc.30th IEEE Conference on Computer Communications(INFOCOM)mini-conference,2011:3119-3127.doi:10.1109/INFCOM.2011.5935157.
[8]FABBRI F,VERDONE R.A sociability-based routing scheme for delay-tolerant networks[J].In EURASIP Journal on Wireless Communications and Networking 2011:1-13.doi:10.1155/2011/251408.
[9]ZENG Y.Directional routing and scheduling for green vehicular delay tolerant networks[J].Wirel.Netw,2013,19(2):161-173.
[10]LI P.Reliable multicast with pipelined network coding using opportunistic feeding and routing[J].IEEE Transaction on Parallel&Distributed Systems,2014,25(12):3246-3273.
[11]LIU L.Physarum optimization:a biology-inspired algorithm for the Steiner tree problem in networks[J].IEEE Trans.Comput,2015,64(3):819-832.
[12]倪辰辰,李千目,姜怡,等.基于轻型机步野战场景的DTN通信策略设计与性能分析[J].电信科学,2013,10(10):123-130.