Election in a complete network with a sense of direction
Information Processing Letters
Data networks
Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
Optimal lower bounds for some distributed algorithms for a complete network of processors
Theoretical Computer Science
Time and message bounds for election in synchronous and asynchronous complete networks
SIAM Journal on Computing
Leader election in complete networks
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Randomized algorithms
Distributed and parallel computing
Distributed and parallel computing
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Distributed Algorithms
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Training a wireless sensor network
Mobile Networks and Applications
Local Leader Election, Signal Strength Aware Flooding, and Routeless Routing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
A Fault-Tolerant Model of Wireless Sensor-Actuator Network
International Journal of Distributed Sensor Networks - Advances on Heterogeneous Wireless Sensor Networks
Leader Election Algorithms for Multi-channel Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Probabilistic voting-theoretic strategies for resource allocation in heterogenous wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Consensus and mutual exclusion in a multiple access channel
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Competition and equilibrium in multiuser networks with multiple service providers
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Election games for resource allocation in multicarrier multiuser wireless networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
How much memory is needed for leader election
DISC'10 Proceedings of the 24th international conference on Distributed computing
Collision-free routing in sink-centric sensor networks with coarse-grain coordinates
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Leader election using loneliness detection
DISC'11 Proceedings of the 25th international conference on Distributed computing
Optimal time slot assignment for mobile ad hoc networks
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Self-stabilizing leader election for single-hop wireless networks despite jamming
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Distributed tree comparison with nodes of limited memory
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
VIBE: An energy efficient routing protocol for dense and mobile sensor networks
Journal of Network and Computer Applications
Distributed colorings for collision-free routing in sink-centric sensor networks
Journal of Discrete Algorithms
Asynchronous leader election and MIS using abstract MAC layer
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Knowledge, level of symmetry, and time of leader election
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Hi-index | 0.00 |
A radio network is a distributed system with no central arbiter, consisting of n radio transceivers, henceforth referred to as stations. We assume that the stations are identical and cannot be distinguished by serial or manufacturing number. The leader election problem asks to designate one of the stations as leader. In this work, we focus on single-channel, single-hop radio networks. We assume that time is slotted and all transmissions occur at slot boundaries. In each time slot, the stations transmit on the channel with some probability until, eventually, one of the stations is declared leader. A leader election protocol is said to be uniform if, in each time slot, every station transmits with the same probability. In a seminal paper, Willard presented a uniform leader election protocol for single-channel single-hop radio stations terminating in log log n+o(log log n) expected time slots. It was open for more than 15 years whether Willard's protocol featured the same time performance with "high probability". One of our main contributions is to show that, unfortunately, this is not the case. Specifically, we prove that for every parameter $f\in e^{O(n)}$, in order to ensure termination with probability exceeding $1-{1\over f}$, Willard's protocol must take $\log\log n+\Omega(\sqrt{f})$ time slots. The highlight of this work is a novel uniform leader election protocol that terminates, with probability exceeding $1-{1\over f}$, in log log n+o( log log n)+O( log f) time slots. Finally, we provide simulation results that show that our leader election protocol outperforms Willard's protocol in practice.