Online Multi-path Routing in a Maze

We consider the problem of route discovery in a mesh network with faulty nodes. The number and the positions of the faulty nodes are unknown. It is known that a flooding strategy like expanding ring search can route a message linear in the minimum number of steps d while it causes a traffic (i.e. the total number of messages) of O(d 2 ). For optimizing traffic a single-path strategy is optimal producing traffic O(d+p), where p is the number of nodes that are adjacent to faulty nodes. We present a deterministic multi-path online routing algorithm that delivers a message within O(d) time steps causing traffic O(d + p log 2 d). This algorithm is asymptotically as fast as flooding and nearly traffic-optimal up to a polylogarithmic factor.

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

[2]  Prosenjit Bose,et al.  Online Routing in Convex Subdivisions , 2000, ISAAC.

[3]  Jie Wu,et al.  Extended minimal routing in 2-D meshes with faulty blocks , 2004, Int. J. High Perform. Comput. Netw..

[4]  Bruce M. Maggs,et al.  Reconfiguring Arrays with Faults Part I: Worst-Case Faults , 1997, SIAM J. Comput..

[5]  Jeffery R. Westbrook,et al.  Robot Navigation with Distance Queries , 2000, SIAM J. Comput..

[6]  Vladimir J. Lumelsky,et al.  Algorithmic and complexity issues of robot motion in an uncertain environment , 1987, J. Complex..

[7]  V. Lumelsky,et al.  Dynamic path planning for a mobile automaton with limited information on the environment , 1986 .

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

[9]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[10]  Stefan Rührup.  Improved Bounds for Online MultiPath Routing in Faulty Mesh Networks ∗ , 2006 .

[11]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[12]  Mark G. Karpovsky,et al.  Fault-Tolerant Message Routing for Multiprocessors , 1998, IPPS/SPDP Workshops.

[13]  Christian Schindelhauer,et al.  Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio , 2005, ESA.

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

[15]  Stefan Rührup,et al.  Position-based routing strategies , 2006 .

[16]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[17]  Piotr Berman,et al.  On-line Searching and Navigation , 1996, Online Algorithms.

[18]  Roger Wattenhofer,et al.  Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.

[19]  Baruch Schieber,et al.  Navigating in Unfamiliar Geometric Terrain , 1997, SIAM J. Comput..

[20]  Vladimir J. Lumelsky,et al.  Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape , 1987, Algorithmica.

[21]  Prosenjit Bose,et al.  Competitive Online Routing in Geometric Graphs , 2004, SIROCCO.

[22]  Christos H. Papadimitriou,et al.  Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[23]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[24]  S. Sitharama Iyengar,et al.  Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms , 1993 .

[25]  Jie Wu,et al.  Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[26]  Jeffery R. Westbrook,et al.  Robot navigation with range queries , 1996, STOC '96.

[27]  Christian Schindelhauer,et al.  Competitive time and traffic analysis of position-based routing using a cell structure , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[28]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.