Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio

  • Stefan Rührup
  • Christian Schindelhauer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3669)


We consider the problem of routing a message in a mesh network with faulty nodes. The number and positions of faulty nodes is unknown. It is known that a flooding strategy like expanding ring search can route a message in the minimum number of steps h while it causes a traffic (i.e. the total number of messages) of \({\mathcal O}(h^{2})\). For optimizing traffic a single-path strategy is optimal producing traffic \({\mathcal O}(p + h)\), where p is the perimeter length of the barriers formed by the faulty nodes. Therefore, we define the comparative traffic ratio as a quotient over p+h and the competitive time ratio as a quotient over h. Optimal algorithms with constant ratios are known for time and traffic, but not for both. We are interested in optimizing both parameters and define the combined comparative ratio as the maximum of competitive time ratio and comparative traffic ratio. Single-path strategies using the right-hand rule for traversing barriers as well as multi-path strategies like expanding ring search have a combined comparative ratio of Θ(h). It is an open question whether there exists an online routing strategy optimizing time and traffic for meshes with an unknown set of faulty nodes. We present an online strategy for routing with faulty nodes providing sub-linear combined comparative ratio of \(h^{{\mathcal O}(\sqrt{\frac{{\rm log log}h}{{\rm log}h}})}\).


Mesh Network Competitive Ratio Online Algorithm Exploration Node Virtual Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Angluin, D., Westbrook, J., Zhu, W.: Robot navigation with range queries. In: Proc. of the 28th Annual ACM Symposium on Theory of Computing, pp. 469–478 (1996)Google Scholar
  2. 2.
    Berman, P.: On-line searching and navigation. In: Fiat, A., Woeginger, G.J. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1442, pp. 232–241. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  3. 3.
    Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar geometric terrain. SIAM Journal on Computing 26, 110–137 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)zbMATHGoogle Scholar
  5. 5.
    Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless networks 7(6), 609–616 (2001)zbMATHCrossRefGoogle Scholar
  6. 6.
    Cole, R.J., Maggs, B.M., Sitaraman, R.K.: Reconfiguring Arrays with Faults Part I: Worst-case Faults. SIAM Journal on Computing 26(16), 1581–1611 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Koutsoupias, E., Papadimitriou, C.H.: Beyond competitive analysis. SIAM Journal on Computing 30(1), 300–317 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. 11th Canadian Conference on Computational Geometry, pp. 51–54 (1999)Google Scholar
  9. 9.
    Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing. In: Proc. of the 6th int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 24–33 (2002)Google Scholar
  10. 10.
    Lumelsky, V.J.: Algorithmic and complexity issues of robot motion in an uncertain environment. Journal of Complexity 3(2), 146–182 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Lumelsky, V.J., Stepanov, A.A.: Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica 2, 403–430 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Mauve, M., Widmer, J., Hartenstein, H.: A survey on position-based routing in mobile ad hoc networks. IEEE Network Magazine 15(6), 30–39 (2001)CrossRefGoogle Scholar
  13. 13.
    Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. In: Proc. of the 16th Int. Colloq. on Automata, Languages, and Programming (ICALP 1989), pp. 610–620. Elsevier Science Publishers Ltd. Amsterdam (1989)CrossRefGoogle Scholar
  14. 14.
    Rao, N., Kareti, S., Shi, W., Iyenagar, S.: Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Technical report, Oak Ridge National Laboratory, ORNL/TM-12410 (1993)Google Scholar
  15. 15.
    Rührup, S., Schindelhauer, C.: Competitive time and traffic analysis of position-based routing using a cell structure. In: Proc. of the 5th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (IPDPS/WMAN 2005), p. 248 (2005)Google Scholar
  16. 16.
    Rührup, S., Schindelhauer, C.: Online routing in faulty meshes with sub-linear comparative time and traffic ratio. Technical report, University of Paderborn, tr-rsfb-05-076 (2005)Google Scholar
  17. 17.
    Wu, J.: Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels. IEEE Transactions on Parallel and Distributed Systems 11, 149–159 (2000)CrossRefGoogle Scholar
  18. 18.
    Wu, J., Jiang, Z.: Extended minimal routing in 2-d meshes with faulty blocks. In: Proc. of the 1st Intl. Workshop on Assurance in Distributed Systems and Applications (in conjuction with ICDCS 2002), pp. 49–55 (2002)Google Scholar
  19. 19.
    Zakrevski, L., Karpovsky, M.: Fault-tolerant message routing for multiprocessors. In: Parallel and Distributed Processing, pp. 714–730. Springer, Heidelberg (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Stefan Rührup
    • 1
  • Christian Schindelhauer
    • 1
  1. 1.Heinz Nixdorf InstituteUniversity of PaderbornGermany

Personalised recommendations