Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
A self-stabilizing leader election algorithm for tree graphs
Journal of Parallel and Distributed Computing
An exercise in fault-containment: self-stabilizing leader election
Information Processing Letters
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Uniform Leader Election Protocols for Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Randomized Leader Election Protocols in Radio Networks with No Collision Detection
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Channel surfing and spatial retreats: defenses against wireless denial of service
Proceedings of the 3rd ACM workshop on Wireless security
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Jamming and sensing of encrypted wireless ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Reliable broadcast in radio networks: the bounded collision case
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Backbone construction in selfish wireless networks
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Cross-layer jamming detection and mitigation in wireless broadcast networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A multi-channel defense against jamming attacks in wireless sensor networks
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Reliable distributed computing on unreliable radio channels
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
A jamming-resistant MAC protocol for multi-hop wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Competitive and Fair Medium Access Despite Reactive Jamming
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed 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
Towards jamming-resistant and competitive medium access in the SINR model
S3 '11 Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students
Competitive and fair throughput for co-existing networks under adversarial interference
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
An efficient and fair MAC protocol robust to reactive interference
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Electing a leader is a fundamental task in distributed computations. Many coordination problems, such as the access to a shared resource, and the resulting inefficiencies, can be avoided by relying on a leader. This paper presents Select, a leader election protocol for wireless networks where nodes communicate over a shared medium. Select is very robust in two respects. First, the protocol is self-stabilizing in the sense that it converges to a correct solution from any possible initial network state (e.g., where no or multiple nodes consider themselves a leader). This is an appealing property, especially for dynamic networks. Second, the described protocol is resilient against a powerful reactive jammer that blocks a significant fraction of all communication rounds. The reactive model is general and of interest beyond jamming (e.g., in the context of co-existing networks). The paper also reports on experimental results obtained from our simulation framework which allows us to study convergence behavior under different types of adversarial jammers.