基于邻居信息交换的机会网络低时延路由算法  

Low-delay routing algorithm for opportunistic networks by exchanging the neighbourhood information

作　　者：任智[1,2] 黄勇[1,2] 曹建玲[1,2] 祖力[1,2] 

机构地区：[1]重庆邮电大学通信与信息工程学院,重庆400065 [2]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065

出　　处：《华中科技大学学报（自然科学版）》2011年第2期94-97,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60972068);教育部留学回国人员科研启动基金资助项目(2010-1561);重庆市自然科学基金资助项目(2009BB2085);重庆市教委科研项目(KJ090524)

摘　　要：提出一种以Epidemic Routing为基础、采用两跳邻居信息交换方式的机会网络低时延路由算法———LDREN,在分组索引的交换过程中交换两跳邻居信息从而增强对本地拓扑的掌握,并优先发送位于最后两跳的数据分组;同时在节点相遇感知过程中借助ECHO消息从节点缓存中删除已到达目的节点的分组.性能分析结果表明,与经典的Epidemic路由算法及其改进算法ARER相比,LDREN在分组端到端时延、分组传送成功率、存储空间占用等方面的性能得到整体提升.LDREN （low-delay routing based on exchange of two-hop neighborhood information） was proposed based on Epidemic Routing adopting exchange of two-hop neighborhood information. Twohop neighborhood information was exchanged in the process of packet indexes exchange to enhance the mastery of local network, and send the packets approaching their destinations last two hops firstly. Moreover, in the process of sensing encountered nodes, echo messages were used to delete the packets which have reached destinations from nodes＇ buffer. Performance results show that LDREN outperforms the classical epidemic routing algorithm and ARER （adaptive randomized epidemic routing） in terms of delivery rate, end-to-end delay, and memory overhead.

关 键 词：无线网络 机会网络 路由算法 两跳邻居信息 交换 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]