吴振华, 胡鹏. VANET中一种优化路由开销算法研究[J]. 南昌航空大学学报(自然科学版), 2016, 30(2): 28-36. DOI: 10.3969/j.issn.1001-4926.2016.02.005
引用本文: 吴振华, 胡鹏. VANET中一种优化路由开销算法研究[J]. 南昌航空大学学报(自然科学版), 2016, 30(2): 28-36. DOI: 10.3969/j.issn.1001-4926.2016.02.005
WU Zhen-hua, HU Peng. An Optimized Routing Overhead Algorithm Research for VANET[J]. Journal of nanchang hangkong university(Natural science edition), 2016, 30(2): 28-36. DOI: 10.3969/j.issn.1001-4926.2016.02.005
Citation: WU Zhen-hua, HU Peng. An Optimized Routing Overhead Algorithm Research for VANET[J]. Journal of nanchang hangkong university(Natural science edition), 2016, 30(2): 28-36. DOI: 10.3969/j.issn.1001-4926.2016.02.005

VANET中一种优化路由开销算法研究

An Optimized Routing Overhead Algorithm Research for VANET

  • 摘要: 在VANET中为确保链路质量优化路由算法开销问题,提出一种分簇路由算法:RCR(Road Clustering Routing)。RCR利用车辆携带的电子地图,对路段进行网格分簇。由簇首查找路由,降低路由发现开销。并通过位置预测机制,降低邻居表维护开销,并同时改善链路质量。在NS2仿真平台中,模拟城市与高速公路场景。实验结果表明RCR在确保链路质量因素条件下,路由发现过程开销、簇维护开销有很大优化。

     

    Abstract: To ensure link quality and optimize routing algorithm overhead for VANET, a Road Clustering Routing (RCR) for VANET is proposed. RCR uses an electronic map carried by vehicle to divide into grid cluster on the road. The cluster head is used for finding routing and reducing routing overhead. Moreover, the use of node location prediction mechanism can lower maintenance overhead of the neighbor table and improve the link quality. The scene of city and highway was simulated in NS2 platform. Results show that RCR reduces the routing overhead and cluster maintenance overhead, and optimizes link quality effectively.

     

/

返回文章
返回