An efficient routing protocol for wireless networks

  • Authors:
  • Shree Murthy;J. J. Garcia-Luna-Aceves

  • Affiliations:
  • Univ. of California, Santa Cruz;-

  • Venue:
  • Mobile Networks and Applications - Special issue: routing in mobile communications networks
  • Year:
  • 1996

Quantified Score

Hi-index 0.01

Visualization

Abstract

We present the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the distance and second-to-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm (DBF), DUAL (a loop-free distance-vector algorithm) and an Ideal Link-state Algorithm (ILS), which represent the state of the art of internet routing. The simulation results indicate that WRP is the most efficient of the alternatives analyzed.