Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1533 LNCS, Issue , 1998, Pages 209-219

  Nakano, Koji ^a   Olariu, Stephan ^b  

^a NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

^b ECS Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PACKET NETWORKS; PROBABILITY; RADIO BROADCASTING;

LEADER ELECTION; LEADER ELECTION PROTOCOLS; PACKET RADIO NETWORKS; RANDOMIZED PROTOCOLS;

INTERNET PROTOCOLS;

EID: 84867462338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_23     Document Type: Conference Paper

References (9)

1. J. Bentley and A. Yao, An almost optimal algorithm for unbounded search, Information Processing Letters, 5, (1976),:82-87.
2. D. Bertzekas and R. Gallager, Data Networks, Second Edition, Prentice-Hall, 1992.
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, 5, (1991), 67-71.
4. J. I. Capetanakis, Tree algorithms for packet broadcast channels, IEEE Transactions on Information Theory, IT-25, (1979), 505-515.
5. I. Chlamtac and S. Kutten, Tree-based broadcasting in multihop radio networks, IEEE Transaction on Computers, C-36, (1987), 1209-1223.
6. J. Jájá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
7. R. M. Metcalfe and D. R. Boggs, Ethernet: distributed packet switching for local computer networks, Communications of the ACM, 19, (1976), 395-404.
8. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
9. D. E. Willard, Log-logarithmic selection resolution protocols in a multiple access channel, SIAM Journal on Computing, 15, (1986), 468-477.