Publication 2002 Issue No. 5 - May Abstract - Uniform Leader Election Protocols for Radio Networks
May 2002 (vol. 13 no. 5)
pp. 516-526
 ASCII Text x Koji Nakano, Stephan Olariu, "Uniform Leader Election Protocols for Radio Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 5, pp. 516-526, May, 2002.
 BibTex x @article{ 10.1109/TPDS.2002.1003864,author = {Koji Nakano and Stephan Olariu},title = {Uniform Leader Election Protocols for Radio Networks},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {13},number = {5},issn = {1045-9219},year = {2002},pages = {516-526},doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2002.1003864},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Uniform Leader Election Protocols for Radio NetworksIS - 5SN - 1045-9219SP516EP526EPD - 516-526A1 - Koji Nakano, A1 - Stephan Olariu, PY - 2002KW - Radio networksKW - wireless communicationsKW - leader electionKW - distributed systemsKW - communication protocols.VL - 13JA - IEEE Transactions on Parallel and Distributed SystemsER -

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.

Index Terms: