This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Uniform Leader Election Protocols for Radio Networks
May 2002 (vol. 13 no. 5)
pp. 516-526

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.

[1] H. Abu-Amara, "Fault-tolerant Distributed Algorithms for Election in Complete Networks," IEEE Trans. Computers, vol. 37, no. 4, pp. 449-553, 1988.
[2] Y. Afek and E. Gafni, "Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks," SIAM J. Computing, vol. 20, no. 2, pp. 376-394, 1991.
[3] R. Bar-Yehuda, O. Goldreich, and A. Itai, “Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with No Collision Detection,” Distributed Computing, vol. 5, pp. 67-71, 1991.
[4] J. Bentley and A. Yao, “An Almost Optimal Algorithm for Unbounded Search,” Information Processing Letters, vol. 5, pp. 82-87, 1976.
[5] D. Bertzekas and R. Gallager, Data Networks, second ed. Prentice-Hall, 1992.
[6] P.H. Dana, “The Geographer's Craft Project,” Dept. of Geography, UT Austin, Sept. 1999, http://www.utexas.edu/depts/grg/gcraf/notes/ gpsgps.html.
[7] H. El-Rewini and T.G. Lewis, Distributed and Parallel Computing, Manning Publications, Greenwich, Conn., 1997.
[8] E.D. Kaplan, Understanding GPS: Principles and Applications. Boston, Mass.: Artech House, 1996.
[9] E. Korach, S. Moran, and S. Zaks, “Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors,” Theoretical Computer Science, vol. 64, pp. 125-132, 1989.
[10] M.C. Loui, T.A. Matsushita, and D.B. West, “Election in Complete Networks with a Sense of Direction,” Information Processing Letters, vol. 22, pp. 185-187, 1986.
[11] N. Lynch, Distributed Algorithms. New Jersey, Morgan Kaufman, 1996.
[12] R.M. Metcalfe and D.R. Boggs, “Ethernet: Distributed Packet Switching for Local Computer Networks,” Comm. ACM, vol. 19, pp. 395–404, 1976.
[13] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[14] K. Nakano and S. Olariu, “Randomized$O(\log\log n)$-Round Leader Election Protocols in Packet Radio Networks,” Proc. Int'l Symp. Algorithms and Computation, pp. 209–218, 1998.
[15] K. Nakano and S. Olariu, “Randomized Leader Election Protocols for Ad-Hoc Networks,” Proc. Seventh Int'l Colloq. Structural Information and Comm. Complexity (SIROCCO 7), pp. 253-267, June 2000.
[16] K. Nakano and S. Olariu, “Randomized Leader Election Protocols in Radio Networks with No Collision Detection,” Proc. Int'l Symp. Algorithms and Computation, pp. 362-373, 2000.
[17] M. Joa-Ng and I.-T. Lu, “A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 17, pp. 1415–1425, 1999.
[18] B. Parhami, Introduction to Parallel Processing. Plenum, 1999.
[19] B. Parkinson and S. Gilbert, “NAVSTAR: Global Positioning System—Ten Years Later,” Proc. IEEE, pp. 1177-1186, 1983.
[20] G. Singh, "Leader Election in Complete Networks," ACM Symp. Principles of Distributed Computing, pp. 179-190, 1992.
[21] D.E. Willard, “Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel,” SIAM J. Computing, vol. 15, pp. 468–477, 1986.

Index Terms:
Radio networks, wireless communications, leader election, distributed systems, communication protocols.
Citation:
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, doi:10.1109/TPDS.2002.1003864
Usage of this product signifies your acceptance of the Terms of Use.