Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Fast Self-Stabilizing Depth-First Token Circulation
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-stabilizing depth-first token circulation in arbitrary rooted networks
Distributed Computing
Distributed Token Circulation in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Optimal snap-stabilizing depth-first token circulation in tree networks
Journal of Parallel and Distributed Computing
Self-stabilizing token circulation on uniform trees by using edge-tokens
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Snap-stabilizing depth-first search on arbitrary networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Self-stabilizing deterministic TDMA for sensor networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
The notion of self-stabilization was first introduced by Dijkstra : it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. This paper proposes a self-stabilizing depth-first token circulation protocol for uniform rooted networks. Such an algorithm is very convenient to obtain the mutual exclusion or to construct a spanning tree. Our contribution consists of explaining how the basic depth-first token circulation protocol is nearly self-stabilizing and how to obtain a self-stabilizing protocol by just adding what is necessary to destroy cycles. We achieve an efficient algorithm working for any dynamic connected network in which the topology may change during the execution. Moreover, we shed a new light on proving self-stabilizing algorithms based on the locking property: a processor is locked if it eventually stops to modify its variables. We also improve the best known space complexity for this problem to the same as the basic algorithm, i.e. log2(D+1)+1 bits, D is the upper bound of node's degree.