Advertisement

A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks

  • Hirotsugu Kakugawa
  • Masafumi Yamashita
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3544)

Abstract

Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable system behaviors. Self-stabilizing algorithms have been studied well to design stable distributed algorithms on unstable systems, but they are not requested to be adaptive to dynamic topology changes. We in this paper propose a new concept of dynamic reconfiguration tolerant (DRT for short) self-stabilizing algorithm, which is a self-stabilizing algorithm that is also robust against dynamic changes of topology. We next propose a DRT self-stabilizing token circulation algorithm. It deterministically circulates a token through a spanning tree edges in an asymptotically optimal time O(n), once the system is stabilized. The spanning tree will converge to the minimum spanning tree, if the network remains static.

Keywords

token circulation self-stabilization ad-hoc network spanning tree 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17, 643–644 (1974)zbMATHCrossRefGoogle Scholar
  2. 2.
    Dolev, S.: Self-stabilization. The MIT Press, Cambridge (2000)zbMATHGoogle Scholar
  3. 3.
    Datta, A.K., Johnen, C., Petit, F., Villan, V.: Self-stabilizing depth first token circulation in arbitrary rooted networks. In: Proceedings of the 5th International Colloquium on Structual Information and Communication Complexity (SIRROCO), pp. 119–131 (1998)Google Scholar
  4. 4.
    Malpani, N., Vaidya, N.H., Welch, J.L.: Distributed token circulation on mobile ad hoc networks. In: Proceedings of the 9th International Conference on Network Protocols, ICNP (2001)Google Scholar
  5. 5.
    Israeli, A., Jalfon, M.: Token management schemes and random walks yield self stabilizing mutual exclusion. In: Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, pp. 119–131. ACM, New York (1990)CrossRefGoogle Scholar
  6. 6.
    Dolev, S., Schiller, E., Welch, J.: Random walk for self-stabilizing group communication in ad-hoc networks. In: The 21st IEEE Symposium on Reliable Distributed Systems (SRDS), pp. 70–79 (2002)Google Scholar
  7. 7.
    Chen, Y., Welch, J.L.: Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks. In: Proceedings of the Sixth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, DIALM (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Hirotsugu Kakugawa
    • 1
  • Masafumi Yamashita
    • 2
  1. 1.Faculty of EngineeringHiroshima UniversityHiroshimaJapan
  2. 2.Graduate School of Information Science and Electrical EngineeringKyushu UniversityFukuokaJapan

Personalised recommendations