A Long-Life, Shortest Path Routing Algorithm for Wireless Inter-vehicle Networks

摘要

In this paper, we proposed a long-life, shortest path routing method for interval-vehicle communication. Firstly, we form the inter-vehicle network into the layered network to construct the shortest path. Next, we deduce the link with maximal lifetime between two directly linked vehicles according to their velocities and moving directions. Furthermore, the lifetime of one hop neighbors is propagated to non-directly linked vehicles to build the long-life routing path. Simulation results show that the proposed method can choose better reliability path than the AODV and the method that only considers the directly linked neighbor with maximal lifetime.