research-article

Broadcasting in unreliable radio networks

Authors:

Calvin Newport,

Andrea RichaAuthors Info & Claims

PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Pages 336 - 345

https://doi.org/10.1145/1835698.1835779

Published: 25 July 2010 Publication History

Abstract

Practitioners agree that unreliable links, which sometimes deliver messages and sometime do not, are an important characteristic of wireless networks. In contrast, most theoretical models of radio networks fix a static set of links and assume that these links are reliable. This gap between theory and practice motivates us to investigate how unreliable links affect theoretical bounds on broadcast in radio networks.

To that end we consider a model that includes two types of links: reliable links, which always deliver messages, and unreliable links, which sometimes fail to deliver messages. We assume that the reliable links induce a connected graph, and that unreliable links are controlled by a worst-case adversary. In the new model we show an Ω(n log n) lower bound on deterministic broadcast in undirected graphs, even when all processes are initially awake and have collision detection, and an Ω(n) lower bound on randomized broadcast in undirected networks of constant diameter. This separates the new model from the classical, reliable model. On the positive side, we give two algorithms that tolerate unreliability: an O(n^3/2 √log n)-time deterministic algorithm and a randomized algorithm which terminates in O(n log² n) rounds with high probability.

References

[1]

N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. A lower bound for radio broadcast. J. Comput. Syst. Sci., 43(2):290--298, 1991.

Digital Library

[2]

R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization. In PODC '87: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pages 98--108, New York, NY, USA, 1987. ACM.

Digital Library

[3]

D. Bruschi and M. Del Pinto. Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput., 10(3):129--135, 1997.

Digital Library

[4]

K.-W. Chin, J. Judge, A. Williams, and R. Kermode. Implementation Experience with MANET Routing Protocols. SIGCOMM Computer Communication Review, 32(5):49--59, 2002.

Digital Library

[5]

B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter. Deterministic broadcasting in unknown radio networks. In Symposium on Discrete Algorithms, pages 861--870, 2000.

Digital Library

[6]

M. Chlebus, L. Gasieniec, A. Ostlin, and J. Robson. Deterministic broadcasting in radio networks. In the International Colloquium on Automata, Languages and Programming (ICALP), 2000.

Digital Library

[7]

M. Chrobak, L. Gasieniec, and W. Rytter. Fast broadcasting and gossiping in radio networks. Journal of Algorithms, 43:177--189, 2002.

Digital Library

[8]

A. Clementi, A. Monti, and R. Silvestri. Selective families, superimposed codes, and broadcasting on unknown radio networks. In the annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 709--718, Philadelphia, PA, USA, 2001. Society for Industrial and Applied Mathematics.

Digital Library

[9]

A. Clementi, A. Monti, and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. Journal of Parallel Distributed Computing, 64:89--96, 2004.

Digital Library

[10]

A. E. F. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Broadcasting in dynamic radio networks. J. Comput. Syst. Sci., 75(4):213--230, 2009.

Digital Library

[11]

A. E. F. Clementi, A. Monti, and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distrib. Comput., 64(1):89--96, 2004.

Digital Library

[12]

A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. J. Algorithms, 60(2):115--143, 2006.

Digital Library

[13]

D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris. A High-Throughput Path Metric for Multi-Hop Wireless Routing. Wireless Networks, 11(4):419--434, 2005.

Digital Library

[14]

P. Erdos, P. Frankl, and Z. Furedi. Familes of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51:79--89, 1985.

[15]

F. Galčík. Centralized communication in radio networks with strong interference. In SIROCCO '08: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity, pages 277--290, Berlin, Heidelberg, 2008. Springer-Verlag.

Digital Library

[16]

F. Galčík, L. Gasieniec, and A. Lingas. Efficient broadcasting in known topology radio networks with long-range interference. In PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing, pages 230--239, New York, NY, USA, 2009. ACM.

Digital Library

[17]

O. Goussevskaia, T. Moscibroda, and R. Wattenhofer. Local broadcasting in the physical interference model. In M. Segal and A. Kesselman, editors, DIALM-POMC, pages 35--44. ACM, 2008.

Digital Library

[18]

P. Gupta and P. Kumar. The capacity of wireless networks. IEEE Transactions on information theory, 46:388--404.

Digital Library

[19]

W. Kautz and R. Singleton. Nonrandom binary superimposed codes. IEEE Transactions on Information Theory, 10(4):363--377, 1964.

Digital Library

[20]

D. R. Kowalski and A. Pelc. Broadcasting in undirected ad hoc radio networks. Distrib. Comput., 18(1):43--57, 2005.

Digital Library

[21]

D. R. Kowalski and A. Pelc. Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comput. Sci., 333(3):355--371, 2005.

Digital Library

[22]

F. Kuhn, N. Lynch, and C. Newport. Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication. In The Annual ACM Symposiun on Principles of Distributed Computing (PODC), pages 330--331, 2009.

Digital Library

[23]

E. Kushilevitz and Y. Mansour. An &3937;(D log(N/D)) lower bound for broadcast in radio networks. SIAM J. Comput., 27(3):702--712, 1998.

Digital Library

[24]

H. Lundgren, E. Nordströ, and C. Tschudin. Coping with Communication Gray Zones in IEEE 802.11b Based Ad Hoc Networks. In the International Workshop on Wireless Mobile Multimedia, 2002.

