基于节点密度和链路稳定性的AODV路由协议  

AODV routing algorithm based on node density and link stability

作　　者：孙友伟[1] 王楠[1] 孙小田[1] 

机构地区：[1]西安邮电大学通信与信息工程学院,陕西西安710061

出　　处：《计算机工程与设计》2016年第12期3201-3204,3234,共5页Computer Engineering and Design

摘　　要：为提高车联网通信中节点间数据传输的效率,提出一种基于节点密度和链路稳定性的按需路由算法。在节点的有效信号覆盖范围内根据节点间的相对距离设置转发等待时间,利用Hello报文统计各节点的邻节点数,依据邻节点数确定各节点分组转发概率,根据运动速度及方向计算中继节点的活跃时间,得到整条源至目的节点的链路有效时间,比较链路有效时间的大小选择稳定性高的路由。NS2仿真结果表明,优化后的算法提高了节点的平均分组投递率,降低了网络的平均时延,尤其在车辆节点密集情况下,路由的整体性能较AODV具有明显优化。To ensure the effective transmission of data between nodes in the vehicle network communication,a routing algorithm based on node density and link stability was submitted.According to the relative distance between the nodes in the effective signal coverage of the node,the forwarding waiting time was set,the Hello packet was used to obtain the adjacent node number and determine the packet forwarding probability.According to the velocity and direction of motion,the active time of the node was calculated to get the link effective time from the entire source to the destination node.The high stability of the better route was selected.The NS2 simulation results show that the optimized algorithm improves the average packet delivery ratio of the nodes and the average time delay is reduced,especially in the dense case of vehicle nodes,the overall performance of the routing is optimized obviously compared to AODV.

关 键 词：车联网 最佳路由 盲目洪泛 按需距离矢量路由 自组织网络 

分 类 号：TN913.6[电子电信—通信与信息系统]