Skip to main content
Log in

An efficient routing protocol for wireless networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript


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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others


  1. R. Albrightson, J.J. Garcia-Luna-Aceves and J. Boyle, EIGRPA fast routing protocol based on distance vectors,Proc. Networld/Interop 94, Las Vegas, Nevada (May 1994).

  2. D. Beyer et al., Packet radio network research, development and application,Proc. SHAPE Conf. on Packet Radio, Amsterdam (1989).

  3. D. Beyer, Accomplishments of the DARPA SURAN program,Proc. IEEE MILCOM 90, Monterey, California (Dec. 1990), pp. 855–862.

  4. D. Bertsekas and R. Gallager,Data Networks, second ed. (Prentice Hall, 1992).

  5. C. Cheng, R. Reley, S.P.R., Kumar and J.J. Garcia-Luna-Aceves, A loop-free extended Bellman-Ford routing protocol without bouncing effect, ACM Comp. Commun. Rev. 19(4) 1989 224–236.

    Google Scholar 

  6. M. Scott Corson and Anthony Ephremides, A distributed routing algorithm for mobile wireless networks. Wireless Networks 1 (1995) 61–81.

    Google Scholar 

  7. J.J. Garcia-Luna-Aceves, A fail-safe routing algorithm for multihop packet-radio networks,IEEE INFOCOM (April, 1986).

  8. J.J. Garcia-Luna-Aceves, Loop-free routing using diffusing computations, IEEE/ACM Trans. Networking 1(1) (1993) 130–141.

    Google Scholar 

  9. J. Hagouel, Issues in routing for large and dynamic networks, IBM Research Report, RC 9942, No. 44055 (April 1983).

  10. P.A. Humblet, Another adaptive shortest-path algorithm, IEEE Trans. Commun. 39(6) (1991) 995–1003.

    Google Scholar 

  11. B.M. Leiner, D.L. Nielson and F.A. Tobagi,Proc. IEEE, Packet Radio Networks Special Issue (Jan. 1987).

  12. J. Moy, OSPF version 2, RFC 1583 (March 1994).

  13. S. Murthy and J.J. Garcia-Luna-Aceves, A more efficient pathfinding algorithm,28th Asilomar Conference, Pacific Groove, CA (Nov. 1994) pp. 229–233.

  14. C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,ACM SIGCOMM (Oct. 1994) pp. 234–244.

  15. B. Rajagopalan and M. Faiman, A responsive distributed shortest-path routing algorithm within autonomous systems, J. Internetworking: Res and Exp. 2(1) (1991) 51–69.

    Google Scholar 

  16. Y. Rekhter and T. Li, A border gateway protocol 4 (BGP-4), Network Working Group Internet Draft (Jan. 1994).

  17. W. T. Zaumen, Simulations in Drama, Network Information System Center, SRI International, Menlo Park, California (Jan. 1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations


Additional information

This work was supported in part by the Advanced Research Projects Agency (ARPA) under contract F19628-93-C-0175 and by the Office of Naval Research under Contract No. N-00014-92-J-1807.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Murthy, S., Garcia-Luna-Aceves, J.J. An efficient routing protocol for wireless networks. Mobile Netw Appl 1, 183–197 (1996).

Download citation

  • Issue Date:

  • DOI: