ACM Computing Surveys (CSUR)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
An exercise in fault-containment: self-stabilizing leader election
Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Stably computable properties of network graphs
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Self-stabilizing population protocols
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
PAT: Towards Flexible Verification under Fairness
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Fair Model Checking with Process Counter Abstraction
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Making Population Protocols Self-stabilizing
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Scalable Multi-core Model Checking Fairness Enhanced Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Secretive birds: privacy in population protocols
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Stabilizing flocking via leader election in robot networks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Direction election in flocking swarms
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Improving space complexity of self-stabilizing counting on mobile sensor networks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Self-stabilizing tiny interaction protocols
Proceedings of the Third International Workshop on Reliability, Availability, and Security
On combining state space reductions with global fairness assumptions
FM'11 Proceedings of the 17th international conference on Formal methods
Computing time complexity of population protocols with cover times: the zebranet example
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
The computational power of simple protocols for self-awareness on graphs
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing synchronization in mobile sensor networks with covering
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Loosely-Stabilizing leader election in population protocol model
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Loosely-stabilizing leader election in a population protocol model
Theoretical Computer Science
Proving liveness property under strengthened compassion requirements
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Terminating population protocols via some minimal global knowledge assumptions
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Tight complexity analysis of population protocols with cover times - The ZebraNet example
Theoretical Computer Science
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science
Direction election in flocking swarms
Ad Hoc Networks
Model checking with fairness assumptions using PAT
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 0.00 |
This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Self-stabilizing algorithms do not require initialization in order to operate correctly and can recover from transient faults that obliterate all state information in the system. Anonymous finite-state agents model systems of identical simple computational nodes such as sensor networks and biological computers. Self-stabilizing leader election is easily shown to be impossible in such systems without additional structure. An eventual leader detector Ω? is an oracle that eventually detects the presence or absence of a leader. With the help of Ω?, uniform self-stabilizing leader election algorithms are presented for two natural classes of network graphs: complete graphs and rings. The first algorithm works under either a local or global fairness condition, whereas the second requires global fairness. With only local fairness, uniform self-stabilizing leader election in rings is impossible, even with the help of Ω?.