Skip to main content
SpringerLink
Log in

Octopus: A fault-tolerant and efficient ad-hoc routing protocol

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Mobile ad-hoc networks (MANETs) are failure-prone environments; it is common for mobile wireless nodes to intermittently disconnect from the network, e.g., due to signal blockage. This paper focuses on withstanding such failures in large MANETs: we present Octopus, a fault-tolerant and efficient position-based routing protocol. Fault-tolerance is achieved by employing redundancy, i.e., storing the location of each node at many other nodes, and by keeping frequently refreshed soft state. At the same time, Octopus achieves a low location update overhead by employing a novel aggregation technique, whereby a single packet updates the location of many nodes at many other nodes. Octopus is highly scalable: for a fixed node density, the number of location update packets sent does not grow with the network size. And when the density increases, the overhead drops. Thorough empirical evaluation using the ns2 simulator with up to 675 mobile nodes shows that Octopus achieves excellent fault-tolerance at a modest overhead: when all nodes intermittently disconnect and reconnect, Octopus achieves the same high reliability as when all nodes are constantly up.

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. Grid modules for ns2. http://www.pdos.lcs.mit.edu/grid.

  2. The network simulator - ns-2. www.isi.edu/nsnam/ns/.

  3. I. Abraham, D. Dolev and D. Malkhi, LLS: A locality aware location service, in: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2004), Philadelphia, Pennsylvania, USA. (October 2004).

  4. I. Aydin and C.C. Shen, Facilitating match-making service in ad hoc and sensor networks using pseudo quorum. In Proceedings of 11th International Conference on Computer Communications and Networks (ICCCN 2002) (2002).

  5. S. Basagni, I. Chlamtac, V.R. Syrotiuk and B.A. Woodward, A distance routing effect algorithm for mobility (DREAM), in: ACM/IEEE MobiCom (Dallas, Texas 1998).

  6. C. Basile, M.-O. Killijian and D. Powell, A survey of dependability issues in mobile wireless networks. Technical report, LAAS CNRS, France (February 2003).

  7. B. Chen, K. Jamieson, H. Balakrishnan and R. Morris. Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks, in: 7th ACM MOBICOM, Rome, Italy (July 2001).

  8. F. Dai and J. Wu, An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transaction on Parallel and Distributed Systems 15(10) (2004) 334–347.

    Article  Google Scholar 

  9. J. Gao, L.J. Guibas, J. Hershberger, L. Zhang and A. Zhu, Discrete mobile centers, in: Symposium on Computational Geometry (2001) pp. 188–196.

  10. S. Giordano and M. Hamdi, Mobility management: The virtual home region, Technical report (1999).

  11. Z.J. Haas, J.Y. Halpern and L. Li, Gossip-based Ad hoc routing, in: IEEE INFOCOM 2002 (2002).

  12. Z.J. Haas and B. Liang, Ad hoc mobility management with uniform quorum systems, IEEE/ACM Trans. on Networking 7(2) (1999) 228–240.

    Google Scholar 

  13. Z.J. Haas and M.R. Pearlman, The performance of query control schemes for the zone routing protocol, in: SIGCOMM (1998) pp. 167–177.

  14. P.H. Hsiao, Geographical region summary service for geographical routing. Mobile Computing and Communications Review 5(4) (2001).

  15. D. Johnson, Routing in ad hoc networks of mobile hosts, in: Workshop on Mobile Computing Systems and Applications, Santa Cruz, CA, U.S. (1994).

  16. Y.-B. Ko and N.H. Vaidya, Location-aided routing (LAR) in mobile ad hoc networks, in: Mobile Computing and Networking (1998) pp. 66–75.

  17. E. Kranakis, H. Singh and J. Urrutia, Compass routing on geometric networks, in: Proceedings of the 11th Canadian Conference on Computational Geometry (1999) pp. 51–54.

  18. J. Li, J. Jannotti, D. De Couto, D. 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) (August 2000) pp. 120–130.

  19. Q. Li and D. Rus, Communication in disconnected ad hoc networks using message relay. Parallel Distrib. Comput. 63 (2003) 75–86.

    Article  MATH  Google Scholar 

  20. D. Malkhi, Locality-aware network solutions (a survey). TR 2004-6, School of Computer Science and Engineering, The Hebrew University (2004).

  21. M. Mauve, J. Widmer and H. Hartenstein, A survey on position-based routing in mobile ad hoc networks (2001).

  22. B. Nath and D. Niculescu, Routing on a curve, in: HotNets-I, Princeton, NJ (2002).

  23. V.D. Park and M.S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: INFOCOM (3) (1997) pp. 1405–1413.

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

  25. C. Perkins, E. Royer and S.R. Das, Ad hoc on demand distance vector (aodv) routing. internet draft (work in progress), internet engineering task force (October 1999). www.ietf.org/internet-drafts/draft-ietf-manet-aodv-04.txt.

  26. I. Stojmenovic, Home agent based location update and destination search schemes in ad hoc wireless networks, Technical report (1999).

  27. I. Stojmenovic and P. Pena, A scalable quorum based location update scheme for routing in ad hoc wireless networks. TR 99-09, SITE, University of Ottawa (1999).

  28. I. Stojmenovic, A.P. Ruhil, and D.K. Lobiyal, Voronoi diagram and convex hull based geocasting and routing in wireless networks. Wireless Communications and Mobile Computing, Special Issue on Ad Hoc Wireless Networks 6(2) (2006) 247–258.

    Google Scholar 

  29. J. Tchakarov and N. Vaidya, Efficient content location in wireless ad hoc networks, in: Proceedings of IEEE International Conference on Mobile Data Management (MDM) (2004).

  30. P. Tsuchiya, The landmark hierarchy: A new hierarchy for routing in very large networks, in: ACM Sigcomm (1988).

  31. E.W. Weisstein, CRC Concise Encyclopedia of Mathematics, 2nd edn.

  32. J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks. Telecommunication Systems, Special Issue on Mobile Computing and Wireless Networks 18(1/3) (2001) 13–36.

  33. Y. Xu, J.S. Heidemann and D. Estrin, Geography-informed energy conservation for ad hoc routing, in: Mobile Computing and Networking (2001) pp. 70–84.

Download references

Author information

Authors and Affiliations

  1. The Technion Department of Computer Science, Israel Institute of Technology, Technion City, Haifa, 32000, Israel

    Roie Melamed

  2. The Technion Department of Electrical Engineering, Israel Institute of Technology, Technion City, Haifa, 32000, Israel

    Idit Keidar & Yoav Barel

Authors
  1. Roie Melamed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Idit Keidar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yoav Barel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roie Melamed.

Additional information

A preliminary version of this paper appears in Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005) October 26–28, 2005, Orlando, Florida.

Idit Keidar is a faculty member at the department of Electrical Engineering at the Technion Israel Institute of Technology, and a recipient of the national Alon Fellowship for new faculty members. She holds Ph.D., M.Sc. (summa cum laude), and B.Sc (summa cum laude) degrees from the Hebrew University of Jerusalem. She was a postdoctoral research associate at MIT’s laboratory for Computer Science, where she held post-doctoral fellowships from Rothschild Yad-Hanadiv and NSF CISE. Dr. Keidar has consulted for BBN Technologies (a Verizon Company) in the area of fault-tolerance and intrusion tolerance, and for Microsoft Research in the area of fault-tolerant storage systems. Dr. Keidar’s research focuses on reliability in distributed algorithms and system. She is the academic head of Software Systems Laboratory at the Technion. Dr. Keidar served as a member of the Steering Committee of the ACM Symposium on Principles of Distributed Computing (PODC), has served on numerous program committees of leading conferences in the area of distributed and parallel computing, has twice served as a vice-chair for the IEEE International Conference on Distributed Computing Systems (ICDCS), and once served as a vice-chair for Euro-Par.

Yoav Barel is a Senior Business Line Manager at Sun Microsystems. He holds a B.Sc from the Technion—Israel Institute of Technology. Mr. Barel works with wireless carriers world wide and assists them in deploying innovative services based on cutting edge Java technologies.

Roie Melamed is a research staff member at IBM Haifa Research Laboratory. He holds Ph.D. and B.A. (cum laude) degrees from the Technion—Israel Institute of Technology. Dr. Melamed’s research focuses on reliability in distributed systems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Melamed, R., Keidar, I. & Barel, Y. Octopus: A fault-tolerant and efficient ad-hoc routing protocol. Wireless Netw 14, 777–793 (2008). https://doi.org/10.1007/s11276-006-0013-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-0013-6

Keywords

Search

Navigation