research-article

Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks

Authors:

Peter DaviesAuthors Info & Claims

PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing

Pages 3 - 12

https://doi.org/10.1145/3087801.3087825

Published: 25 July 2017 Publication History

Abstract

We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in undirected networks with n nodes and diameter D, randomized broadcasting requires Ω(D log t n/D + log²n) rounds in expectation, assuming that uninformed nodes are not allowed to communicate (until they are informed). Only very recently, Haeupler and Wajc (PODC'2016) showed that this bound can be slightly improved for the model with spontaneous transmissions, providing an O(D(log n log log n)/(log D) + log^O(1)n)-time broadcasting algorithm. In this paper, we give a new and faster algorithm that completes broadcasting in O(D(log n)/(log D) + log^O(1)n) time, with high probability. This yields the first optimal O(D)-time broadcasting algorithm whenever D is polynomial in n.

Furthermore, our approach can be applied to design a new leader election algorithm that matches the performance of our broadcasting algorithm. Previously, all fast randomized leader election algorithms have been using broadcasting as their subroutine and their complexity have been asymptotically strictly bigger than the complexity of broadcasting. In particular, the fastest previously known randomized leader election algorithm of Ghaffari and Haeupler (SODA'2013) requires O(D log n/D min(log log n, log n/D) + log^O(1)n-time with high probability. Our new algorithm requires O(D(log n)/(log D) + log^O(1)n time with high probability, and it achieves the optimal O(D) time whenever D is polynomial in n.

References

[1]

Noga Alon, Amotz Bar-Noy, Nathan Linial, and David Peleg. 1991. A Lower Bound for Radio Broadcast. JCSS 43, 2 (October 1991), 290--298.

Digital Library

[2]

Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. 1991. Efficient Emulation of Single-hop Radio Network with Collision on Multi-hop Radio Network with no Collision Detection. Distributed Computing 5, 1 (September 1991), 67--71.

Digital Library

[3]

Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. 1992. On the Time-complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap between Determinism and Randomization. JCSS 45, 1 (August 1992), 104--126.

Digital Library

[4]

Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, and Wojciech Rytter. 2002. Deterministic Broadcasting in Unknown Radio Networks. Distributed Computing 15, 1 (January 2002), 27--38.

Digital Library

[5]

Bogdan S. Chlebus, Dariusz R. Kowalski, and Andrzej Pelc. 2012. Electing a Leader in Multi-hop Radio Networks. In Proceedings of the 16th International Conference on Principles of Distributed Systems (OPODIS) (Lecture Notes in Computer Science), Vol. 7702. Springer, Berlin, Heidelberg, 106--120.

[6]

Marek Chrobak, Leszek Gasieniec, and Wojciech Rytter. 2002. Fast Broadcasting and Gossiping in Radio Networks. JALGORITHMS 43, 2 (May 2002), 177--189.

Digital Library

[7]

Andrea E. F. Clementi, Angelo Monti, and Riccardo Silvestri. 2003. Distributed Broadcasting in Radio Networks of Unknown Topology. TCS 302, 1--3 (April 2003), 337--364.

Digital Library

[8]

Artur Czumaj and Peter Davies. 2016a. Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks. In Proceedings of the 35th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, New York, NY, 47--49.

Digital Library

[9]

Artur Czumaj and Peter Davies. 2016b. Faster Deterministic Communication in Radio Networks. In Proceedings of the 43rd Annual International Colloquium on Automata, Languages and Programming (ICALP)., Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 139:1--139:14.

[10]

Artur Czumaj and Wojciech Rytter. 2003. Broadcasting Algorithms in Radio Networks with Unknown Topology. JALGORITHMS 60, 2 (August 2003), 115--143.

Digital Library

[11]

Mohsen Ghaffari and Bernhard Haeupler. 2013. Near Optimal Leader Election in Multi-hop Radio Networks. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, Philadelphia, PA, 748--766.

[12]

Mohsen Ghaffari, Bernhard Haeupler, and Majid Khabbazian. 2015. Randomized Broadcast in Radio Networks with Collision Detection. Distributed Computing 28, 6 (December 2015), 407--422.

Digital Library

[13]

Bernhard Haeupler and David Wajc. 2016. A Faster Distributed Radio Broadcast Primitive. In Proceedings of the 35th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, New York, NY, 361--370.

Digital Library

[14]

Dariusz R. Kowalski. 2005. On Selection Problem in Radio Networks. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, New York, NY, 158--166.

Digital Library

[15]

Dariusz R. Kowalski and Andrzej Pelc. 2004. Faster Deterministic Broadcasting in Ad Hoc Radio Networks. SIAM Journal on Discrete Mathematics 18, 2 (2004), 332--346.

Digital Library

[16]

Dariusz R. Kowalski and Andrzej Pelc. 2005. Broadcasting in Undirected ad hoc Radio Networks. Distributed Computing 18, 1 (July 2005), 43--57.

Digital Library

[17]

Eyal Kushilevitz and Yishay Mansour. 1998. An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks. SICOMP 27, 3 (1998), 702--712.

Digital Library

[18]

Gary L. Miller, Richard Peng, and Shen Chen Xu. 2013. Parallel Graph Decompositions Using Random Shifts. In Proceedings of the 25th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, New York, NY, 196--203.

Digital Library

[19]

David Peleg. 2007. Time-efficient Broadcasting in Radio Networks: A Review. In Proceedings of the 4th International Conference on Distributed Computing and Internet Technology (ICDCIT) (Lecture Notes in Computer Science), Vol. 4882. Springer, Berlin, Heidelberg, 1--18.

Cited By

Chang YDani VHayes TKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Low-Distortion Clustering in Bounded Growth GraphsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662822(412-415)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662822
Chang YDuan RJiang S(2023)Near-Optimal Time–Energy Tradeoffs for Deterministic Leader ElectionACM Transactions on Algorithms10.1145/361442919:4(1-23)Online publication date: 26-Sep-2023
https://dl.acm.org/doi/10.1145/3614429
Chang YLi ZOshman RNolin AHalldorsson MBalliu A(2023)The Complexity of Distributed Approximation of Packing and Covering Integer Linear ProgramsProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594562(32-43)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594562
Show More Cited By

Index Terms

Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
1. Networks
  1. Network algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Distributed algorithms

Recommendations

Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks

We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in ...
Broadcasting in undirected ad hoc radio networks
Special issue: PODC 02

We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in ...
Sublinear bounds for randomized leader election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O ( 1 ) rounds and (with high probability) uses only O ( n log 3 / 2 n ) ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing

July 2017

480 pages

ISBN:9781450349925

DOI:10.1145/3087801

General Chair:
Elad Michael Schiller
Chalmers University of Technology, Sweden
,
Program Chair:
Alexander A. Schwarzmann
University of Connecticut, USA

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PODC '17

Sponsor:

PODC '17: ACM Symposium on Principles of Distributed Computing

July 25 - 27, 2017

DC, Washington, USA

Acceptance Rates

PODC '17 Paper Acceptance Rate 38 of 154 submissions, 25%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
376
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chang YDani VHayes TKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Low-Distortion Clustering in Bounded Growth GraphsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662822(412-415)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662822
Chang YDuan RJiang S(2023)Near-Optimal Time–Energy Tradeoffs for Deterministic Leader ElectionACM Transactions on Algorithms10.1145/361442919:4(1-23)Online publication date: 26-Sep-2023
https://dl.acm.org/doi/10.1145/3614429
Chang YLi ZOshman RNolin AHalldorsson MBalliu A(2023)The Complexity of Distributed Approximation of Packing and Covering Integer Linear ProgramsProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594562(32-43)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594562
Miller APelc AYadav R(2022)Deterministic Leader Election in Anonymous Radio NetworksACM Transactions on Algorithms10.1145/352717118:3(1-33)Online publication date: 11-Oct-2022
https://dl.acm.org/doi/10.1145/3527171
Chang YDuan RJiang SAgrawal KAzar Y(2021)Near-Optimal Time-Energy Trade-Offs for Deterministic Leader ElectionProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461830(162-172)Online publication date: 6-Jul-2021
https://dl.acm.org/doi/10.1145/3409964.3461830
Gańczorz AJurdziński TLewko MPelc AAgrawal KAzar Y(2021)Deterministic Size Discovery and Topology Recognition in Radio Networks with Short LabelsProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461821(432-434)Online publication date: 6-Jul-2021
https://dl.acm.org/doi/10.1145/3409964.3461821
Gorain BPelc A(2021)Finding the size and the diameter of a radio network using short labelsTheoretical Computer Science10.1016/j.tcs.2021.02.004864(20-33)Online publication date: Apr-2021
https://doi.org/10.1016/j.tcs.2021.02.004
Miller APelc AYadav RScheideler CSpear M(2020)Deterministic Leader Election in Anonymous Radio NetworksProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400276(407-417)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400276
Chang YKopelowitz TPettie SWang RZhan W(2019)Exponential Separations in the Energy Complexity of Leader ElectionACM Transactions on Algorithms10.1145/334111115:4(1-31)Online publication date: 4-Oct-2019
https://dl.acm.org/doi/10.1145/3341111
Chen HZheng CScheideler CBerenbrink P(2019)Fast and Resource Competitive Broadcast in Multi-channel Radio NetworksThe 31st ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3323165.3323186(179-189)Online publication date: 17-Jun-2019
https://dl.acm.org/doi/10.1145/3323165.3323186
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents