A Distributed Routing Algorithm Based on the Reliable Path

In this paper we present a distributed routing algorithm based on the reliable path to improve the efficiency of routing protocols in ad hoc network. This protocol takes advantage of the graphical information, velocity and position, to acquire the link lifetime. When the link is broken, the routing information is updated at once. Moreover, one neighbor with the fewest hops to the destination and relatively greater link lifetime is used to forward messages without transmission back-off delay as the next hop. The experimental results show that DBRP can deliver messages more reliably and more quickly compared to SSR.