Mobile Networks and Applications

, Volume 1, Issue 2, pp 183–197

An efficient routing protocol for wireless networks

  • Shree Murthy
  • J. J. Garcia-Luna-Aceves
Article

DOI: 10.1007/BF01193336

Cite this article as:
Murthy, S. & Garcia-Luna-Aceves, J.J. Mobile Netw Appl (1996) 1: 183. doi:10.1007/BF01193336
  • 413 Downloads

Abstract

We present the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the distance and secondto-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.

Copyright information

© Baltzer Science Publishers BV 1996

Authors and Affiliations

  • Shree Murthy
    • 1
  • J. J. Garcia-Luna-Aceves
    • 1
  1. 1.Computer EngineeringUniversity of CaliforniaSanta CruzUSA