基于历史与位置信息的容迟网络路由算法

doi:10.3969/j.issn.1000-3428.2018.04.014

摘要/Abstract

摘要： 针对容迟网络消息投递率低、网络时延高的问题,提出一种基于节点历史相遇信息和位置信息选取下一跳路由节点的算法。利用节点间历史相遇信息,筛选出与目的节点相遇次数最多的节点进行消息复制,并进一步采用节点位置信息计算邻居节点的移动方向,得到移动方向夹角较大的一对节点进行消息复制。仿真结果表明,在消息生命周期较短且节点缓存空间不充裕的情况下,与遇到节点即复制消息的传染病算法相比,该算法平均时延降低50%,且具有较高的消息投递率。

关键词: 容迟网络, 路由算法, 历史信息, 位置信息, 移动方向

Abstract: Aiming at the problems of low delivery rate and high latency in Delay Tolerant Network(DTN),a new routing algorithm based on historical encounter information and location information is proposed to select the next routing hop.Using the historical encounter information between nodes to filter the most times’ node which is encountered with destination node for message copy.Further,the location information is used to calculate the moving direction of neighbor nodes,copy message to a pair of nodes whose direction angle is larger.Simulation results show that in the case of short TTL and insufficient node buffer,the proposed algorithm can achieve 50% lower average latency and higher delivery ratio compared with epidemic algorithm which can copy message at once when meets any node.

Key words: 容迟网络, 路由算法, 历史信息, 位置信息, 移动方向

中图分类号:

TP391

王夫沭,李建波,宋有美,陆芳,许殿磊. 基于历史与位置信息的容迟网络路由算法[J]. 计算机工程, doi: 10.3969/j.issn.1000-3428.2018.04.014.

WANG Fushu,LI Jianbo,SONG Youmei,LU Fang,XU Dianlei. Routing Algorithm in Delay Tolerant Network Based on History and Location Information[J]. Computer Engineering, doi: 10.3969/j.issn.1000-3428.2018.04.014.

https://www.ecice06.com/CN/Y2018/V44/I4/89

参考文献

参考文献［1］FALL K.A Delay-tolerant network architecture for challenged Internets［C］//Proceedings of Conference on Applications,Technologies,Architectures,and Protocols for Computer Communications.New York,USA:ACM Press,2003,27-34. ［2］FATIMAH A,JOHARI R.Delay tolerant network:routing issues and performance［J］.International Journal of Autonomic Computing,2016,2(2):99-113. ［3］MCMAHON A,FARRELL S.Delay and disruption tolerant networking［J］.IEEE Internet Computing,2009,13(6):82-87. ［4］RAJ V S,CHEZIAN R M.DELAY-disruption tolerant network (DTN),its network characteristics and core applications［J］.International Journal of Computer Science & Mobile Computing,2013,2(9):256-262. ［5］CAO Yue,SUN Zhili.Routing in delay/disruption tolerant networks:a taxonomy,survey and challenges［J］.IEEE Communications Surveys & Tutorials,2013,15(2):654-677. ［6］LI Yun,WANG Xiaoying,LIU Zhanjun,et al.Analysis of link interruption characteristics in the DTN［J］.Journal on Communications,2008,29(11):232-236. ［7］胡四泉,汪红兵,王俊峰.机会型网络研究综述［J］.计算机科学,2009,36(10):32-37. ［8］TOVAR A,FRIESEN T,FERENS K,et al.A DTN wireless sensor network for wildlife habitat monitoring［C］//Proceedings of Electrical and Computer Engineering.Washington D.C.,USA:IEEE Press,2010:1-5. ［9］JUANG P,OKI H,WANG Yong,et al.Energy-efficient computing for wildlife tracking:design tradeoffs and early experiences with Zebranet［J］.ACM SIGARCH Computer Architecture News,2002,30(5):96-107. ［10］MCKOWN M W,LUKAC M,BORKER A,et al.A wireless acoustic sensor network for monitoring wildlife in remote locations［J］.The Journal of the Acoustical Society of America,2012,132(3):2036. ［11］HULL B,BYCHKOVSKY V,ZHANG Yang,et al.CarTel:A distributed mobile sensor computing system［C］//Proceedings of International Conference on Embedded Networked Sensor Systems.New York,USA:ACM Press,2006:125-138. ［12］LI Xu,SHU Wei,LI Minglu,et al.DTN routing in vehicular sensor networks［C］//Proceedings of Global Telecommunications Conference.Washington D.C.,USA:IEEE Press,2008:1-5. ［13］LI Fan,ZHAO Lei,FAN Xiumei,et al.Hybrid Position-based and DTN forwarding for vehicular sensor networks［J］.International Journal of Distributed Sensor Networks,2012,8(4):184-195. ［14］SMALL T,HAAS Z J.The shared wireless infostation model:a new ad hoc networking paradigm (or where there is a whale,there is a way)［C］//Proceedings of ACM Interational Symposium on Mobile Ad Hoc NETWORKING and Computing.New York,USA:ACM Press,2003:233-244. ［15］CHO H H,CHEN C Y,SHIH T K,et al.Survey on underwater delay/disruption tolerant wireless sensor network routing［J］.IET Wireless Sensor Systems,2014,4(3):112-121. ［16］DEMMER M,FALL K.DTLSR:Delay tolerant routing for developing regions［C］//Proceedings of Workshop on Networked Systems for Developing Regions.New York,USA:ACM Press,2007:1-6. ［17］VAHDAT A,BECKER D.Epidemic routing for partially-connected ad hoc networks［EB/OL］.［2010-11-21］.https://www.mendeley.com/research-papers/epidemic-routing-partially-connected-ad-hoc-networks/. ［18］DE ABREU C S,SALLES R M.Modeling message diffusion in epidemical DTN［J］.Ad Hoc Networks,2014,16(4):197-209. ［19］WU Yahui,SU Deng,HUANG Hongbin.Performance analysis of Hop-limited epidemic routing in DTN with limited forwarding times［J］.International Journal of Communication Systems,2015,28(15):2035-2050. ［20］SPYROPOULOS T,PSOUNIS K,RAGHAVENDRA C S.Spray and wait:an efficient routing scheme for intermittently connected mobile networks［C］//Proceedings of ACM SIGCOMM Workshop on Delay-tolerant Networking.New York,USA:ACM Press,2005:252-259. ［21］SPYROPOULOS T,PSOUNIS K,RAGHAENDRA C S.Spray and focus:efficient mobility-assisted routing for heterogeneous and correlated mobility［C］//Proceedings of the 5th Annual IEEE International Conference on Pervasive Computing and Communications.Washington D.C.,USA:IEEE Press,2007:79-85. ［22］KIM E H,NAM J C,CHOI J I,et al.Probability-based spray and wait protocol in delay tolerant networks［C］//Proceedings of International Conference on Information Networking.Washington D.C.,USA:IEEE Press,2014:412-416. ［23］LINDGREN A,DORIA A,SCHELEN O.Probabilistic routing in intermittently connected networks［J］.ACM Sigmobile Mobile Computing & Communications Review,2003,7(3):19-20. ［24］GRASIC S,DAVIES E,LINDGREN A,et al.The evolution of a DTN routing protocol——ProPHETv2［C］//Proceedings of the 6th ACM Workshop on Challenged Networks.New York,USA:ACM Press,2011:27-30. ［25］GROSSGLAUSER M,TSE D N C.Mobility increases the capacity of ad hoc wireless networks［J］.IEEE/ACM Transactions on Networking,2002,10(10):477-486. ［26］JAIN S,FALL K,PATRA R.Routing in a delay tolerant network［C］//Proceedings of ACM SIGCOMM Conference on Applications,Technologies,Architectures,and Protocols for Computer Communication.New York,USA:ACM Press,2004:145-158. ［27］王欣.容迟网络中基于复制策略的单播路由算法研究［J］.电子设计工程,2013,21(6):24-26. ［28］刘期烈,许猛,李云,等.基于历史效用的机会网络路由算法［J］.计算机应用,2013,33(2):361-364. ［29］关礼安,汪斌强,朱宣勇.一种基于节点多可用下一跳的分级收敛算法［J］.计算机应用研究,2010,27(9):3493-3495. ［30］KER N A,OTT J.The ONE simulator for DTN protocol evaluation［C］//Proceedings of the 2nd International Conference on Simulation Tools and Techniques.Washington D.C.,USA:IEEE Press,2009:55. 编辑刘冰

[1]	王安政, 党建武, 岳彪, 杨景玉. 基于位置信息和注意力机制的路面裂缝检测[J]. 计算机工程, 2024, 50(4): 303-312.
[2]	王文欣, 贺煜航, 陈刚. 基于EM路由算法的医学图像分割UCaps网络[J]. 计算机工程, 2022, 48(2): 268-274.
[3]	刘博阳, 胡舒凯, 施得君, 卢宏生. VTFTR：高维胖树中的无死锁容错路由算法[J]. 计算机工程, 2022, 48(12): 38-44,53.
[4]	陈辉, 高岩. 基于双簇头的WSNs非均匀分簇路由算法[J]. 计算机工程, 2022, 48(10): 184-192.
[5]	缪祎晟, 赵春江, 吴华瑞. 基于改进粒子群的农田WSN路由优化方法[J]. 计算机工程, 2022, 48(10): 218-223.
[6]	潘成胜, 梁芷铭, 石怀峰, 孔志翔. 面向并发业务的卫星网络服务功能链优化算法[J]. 计算机工程, 2021, 47(3): 196-201.
[7]	西尔艾力·色提, 艾山·吾买尔, 王路路, 吐尔根·依布拉音, 马喆康, 买合木提·买买提. 结合单词-字符引导注意力网络的中文旅游文本命名实体识别[J]. 计算机工程, 2021, 47(2): 39-45.
[8]	柳素红, 孙晓, 李春彬. 基于位置信息重建与时频域信息融合的脑电信号情感识别[J]. 计算机工程, 2021, 47(12): 95-102.
[9]	谢勇盛, 杨余旺, 邱修林, 王吟吟. 基于函数逼近的强化学习FANET路由优化算法[J]. 计算机工程, 2021, 47(11): 207-213.
[10]	李翠然, 李昂. 太阳能补给的线型WSN能量高效路由算法[J]. 计算机工程, 2020, 46(9): 178-185.
[11]	吴玉成, 李亮, 马云飞, 刘统. 基于用户位置信息的导频分配方法[J]. 计算机工程, 2020, 46(8): 164-171.
[12]	张泰江, 李勇军, 赵尚弘. 基于GEO/LEO双层卫星网络的路由算法优化设计[J]. 计算机工程, 2020, 46(7): 198-205.
[13]	李洪兵, 刘子路, 陈强, 刘莎, 刘小龙, 梁裕巧, 杨震, 陈立万. 基于分级邻近节点的无线传感器网络分簇路由算法[J]. 计算机工程, 2020, 46(6): 187-195.
[14]	何尔利, 纪澎善, 贾向东, 牛春雨. 位置协助的无人机毫米波通信网络自适应信道估计[J]. 计算机工程, 2020, 46(6): 196-201.
[15]	孙泽宇, 阎奔, 聂雅琳, 刘保罗, 贾馥谦, 来纯晓. 一种带有可控阈值参数的分簇路由优化算法[J]. 计算机工程, 2020, 46(3): 184-191.

选择文件类型/文献管理软件名称

选择包含的内容