Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2009: Automata, Languages and Programming pp 521–533Cite as

Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5556))

Abstract

We address the fundamental distributed problem of leader election in ad hoc radio networks modeled as undirected graphs. Nodes are stations having distinct integer labels, and each node knows only its own label and a polynomial upper bound on all labels. A signal from a transmitting node reaches all neighbors. What distinguishes radio networks from message-passing networks is that a message is received successfully by a node, if and only if, exactly one of its neighbors transmits in this round. If two neighbors of a node transmit simultaneously in a given round, none of the messages is heard by the receiving node. In this case we say that a collision occurred at this node.

An important capability of nodes of a radio network is collision detection: the ability of nodes to distinguish a collision from the background noise occurring when no neighbor transmits. (This ability is the “keen ear” of the nodes.) Can collision detection speed up leader election in arbitrary radio networks? We give a positive answer to this question. More precisely, our main result is a deterministic leader election algorithm working in time O(n) in all n-node networks, if collision detection is available, while it is known that deterministic leader election requires time Ω(n logn), even for complete networks, if there is no collision detection. This is the first computational task whose execution for arbitrary radio networks is shown to be faster with collision detection than without it.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. of Computer and System Sciences 43, 290–298 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. J. of Computer and System Sciences 45, 104–126 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Transactions on Information Theory 25, 505–515 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chlamtac, I., Kutten, S.: On broadcasting in radio networks - problem analysis and protocol design. IEEE Trans. on Communications 33, 1240–1246 (1985)

    Article  MATH  Google Scholar 

  5. Chlebus, B., Ga̧sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing 15, 27–38 (2002)

    Article  Google Scholar 

  6. Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. 41st Symp. on Foundations of Computer Science (FOCS 2000), pp. 575–581 (2000)

    Google Scholar 

  7. Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302, 337–364 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. 44th Symp. on Foundations of Computer Science (FOCS 2003), pp. 492–501 (2003)

    Google Scholar 

  9. De Marco, G.: Distributed broadcast in unknown radio networks. In: Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA 2008), pp. 208–217 (2008)

    Google Scholar 

  10. Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. Journal of Discrete Algorithms 5, 187–201 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Erdos, P., Frankl, P., Furedi, P.: Families of finite sets in which no set is covered by the union of r others. Israel J. of Math. 51, 79–89 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ga̧sieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM J. on Discrete Mathematics 14, 207–222 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. Greenberg, A.G., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM 32, 589–596 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hayes, J.F.: An adaptive technique for local distribution. IEEE Transactions on Communications 26, 1178–1186 (1978)

    Article  Google Scholar 

  15. Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), pp. 697–704 (2002)

    Google Scholar 

  16. Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Efficient algorithms for leader election in radio networks. In: Proc. 21st ACM Symp. on Principles of Distr. Comp (PODC 2002), pp. 51–57 (2002)

    Google Scholar 

  17. Kautz, W.H., Singleton, R.R.C.: Nonrandom binary superimposed codes. IEEE Trans. on Inf. Theory 10, 363–377 (1964)

    Article  MATH  Google Scholar 

  18. Kowalski, D., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM J. on Computing 33, 870–891 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18, 43–57 (2005)

    Article  MATH  Google Scholar 

  20. Kushilevitz, E., Mansour, Y.: An Ω(D log(N/D)) lower bound for broadcast in radio networks. SIAM J. on Computing 27, 702–712 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  21. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publ., Inc., San Francisco (1996)

    MATH  Google Scholar 

  22. Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE Transactions on Parallel Distributed Systems 13, 516–526 (2002)

    Article  Google Scholar 

  23. Ta-Shma, A., Umans, C., Zuckerman, D.: Loss-less condensers, unbalanced expanders, and extractors. In: Proc. 33rd ACM Symposium on Theory of Computing (STOC 2001), pp. 143–152 (2001)

    Google Scholar 

  24. Tsybakov, B.S., Mikhailov, V.A.: Free synchronous packet access in a broadcast channel with feedback. Prob. Inf. Transmission 14, 259–280 (1978)

    MathSciNet  MATH  Google Scholar 

  25. Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. on Computing 15, 468–477 (1986)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Liverpool, Liverpool, L69 3BX, United Kingdom

    Dariusz R. Kowalski

  2. Département d’informatique, Université du Québec en Outaouais, Gatineau, Québec, J8X 3X7, Canada

    Andrzej Pelc

Authors
  1. Dariusz R. Kowalski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Freiburg, Georges Köhler Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Department of Computer and Systems Sciences, Sapienza University of Rome, Via Ariosto 25, 00184, Roma, Italy

    Alberto Marchetti-Spaccamela

  3. Tel Aviv University Google R&D Center, School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Yossi Matias

  4. University of Patras and CTI, N. Kazantzaki Street 1, 26504, Rion, Patras, Greece

    Sotiris Nikoletseas

  5. RWTH Aachen, Lehrstuhl Informatik 7, Ahornstraße 55, 52056, Aachen, Germany

    Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kowalski, D.R., Pelc, A. (2009). Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02930-1_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02930-1_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02929-5

  • Online ISBN: 978-3-642-02930-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation