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

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.

[1]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[2]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[3]  David Powell,et al.  A Survey of Dependability Issues in Mobile Wireless Networks , 2003 .

[4]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[5]  Dahlia Malkhi Locality-Aware Network Solutions (A survey) , 2004 .

[6]  G. Sicuranza,et al.  The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .

[7]  Qun Li,et al.  Communication in disconnected ad hoc networks using message relay , 2003, J. Parallel Distributed Comput..

[8]  Idit Keidar,et al.  Octopus: A Fault-Tolerant and Ef.cient Ad-hoc Routing Protocol , 2005, SRDS.

[9]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[10]  Dahlia Malkhi Locality-Aware Network Solutions - A survey (Column: Distributed Computing) , 2004, Bull. EATCS.

[11]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Danny Dolev,et al.  LLS: a locality aware location service for mobile ad hoc networks , 2004, DIALM-POMC '04.

[13]  B. R. Badrinath,et al.  Routing on a curve , 2003, CCRV.

[14]  Acm Sigmobile,et al.  DIALM-POMC'04 : proceedings of the the 2004 Joint Workshop on Foundations of Mobile Computing : co-located with ACM/SIGMOBILE MobiCom 2004, October 1, 2004, Philadelphia, Pennsylvania, USA , 2004 .

[15]  Chien-Chung Shen,et al.  Facilitating match-making service in ad hoc and sensor networks using pseudo quorum , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[16]  Ivan Stojmenovic,et al.  Voronoi diagram and convex hull based geocasting and routing in wireless networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[17]  Eric W. Weisstein,et al.  The CRC concise encyclopedia of mathematics , 1999 .

[18]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[19]  Zygmunt J. Haas,et al.  Ad Hoc mobility management with uniform quorum systems , 1999, TNET.

[20]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[21]  H. T. Kung,et al.  Geographic routing for wireless networks , 2000 .

[22]  David B. Johnson,et al.  Routing in Ad Hoc Networks of Mobile Hosts , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[23]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[24]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[25]  Ivan Stojmenovic,et al.  A scalable quorum based location update scheme for routing in ad hoc wireless networks , 1999 .

[26]  Leonidas J. Guibas,et al.  Discrete mobile centers , 2001, SCG '01.

[27]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[28]  Zygmunt J. Haas,et al.  The performance of query control schemes for the zone routing protocol , 1998, SIGCOMM '98.

[29]  Nitin H. Vaidya,et al.  Efficient content location in wireless ad hoc networks , 2004, IEEE International Conference on Mobile Data Management, 2004. Proceedings. 2004.

[30]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[31]  Ivan Stojmenovic Home agent based location update and destination search schemes in ad hoc wireless networks , 1999 .

[32]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[33]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.