Skip to main content
SpringerLink
Log in

On a Self-Organizing Multipath Routing Protocol in Mobile Wireless Networks

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

In this paper, we present a self-organizing multipath (SOMP) routing protocol aiming at enhancing success rates of delivery of data packets end-to-end, restricting the routing overhead, and being robust to unstable network conditions. In this SOMP protocol, each mobile host sets up multiple beacons at other hosts to indicate routes to reach it. A beacon is an ordered list of mobile hosts along a path going from the host which holds the beacon, to the host which sets up the beacon. Two functionalities are used for routing data packets to their destinations. The first functionality is a beacon-seeking mechanism, which helps data packets to obtain beacons leading to the destinations of the data packets. The second functionality is a source routing mechanism, which is similar to the one used in Dynamic Source Routing (DSR) protocol and is used to forward data packets to their destinations using the beacons obtained. A balanced binary search tree is used in the SOMP protocol as the embedded forwarding structure, which is built on the identifiers of mobile hosts. This search tree serves for both distributing beacon updates and routing data packets to obtain beacons. The actual routes taken by data packets are jointly determined by the embedded forwarding structure and the underlying network connectivity.

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

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.

Similar content being viewed by others

REFERENCES

  1. D. B. Johnson, D. A. Maltz, and J. Broch. DSR: The dynamic source routing protocol for multihop wireless ad hoc networks. In Charles E. Perkins (ed.), Ad Hoc Networking, Chap. 5, Addison-Wesley, Reading, MA, pp. 139–172, 2001.

  2. D. L. Tennenhouse, J. M. Smith, W. D. Sincoskie, D. J. Wetherall, and G. J. Minden. A survey of active network research. IEEE Communications Magazine, Vol. 35, No. 1, pp. 80–86, 1997.

    Article  Google Scholar 

  3. E. Royer and C.-K. Toh, A review of current routing protocols for ad-hoc mobile wireless networks. In IEEE Personal Communications, April 1999.

  4. C. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of ACM SIGCOMM’94 Conference on Communications Architectures, Protocols and Applications, pp. 234–244, 1994.

  5. 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 Application, pp. 90–100, New Orleans, LA, February 1999.

  6. V. D. Park and S. M. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks. In Proceedings of INFOCOM’97, pp. 1405–1413, 1997.

  7. C.-K. Toh, A novel distributed routing protocol to support ad hoc mobile computing. In Proceedings of 1996 IEEE 15th Annual International Phoenix Conference on Computing and Communications, pp. 480–486, March 1996.

  8. R. Fonseca, S. Ratnasamy, J. Zhao, C. Tien Ee, D. Culler, S. Shenker, and Ion Stoica, Beacon-vector routing: Scalable point-to-point routing in wireless sensor networks. In Proceedings of the 2nd Symposium on Networked Systems Design and Implementation (NSDI ‘05), Boston, MA, April 2005.

  9. W. Litwin, M.-A. Neimat, and D. A, Schneider. LH: Linear hashing for distributed files. In Proceedings of the 1993 ACM SIGMOD international conference on Management of data, pp. 327–336. ACM Press, 1993.

  10. P. Bozanis and Y. Manolopoulos, LDT: A logarithmic distributed search tree. In Proceedings of the 4th Workshop on Distributed Data and Structures (WDAS’02), Paris, France, 2002.

  11. K. Aberer, P-Grid: A self-organizing access structure for P2P information systems. Lecture Notes in Computer Science, Vol. 2172, pp. 179–192, 2001.

    Article  Google Scholar 

  12. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149–160, 2001.

  13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content addressable network. In Proceedings of ACM SIGCOMM, 2001.

  14. J. Li, J. Jannotti, D. S. J. De Couto, D. R. Karger, and R. Morris, A scalable location service for geographic ad hoc routing. In Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (MobiCom ‘00), pp. 120–130, Boston, Massachusetts, August 2000.

  15. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and John D, Kubiatowicz, Tapestry: A resilient global-scale overlay for service deployment, IEEE Journal on Selected Areas in Communications, Vol. 22, No. 1, January 2004.

  16. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, Topologically-aware overlay construction and server selection. In Proceedings of IEEE INFOCOM’02, June 2002.

  17. C. Maihfer, A survey of geocast routing protocols. IEEE Communications Surveys and Tutorials, April 2004.

  18. K. Kar, M. Kodialam, and T. V. Lakshman, Routing restorable bandwidth guaranteed connections using maximum 2-route flows. IEEE/ACM Transaction on Networking Vol. 11, No. 5, pp. 772–781, 2003.

  19. The Rice Monarch Project. The Wireless and Mobility Extensions to ns-2. Available from http://www.monarch.cs.cmu.edu/. Computer Science Department, Rice University.

  20. The VINT Project. The network simulator ns-2. Available from http://www.isi.edu/nsnam/ns/. UC Berkeley, LBL, USC/ISI, and Xerox PARC.

  21. Wireless and mobility extensions to ns. Available from http://www.monarch.cs.rice.edu /ftp/monarch/wireless-sim/ns-cmu.ps.

  22. 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 ACM/IEEE Conference on Mobile Computing and Networking (MobiCom), pp. 85–97, October 1998.

  23. J. Yoon, M. Liu, and B. Noble, Random waypoint considered harmful. In Proceedings of IEEE INFOCOM’03, June 2003.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of North Dakota, Grand Forks, North Dakota, USA

    Jun Liu

  2. Computer Science Department, University of North Dakota, Box 9015, Grand Forks, North Dakota, 58202, USA

    Jun Liu

Authors
  1. Jun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jun Liu.

Additional information

Jun Liu is an Assistant Professor in the Computer Science Department at University of North Dakota. He received the PhD degree in Computer Science at Boston University in 2003, MS degree from the Institute of Software, Chinese Academy of Science, in 1994, and BS degree at Beijing University of Posts and Telecommunications in 1989. His research area includes Ad-Hoc Routing in Wireless Networks.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, J. On a Self-Organizing Multipath Routing Protocol in Mobile Wireless Networks. J Netw Syst Manage 14, 103–126 (2006). https://doi.org/10.1007/s10922-005-9017-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-005-9017-2

KEY WORDS:

Search

Navigation