Skip to main content
SpringerLink
Log in

RPSF: A Routing Protocol with Selective Forwarding for Mobile Ad-Hoc Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Many existing reactive routing algorithms for mobile ad-hoc networks use a simple broadcasting mechanism for route discovery which can lead to a high redundancy of route-request messages, contention, and collision. Position-based routing algorithms address this problem but require every node to know the position and velocity of every other node at some point in time so that route requests can be propagated towards the destination without flooding the entire network. In a general ad-hoc network, each node maintaining the position information of every other node is expensive or impossible. In this paper, we propose a routing algorithm that addresses these drawbacks. Our algorithm, based on one-hop neighborhood information, allows each node to select a subset of its neighbors to forward route requests. This algorithm greatly reduces the number of route-request packets transmitted in the route-discovery process. We compare the performance of our algorithm with the well known Ad-hoc On-demand Distance Vector (AODV) routing algorithm. On average, our algorithm needs less than 12.6% of the routing-control packets needed by AODV. Simulation results also show that our algorithm has a higher packet-delivery ratio and lower average end-to-end delay than AODV.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. Clausen, C. Dearlove, and P. Jacquet, “The Optimized Link-State Routing Protocol version 2”, Mobile Ad-hoc Networks (MANET) Internet Drafts, June 2006.

  2. R.G. Ogier, F.L. Templin, and M.G. Lewis, Topology Dissemination Based on Reverse-Path Forwarding (TBRPF), February 2004.

  3. C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, in Proceedings of the Conference on Communications Architectures, Protocols and Applications, pp. 234–244, London, United Kingdom, ACM Press, 1994.

  4. Johnson D.B., Maltz D.A., “Dynamic Source Routing in Ad Hoc Wireless Networks”. In: Imielinski, Korth (eds) Mobile Computing Vol. 353. Kluwer Academic Publishers, 1996.

  5. C.E. Perkins and I. Chakeres, “Dynamic MANET On-demand (DYMO) Routing”, Mobile Ad-hoc Networks (MANET) Internet Drafts, June 2006.

  6. C.E. Perkins and E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing”, in Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100, New Orleans, LA, February 1999.

  7. Z.J. Haas and M.R. Pearlman, “The Performance of Query Control Schemes for the Zone Routing Protocol”, in Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 23–29, Seattle, Washington, United States, ACM Press, 1999.

  8. J. Broch, D.A. Maltz, D.B. Johnson, Y.C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-hop Wireless Ad Hoc Network Routing Protocols”, in Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 85–97, Dallas, Texas, United States, ACM Press, 1998.

  9. S.R. Das, C.E. Perkins, and E.E. Royer, “Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks”, in Proceedings of the INFOCOM, pp. 3–12, 2000.

  10. Z. Haas, “A New Routing Protocol for the Reconfigurable Wireless Networks”, in Proceedings of the IEEE International Conference on Universal Personal Communications, pp. 562–566, October 1997.

  11. V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks”, in Proceedings of the INFOCOM, pp. 1405–1413. IEEE Computer Society, 1997.

  12. Wan P.J., Alzoubi K.M., Frieder O., (2004). “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks”. Mobile Network Applications 9(2): 141–149

    Article  Google Scholar 

  13. S. Basagni, I. Chlamtac, V.R. Syrotiuk, and B.A. Woodward, “A Distance Routing Effect Algorithm for Mobility (DREAM)”, in MobiCom 1998: Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 76–84, New York, NY, USA, ACM Press, 1998.

  14. L. Blazevic, J.L. Boudec, and S. Giordano, “A Location-Based Routing Method for Mobile Ad Hoc Networks”, IEEE Transactions on Mobile Computing, Vol. 4, No. 2, pp. 97–110, March/April 2005.

  15. Bose P., Morin P., Stojmenovic I., Urrutia J., (2001). “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks”. Wireless Networks 7(6): 609–616

    Article  MATH  Google Scholar 

  16. Jain R., Puri A., Sengupta R., (February 2001). “Geographical Routing Using Partial Information for Wireless Ad Hoc Networks”. Personal Communications 8(1): 48–57

    Article  Google Scholar 

  17. Karp B., Kung H.T., “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, in Mobile Computing and Networking, pp. 243–254, 2000.

  18. Y.B. Ko and N.H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks” in  Mobile Computing and Networking, pp. 66–75, 1998.

  19. M. Colagrosso, N. Enochs, and T. Camp, “Improvements to Location-Aided Routing Through Directional Count Restrictions”, in International Conference on Wireless Networks, pp. 924–929, 2004.

  20. G. Xing, C. Lu, R. Pless, and Q. Huang, “On Greedy Geographic Routing Algorithms in Sensing-Covered Networks”, in MobiHoc 2004: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 31–42, New York, NY, USA, ACM Press, 2004.

  21. Mauve M., Widmer J., Hartenstein H., (November 2001). “A Survey on Position-Based Routing in Mobile Ad-Hoc Networks”. IEEE Network Magazine 15(6): 30–39

    Article  Google Scholar 

  22. Ho Y.K., Liu R.S., (April 2005). “Checkerboard-Like Routing Protocol for Ad Hoc Mobile Wireless Networks”. Wireless Personal Communications 33(2): 177–196

    Article  Google Scholar 

  23. S. Lee, B. Bhattacharjee, and S. Banerjee, “Efficient Geographic Routing in Multihop Wireless Networks”, in MobiHoc 2005: Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 230–241, New York, NY, USA, ACM Press, 2005.

  24. S.Y. Ni, Y.C. Tseng, Y.S. Chen, and J.P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network”, in MobiCom 1999: Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 151–162, New York, NY, USA, ACM Press, 1999.

  25. Peng W., Lu X., (2001). “AHBP: An Efficient Broadcast Protocol for Mobile Ad Hoc Networks”. Journal Computer Science Technology 16(2): 114–125

    Article  MATH  MathSciNet  Google Scholar 

  26. W. Peng and X.C. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks”, in MobiHoc, pp. 129–130, 2000.

  27. B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks”, in Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), pp. 194–205, 2002.

  28. R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang, “Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks”, in Proceedings of the INFOCOM, Vol. 3, pp. 22–26, April 2001.

  29. X. Zeng, R. Bagrodia, and M. Gerla, “GloMoSim: A Library for Parallel Simulation of Large-Scale Wireless Networks”, in Workshop on Parallel and Distributed Simulation, pp. 154–161, 1998.

  30. IEEE, “Wireless LAN Medium Access Control and Physical Layer Specifications”, IEEE 802.11 Standard, IEEE Computer Society LAN MAN Standards Committee, August 1999.

  31. J. Yoon, M. Liu, and B. Noble, “Random Waypoint Considered Harmful”, in Proceedings of the INFOCOM, pp. 1312–1321, 2003.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kentucky, Lexington, KY, 40506, USA

    Q. Jiang, R. A. Finkel, D. Manivannan & M. Singhal

Authors
  1. Q. Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. A. Finkel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Manivannan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Singhal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. Manivannan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jiang, Q., Finkel, R.A., Manivannan, D. et al. RPSF: A Routing Protocol with Selective Forwarding for Mobile Ad-Hoc Networks. Wireless Pers Commun 43, 411–436 (2007). https://doi.org/10.1007/s11277-006-9231-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-006-9231-6

Keywords

Search

Navigation