Self-stabilization
IEEE Transactions on Computers
ICDCS '99 Workshop on Self-stabilizing Systems
Self-stabilizing multi-token rings
Distributed Computing
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
VigilNet: An integrated sensor network system for energy-efficient surveillance
ACM Transactions on Sensor Networks (TOSN)
A survey of energy-efficient scheduling mechanisms in sensor networks
Mobile Networks and Applications
Self-deployment of mobile sensors on a ring
Theoretical Computer Science
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Best paper: stabilizing clock synchronization for wireless sensor networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A new self-stabilizing k-out-of-l exclusion algorithm on rings
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
| Hi-index | 0.00 |
Self-stabilizing distributed control is often modeled by token abstractions. For a cyber-physical system, tokens may represent physical objects whose movement is controlled. The problem studied in this paper is to ensure that a synchronous system with m circulating tokens has at least d distance between tokens. This problem is first considered in a ring where d is given whilst m and the ring size n are unknown. The protocol solving this problem can be uniform, with all processes running the same program, or it can be non-uniform, with some processes acting only as token relays. The protocol for this first problem is simple, and can be expressed with Petri net formalism. A second problem is to maximize d when m is given, and n is unknown. For the second problem, the paper presents a non-uniform protocol with a single corrective process.