Digital Library

[25]

T. Moscibroda and R. Wattenhofer. The complexity of connectivity in wireless networks. In INFOCOM. IEEE, 2006.

[26]

C. Newport, D. Kotz, Y. Yuan, R. Gray, J. Liu, and C. Elliott. Experimental Evaluation of Wireless Simulation Assumptions. Simulation, 83(9):643, 2007.

Digital Library

[27]

C. Newport and N. Lynch. Modeling Radio Networks. In the International Conference on Concurrency Theory (CONCUR), 2009.

Digital Library

[28]

D. Peleg. Time-efficient broadcasting in radio networks. In DISC '07: Proceedings of the 21st international symposium on Distributed Computing, pages 3--4, Berlin, Heidelberg, 2007. Springer-Verlag.

Digital Library

[29]

S. Schmid and R. Wattenhofer. Algorithmic models for sensor networks. In IPDPS. IEEE, 2006.

Digital Library

[30]

P. von Rickenbach, R. Wattenhofer, and A. Zollinger. Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE/ACM Trans. Netw., 17(1):172--185, 2009.

Digital Library

Cited By

Jahja IYu HHou R(2022)On the power of randomization in distributed algorithms in dynamic networks with adaptive adversariesJournal of Parallel and Distributed Computing10.1016/j.jpdc.2021.09.004159(35-50)Online publication date: Jan-2022
https://doi.org/10.1016/j.jpdc.2021.09.004
Yu DZou YYu JWu YLv WCheng XDressler FLau F(2021)Distributed Broadcasting in Dynamic NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2021.308781829:5(2142-2155)Online publication date: Oct-2021
https://doi.org/10.1109/TNET.2021.3087818
Halldórsson MKortsarz GMitra PTonoyan T(2021)Network Design under General Wireless InterferenceAlgorithmica10.1007/s00453-021-00866-zOnline publication date: 10-Aug-2021
https://doi.org/10.1007/s00453-021-00866-z
Show More Cited By

Index Terms

Broadcasting in unreliable radio networks
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
      2. Network flows
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Network flows
  2. Randomness, geometry and discrete structures

Recommendations

Structuring unreliable radio networks
PODC '11: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types of links: reliable, which always deliver messages, and unreliable, which ...
Broadcasting in undirected ad hoc radio networks
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing

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 ...
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science

In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

July 2010

494 pages

ISBN:9781605588889

DOI:10.1145/1835698

General Chairs:
Andrea Richa
Arizona State University, USA
,
Rachid Guerraoui
EPFL, Switzerland

Copyright © 2010 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 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PODC '10

Sponsor:

PODC '10: ACM Symposium on Principles of Distributed Computing

July 25 - 28, 2010

Zurich, Switzerland

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
334
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)1

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Jahja IYu HHou R(2022)On the power of randomization in distributed algorithms in dynamic networks with adaptive adversariesJournal of Parallel and Distributed Computing10.1016/j.jpdc.2021.09.004159(35-50)Online publication date: Jan-2022
https://doi.org/10.1016/j.jpdc.2021.09.004
Yu DZou YYu JWu YLv WCheng XDressler FLau F(2021)Distributed Broadcasting in Dynamic NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2021.308781829:5(2142-2155)Online publication date: Oct-2021
https://doi.org/10.1109/TNET.2021.3087818
Halldórsson MKortsarz GMitra PTonoyan T(2021)Network Design under General Wireless InterferenceAlgorithmica10.1007/s00453-021-00866-zOnline publication date: 10-Aug-2021
https://doi.org/10.1007/s00453-021-00866-z
Efremenko KKol GSaxena REmek YCachin C(2020)Noisy BeepsProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3404501(418-427)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3404501
Jahja IYu HHou R(2020)On the Power of Randomization in Distributed Algorithms in Dynamic Networks with Adaptive AdversariesEuro-Par 2020: Parallel Processing10.1007/978-3-030-57675-2_24(376-391)Online publication date: 18-Aug-2020
https://doi.org/10.1007/978-3-030-57675-2_24
Efremenko KKol GSaxena R(2019)Radio Network Coding Requires Logarithmic Overhead2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2019.00030(348-369)Online publication date: Nov-2019
https://doi.org/10.1109/FOCS.2019.00030
Gilbert SLynch NNewport CPajak D(2019)On Simple Back-Off in Unreliable Radio NetworksTheoretical Computer Science10.1016/j.tcs.2019.08.027Online publication date: Aug-2019
https://doi.org/10.1016/j.tcs.2019.08.027
Ahmadi MGhodselahi AKuhn FMolla A(2019)The cost of global broadcast in dynamic radio networksTheoretical Computer Science10.1016/j.tcs.2019.07.013Online publication date: Jul-2019
https://doi.org/10.1016/j.tcs.2019.07.013
Jahja IYu HZhao Y(2019)Some lower bounds in dynamic networks with oblivious adversariesDistributed Computing10.1007/s00446-019-00360-4Online publication date: 7-Aug-2019
https://doi.org/10.1007/s00446-019-00360-4
Halldórsson MWattenhofer R(2019)Wireless Network AlgorithmicsComputing and Software Science10.1007/978-3-319-91908-9_9(141-160)Online publication date: 2019
https://doi.org/10.1007/978-3-319-91908-9_9
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.

Figures

Tables

Media

View Table of Conten