Uniform leader election protocols for radio networks

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. 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 (1986) 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 whether Willard's protocol featured the same time performance with "high probability". We propose a uniform leader election protocol that terminates, with probability exceeding 1-1/f for every f/spl ges/1, in log log n+o(log log n)+O(log f) time slots. We also prove that for every f/spl isin/e/sup O(n)/, in order to ensure termination with probability exceeding 1-1/f, Willard's protocol must take log log n+/spl Omega/(/spl radic/f) time slots. Finally, we provide simulation results that show that our leader election outperforms Willard's leader election protocol in practice.

[1]  Behrooz Parhami,et al.  Introduction to Parallel Processing: Algorithms and Architectures , 1999 .

[2]  Hesham El-Rewini,et al.  Distributed and Parallel Computing , 1998 .

[3]  Stephan Olariu,et al.  Randomized O (log log n)-Round Leader Election Protocols in Packet Radio Networks , 1998, ISAAC.

[4]  Dan E. Willard,et al.  Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel , 1986, SIAM J. Comput..

[5]  Behrooz Parhami.  Introduction to Parallel Processing , 2002, Series in Computer Science.

[6]  B.W. Parkinson,et al.  NAVSTAR: Global positioning system—Ten years later , 1983, Proceedings of the IEEE.

[7]  Andrew Chi-Chih Yao,et al.  An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..

[8]  Gurdip Singh,et al.  Leader election in complete networks , 1992, PODC '92.

[9]  Shmuel Zaks,et al.  Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors , 1989, Theor. Comput. Sci..

[10]  Hosame Abu-Amara.  Fault-Tolerant Distributed Algorithm for Election in Complete Networks , 1988, IEEE Trans. Computers.

[11]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[12]  Elliott D. Kaplan.  Understanding GPS : principles and applications , 1996 .

[13]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1988, CACM.

[14]  Mario Joa-Ng,et al.  A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[15]  Dimitri P. Bertsekas,et al.  Data Networks: Second Edition , 1992 .

[16]  Stephan Olariu,et al.  Randomized Leader Election Protocols in Radio Networks with No Collision Detection , 2000, ISAAC.

[17]  C. Loui Michael,et al.  Election in a complete network with a sense of direction , 1986 .

[18]  K. N AKANO.  Randomized Leader Election Protocols Ad-hoc Networks , 2000 .

[19]  Yehuda Afek,et al.  Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks , 1991, SIAM J. Comput..

[20]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[21]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.