A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
ACM Computing Surveys (CSUR)
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
The Triumph and Tribulation of System Stabilization
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Information Processing Letters
Randomized self-stabilizing algorithms for wireless sensor networks
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
Cached Sensornet Transformation of Non-silent Self-stabilizing Algorithms with Unreliable Links
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
Wireless sensor network is a set of many tiny sensor nodes eachof which consists of a microprocessor with sensors and wirelesscommunication device. Because centralized control is hard toachieve in a large scale sensor network, self-* is a key concept todesign such a network. In this paper, as one of self-* properties,we investigate self-stabilization algorithms which is a promisingtheoretical background for wireless sensor network protocols. T.Herman [Procs. International Workshop of Distributed Computing,2003] proposed a transformation scheme of self-stabilizingalgorithm in abstract computational model to sensor network model.However, it is not known that whether expected convergence time oftransformed algorithms is finite or not. We show upper bound ofexpected convergence time of some self-stabilizing algorithms inexplicit formulas.