基于链路奖惩和节点优选机制的VANETs路由协议  

Routing protocol for VANETs based on mechanisms of reward-punishment of links and optimal selection of nodes

作　　者：袁芬[1] 何永强[2] 徐从富[3] YUAN Fen HE Yong-qiang XU Cong-fu(Department of Computer and Information Technology, Zhejiang Changzheng Vocational and Technical College, Hangzhou 310023, China School of Computer, Henan Institute of Engineering, Zhengzhou 451191, China College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China)

机构地区：[1]浙江长征职业技术学院计算机与信息技术系,浙江杭州310023 [2]河南工程学院计算机学院,河南郑州451191 [3]浙江大学计算机科学与技术学院,浙江杭州310027

出　　处：《计算机工程与设计》2017年第8期2037-2041,2098,共6页Computer Engineering and Design

基　　金：国家自然科学基金项目(61303146);2016年度全国统计科学研究基金项目(2016108)

摘　　要：提出一种面向车辆自组织网络应用的稳定路由协议。依据两节点之间hello数据包传输时间,对两节点之间的通信链路进行奖惩,得到每一条通信链路的奖惩值;综合考虑链路带宽、传输距离、节点移动速度和节点密度4个因素,构建节点优选因子,优选节点优选因子大的节点作为下一跳节点;结合链路奖惩值和节点优选因子构建链路权重,依据链路权重最大准则进行路由发现和路由维护。实验结果表明,与常用的MAODV、GPSR、GPSR-R路由协议相比,该路由协议报文送达率高,端到端平均延时和网络负载小。A stable routing protocol for vehicle Ad Hoc networks applications was proposed. The communication link between the two nodes was rewarded or punished according to the transmission time of hello packets between two nodes, and a reward-punishment value of each communication link was obtained. An optimal selection factor of nodes was built by considering four factors such as link bandwidth, transmission distance, speed and density of nodes, and the next hop node with large optimal selection factor was optimally selected. Link weight was constructed by combining the reward-punishment value of links and optimal selection factor of nodes, and route discovery and route maintenance were executed according to maximum metrics of link weight. Results of experiments show that, the proposed routing protocol has higher packet delivery rate, and lower end-to-end average delay and network load, compared with the common routing protocols such as MAODV, GPSR and GPSR-R.

关 键 词：路由协议 奖惩机制 节点优选因子 链路权重 车辆自组织网络 

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