长安大学 信息工程学院,陕西,西安,710018
纸质出版:2018
移动端阅览
段宗涛, 杨阳, 樊娜, 朱依水. 概率路由中基于连接时间的机会转发算法[J]. 微电子学与计算机, 2018, 35(12): 50-54.
DUAN Zong-tao, YANG Yang, FAN Na, et al. Opportunistic Forwarding Algorithm Based on Connection Time in Probabilistic Routing[J]. 2018, 35(12): 50-54.
概率预测PRoPHET路由没有考虑到转发节点的有效性
存在多个中继节点预测性相同的情况时
移动性会使得节点间的连接时间不同而导致消息投递率低和网络负载过大的缺点.因此
预测概率还需考虑节点相遇持续时间对消息数据完整传递的影响
本文提出了一种基于连接时间的概率路由算法(PRoPHET-CT)
增加了节点间连接时间占空比的影响因素.对比实验结果表明在节点密度较大的机会网络环境中
该改进算法有着较高的投递概率
同时降低了网络负载以及节点的平均跳数.
In probabilistic prediction PRoPHET routing the effectiveness of the forwarding node was not considered. There are disadvantages that in the case of the same predictability of the multiple relay nodes
mobility will cause the connection time between nodes to be different
resulting in the low message delivery rate and excessive network load. Therefore
the influence of the node encounter duration on the complete transmission of message data should be considered when calculating the prediction probabilities. This paper proposes a probabilistic routing algorithm based on Connection Time (PRoPHET-CT)
which incorporates the factors that influence the duty cycle of the connection time between nodes. The comparison experimental results show that the improved algorithm has a higher probability of delivery in the network environment with high node density. And also
this algorithm can reduce the network load and the average hops of the nodes.
Lindgren A, Doria A, Schelén O. Probabilistic routing in intermittently connected networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3): 19-20. DOI: 19
Pathak S, Gondaliya N, Raja N. A survey on PROPHET based routing protocol in delay tolerant network[C]//International Conference on Emerging Trends % Innovation in ICT. Skopje, Macedonia, 2017: 110-115.
He J, Cai L, Pan J, et al. Delay analysis and routing for two-dimensional vanets using carry-and-forward mechanism[J]. IEEE Transactions on Mobile Computing, 2017 (99):1830-1841. DOI: 1830
Rashid S, Ayub Q, Abdullah A H. Reactive weight based buffer management policy for DTN routing protocols[J]. Wireless Personal Communications, 2015, 80(3): 993-1010. DOI: 993
Sati S, Probst C, Graffi K. Implementing forward and drop policies for improving PRoPHET's routing performance[C]// International Conference on Mobile Ad-Hoc and Sensor Networks. Chengdu, China, IEEE.2017: 236-242.
Salvador Gonzalez, Victor Ramos. A delay tolerant broadcast protocol for VANETs[C]//International Conference on Broadcast Technology and Multimedia Communication[s.l.]. 2010.
Amirthavalli R, Dhaya R, Chandrasoodan M S. A survey of routing algorithms in delay tolerant networks[C]//International Conference on Applied and Theoretical Computing and Communication Technology. Tumkuru, Karnataka, India, IEEE, 2017: 469-473.
Qi W, Song Q, Wang X, et al. Trajectory data mining-based routing in DTN-enabled vehicular Ad Hoc networks[J]. IEEE Access, 2017 (99):24128-24138. DOI: 24128
0
浏览量
12
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010602201714号