计算机工程2017，Vol.43Issue(5)：75-82,8.DOI:10.3969/j.issn.1000-3428.2017.05.012
一种基于历史相遇信息的容迟网络地理路由算法
A Geographic Routing Algorithm for Delay Tolerant Network Based on History Encounter Information
摘要
Abstract
In order to make the message transmit in a delay tolerant network more efficiently,the node location,moving direction and other geographic information and the degree of nodes frequently encounter history are combined,this paper proposes a delay tolerant network geographic routing algorithm is proposed.The algorithm uses nodes encounter history information as news distribution copy,thereby it reduces the copy number.The angle of the moving direction of the neighbor nodes for the relay selection is further optimized,so as to achieve high delivery ratio and low average end-to-end delay.Simulation results show that when nodes move relatively slow,and news life cycle is short,the message delivery rate of the proposed algorithm is better than that of Spray & Wait,Epidemic and Prophet routing algorithms.When message life cycle is very short and the cache resource of nodes is the bottleneck factors limiting the performance of the routing algorithm,the network load rate of the proposed algorithm is less than 40％ of Epidemic,less than 25％ of Prophet,and average number of hops and average delay remain less.关键词
容迟网络/地理路由算法/局部信息/移动方向/历史信息Key words
delay tolerant network/geographical routing algorithm/local information/moving direction/history information分类
信息技术与安全科学引用本文复制引用
王艳,李建波,宋有美,王夫沭..一种基于历史相遇信息的容迟网络地理路由算法[J].计算机工程,2017,43(5):75-82,8.基金项目
国家自然科学基金(61502261,61572457,61379132) （61502261,61572457,61379132）
山东省自然科学基金(ZR2013FQ022) （ZR2013FQ022）
山东省教育厅高校科技计划项目(J14LN85). （J14LN85）
