
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
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. 516526, 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 = {10459219}, year = {2002}, pages = {516526}, 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  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Uniform Leader Election Protocols for Radio Networks IS  5 SN  10459219 SP516 EP526 EPD  516526 A1  Koji Nakano, A1  Stephan Olariu, PY  2002 KW  Radio networks KW  wireless communications KW  leader election KW  distributed systems KW  communication protocols. VL  13 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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 singlechannel, singlehop 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
[1] H. AbuAmara, "Faulttolerant Distributed Algorithms for Election in Complete Networks," IEEE Trans. Computers, vol. 37, no. 4, pp. 449553, 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. 376394, 1991.
[3] R. BarYehuda, O. Goldreich, and A. Itai, “Efficient Emulation of SingleHop Radio Network with Collision Detection on MultiHop Radio Network with No Collision Detection,” Distributed Computing, vol. 5, pp. 6771, 1991.
[4] J. Bentley and A. Yao, “An Almost Optimal Algorithm for Unbounded Search,” Information Processing Letters, vol. 5, pp. 8287, 1976.
[5] D. Bertzekas and R. Gallager, Data Networks, second ed. PrenticeHall, 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. ElRewini 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. 125132, 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. 185187, 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 AdHoc Networks,” Proc. Seventh Int'l Colloq. Structural Information and Comm. Complexity (SIROCCO 7), pp. 253267, 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. 362373, 2000.
[17] M. JoaNg and I.T. Lu, “A PeertoPeer ZoneBased TwoLevel 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. 11771186, 1983.
[20] G. Singh, "Leader Election in Complete Networks," ACM Symp. Principles of Distributed Computing, pp. 179190, 1992.
[21] D.E. Willard, “LogLogarithmic Selection Resolution Protocols in a Multiple Access Channel,” SIAM J. Computing, vol. 15, pp. 468–477, 1986.