Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Asynchronous Phase Synchronization in Uniform Unidirectional Rings
IEEE Transactions on Parallel and Distributed Systems
Randomized three-state alternator for uniform rings
Journal of Parallel and Distributed Computing
Timer-based composition of fault-containing self-stabilizing protocols
Information Sciences: an International Journal
A method for evaluating efficiency of protocols on the asynchronous shared-state model
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
| Hi-index | 0.00 |
We propose a self-stabilizing synchronization technique, called the "Neighborhood Synchronizer" (NS), that synchronizes nodes with their neighbors in a tree network. The NS scheme has extremely small memory requirement---only 1 bit per processor. Algorithm NS is inherently self-stabilizing. We apply our synchronizer to design a broadcasting algorithm (BA) in tree networks. Algorithm BA is also inherently self-stabilizing and needs only 2h+2m-1 rounds to broadcast m messages, where h is the height of the tree.