电信科学 ›› 2016, Vol. 32 ›› Issue (9): 107-112.doi: 10.11959/j.issn.1000-0801.2016240

• 研究与开发 • 上一篇    下一篇

车载自组织网中基于车辆密度的可靠性路由协议

蔡蓉,章国安,金丽   

  1. 南通大学电子信息学院,江苏 南通 226019
  • 出版日期:2016-09-15 发布日期:2016-10-20
  • 基金资助:
    国家自然科学基金资助项目;国家自然科学基金资助项目;交通运输部应用基础研究资助项目

Reliability routing protocol based on vehicle density in VANET

Rong CAI,Guoan ZHANG,Li JIN   

  1. School of Electronics and Information,Nantong University,Nantong 226019,China
  • Online:2016-09-15 Published:2016-10-20
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;Project of Ministry of Transport of the People’s Republic of China

摘要:

为了降低转发节点在转发范围内直接寻找一个最优或次优节点的复杂度、减少平均跳数和提高链路的可靠性,提出一种车载自组织网络中基于车辆密度的可靠性路由协议,转发节点首先根据道路车辆密度设置最优块的大小,并将转发范围分割成若干大小相等的块,然后选择其中一个距离转发节点最远的块,最后在被选中的块里根据可靠性原则选择连接时间最长的邻居节点作为中继节点进行转发。仿真结果表明,与EG-RAODV 相比,所提路由协议的平均跳数较少,平均每跳前进距离较大,能够使数据分组快速到达目的节点。

关键词: 车载自组织网络, 路由协议, 平均跳数, 平均每跳前进距离

Abstract:

A reliability routing protocol based on vehicle density in vehicular Ad Hoc network was proposed to reduce the complexity of finding an optimal or sub-optimal node of the forwarding node in forwarding range,reducing the average number of hops and enhancing the reliability of the link.Firstly,the size of the unite block was set by the forwarding node according to the vehicle density in the road.And the forwarding range was cut into several equal blocks.Then the farthest block away from the forwarding node was selected.In the selected block,the neighbor node which had the longest link time was chosen as a relay node to forward according to the principle of reliability finally.Compared with EG-RAODV,the simulated results of the proposed routing protocol show that the average number of hops is less and the average distance of one-hop progress is lager,which means the proposed routing protocol can transmit the data packet to destination node more quickly.

Key words: vehicularAdHocnetwork, routingprotocol, averagenumberofhops, averagedistanceofone-hopprogress

No Suggested Reading articles found!