Advertisement

Convergence Time Analysis of Self-stabilizing Algorithms in Wireless Sensor Networks with Unreliable Links

  • Hirotsugu Kakugawa
  • Toshimitsu Masuzawa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5340)

Abstract

Wireless sensor network is a set of many tiny sensor nodes each of which consists of a microprocessor with sensors and wireless communication device. Because centralized control is hard to achieve in a large scale sensor network, self-∗ is a key concept to design such a network. In this paper, as one of self-∗ properties, we investigate self-stabilization algorithms which is a promising theoretical background for wireless sensor network protocols. T. Herman [Procs. International Workshop of Distributed Computing, 2003] proposed a transformation scheme of self-stabilizing algorithm in abstract computational model to sensor network model. However, it is not known that whether expected convergence time of transformed algorithms is finite or not. We show upper bound of expected convergence time of some self-stabilizing algorithms in explicit formulas.

Keywords

Wireless sensor network self-stabilization self-organization probabilistic self-stabilization convergence time 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dijkstra, E.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)CrossRefzbMATHGoogle Scholar
  2. 2.
    Schneider, M.: Self-stabilization. ACM Computing Surveys 25(1), 45–67 (1993)CrossRefGoogle Scholar
  3. 3.
    Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)zbMATHGoogle Scholar
  4. 4.
    Mizuno, M., Kakugawa, H.: A transformation of self-stabilizing programs for distributed computing environments. In: Babaoğlu, Ö., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151, pp. 304–321. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  5. 5.
    Huang, S.T., Wuu, L.C., Tsai, M.S.: Distributed execution model for self-stabilizing systems. In: Proceedings of the 14th International Conference on Distributed Computing Systems (ICDCS), pp. 432–439 (1994)Google Scholar
  6. 6.
    Herman, T.: Models of self-stabilization and sensor networks. In: IWDC 2003. LNCS, vol. 2918, pp. 205–214. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Turau, V., Weyer, C.: Randomized self-stabilizing algorithms for wireless sensor networks. In: de Meer, H., Sterbenz, J.P.G. (eds.) IWSOS 2006. LNCS, vol. 4124, pp. 74–89. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Szpankowski, W., Rego, V.: Yet another application of a binomial recurrence, order statistics. Computing 43, 401–410 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Gouda, M.: The triumph and tribulation of system stabilization. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  10. 10.
    Huang, S.T., Chen, N.S.: A self-stabilizing algorithm for constructing breadth-first trees. Information Processing Letters 41, 109–117 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Shukla, S., Rosenkrantz, D., Ravi, S.: Observation on self-stabilizing graph algorithms for anonymous networks. In: Proceedings of the Second Workshop on Self-Stabilizing Systems, WSS (1995)Google Scholar
  12. 12.
    Ikeda, M., Kamei, S., Kakugawa, H.: A space-optimal self-stabilizing algorithm for the maximal independent set problem. In: Proceedings of the 3rd International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), pp. 70–74 (2002)Google Scholar
  13. 13.
    Kamei, S., Kakugawa, H.: A self-stabilizing distributed approximation algorithm for the minimum connected dominating set. In: Proceedings of the 9th IPDPS Workshop on Advances in Parallel and Distributed Computational Models, APDCM (2007)Google Scholar
  14. 14.
    Turau, V.: Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Information Processing Letters 103(3), 88–93 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Chen, N.S., Yu, H.P., Huang, S.T.: A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters 39, 147–151 (1991)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Hirotsugu Kakugawa
    • 1
  • Toshimitsu Masuzawa
    • 1
  1. 1.Osaka UniversityOsakaJapan

Personalised recommendations