Optimal Reactive Routing Protocol (ORRP): A New Reactive Routing Protocol for the Shortest Path in Ad Hoc Networks

摘要

In this paper, we present a new reactive routing protocol that we call Optimal Reactive Routing Protocol (ORRP). The proposed protocol does not require global periodic advertisement of routing messages like the proactive approaches. At the same time, ORRP guarantees optimal path solution. The protocol uses the Dijkstra's shortest path routing algorithm. The demand on the overall bandwidth available is substantially less for the proposed protocol. It has been established that ORRP combines the advantages of both proactive and reactive routing protocols while reducing the limitations of the two approaches.