Article

Distributed multi-broadcast in unknown radio networks

Authors:

Andrea E. F. Clementi,

Riccardo SilvestriAuthors Info & Claims

PODC '01: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing

Pages 255 - 264

https://doi.org/10.1145/383962.384040

Published: 01 August 2001 Publication History

Abstract

One of the most frequent tasks in multi-hop synchronous radio networks is the multi-broadcast operation: it consists in performing r independent message broadcasts through a network of n nodes. We investigate the case in which messages have logarithmic bounded size and the nodes have no knowledge of the topology (i.e. unknown networks).

Let D and c be the maximum eccentricity and the congestion of the network, respectively. First, we prove an Ω(c+(D+c/log c) log n) lower bound on the number of time-slots required to complete a multi-broadcast operation by any deterministic distributed protocol. Secondly, we prove an Ω(c+(c/log c)log n + D log(n/D)) lower bound for randomized distributed protocols. An important consequence is that “perfect pipeline” is not achievable for both deterministic and randomized protocols.

Finally, for any constant α > 0, we provide an O((D + c)d² log^(2+α) n) deterministic upper bound for the same task where d is the maximum in-degree of the network. Our (non-constructive) deterministic distributed protocol is thus almost optimal when d = O(polylogn) and it can be converted into an efficiently constructible one having O((D + c)d² log^(3+α) n) completion time.

References

[1]

N. Alon, A. Bar-Noy, N. Linial, and D. Peleg (1991), A lower bound for radio broadcast, JCSS, 43, 290-298 (An extended abstract appeared also in ACM - STOC 1989).]]

Digital Library

[2]

R. Bar-Yehuda, O. Goldreich, and A. Itai (1992), On the time-complexity of broadcast operations in multi-hop radio networks: an exponential gap between determinism and randomization, JCSS, 45,104-126 (preliminary version in 6th ACM PODC, 1987).]]

Digital Library

[3]

R. Bar-Yehuda, A. Israeli, and A. Itai (1993), Multiple Communication in Multi-hop Radio Networks, SICOMP, 22(4), 875-887.]]

Digital Library

[4]

D. Bruschi and M. Del Pinto (1997), lower bounds for the broadcast problem in mobile radio networks, Distributed Computing, 10, 129-135.]]

Digital Library

[5]

S.Chaudhuri, and J. Radhakrishnan (1996), Deterministic restriction on circuit complexity, in Proc. of Ann. ACM STOC.]]

Digital Library

[6]

B.S. Chlebus, L. Gaieniec, A.M. Gibbons, A. Pelc, and W. Rytter (2000), Deterministic broadcasting in unknown radio networks, in Proc. 11th Ann. ACM-SIAM SODA, San Francisco California, 861-870.]]

Digital Library

[7]

B. S. Chlebus, L. Gasieniec, A. Ostlin, and J. M Robson (2000), Deterministic radio broadcasting, Proc. of XXVII ICALP, LNCS, 1853, 717-728.]]

Digital Library

[8]

Motwani R., and Raghavan P., Randomized Algorithms. Cambridge University Press, 1995.]]

Digital Library

[9]

M. Chrobak, L. Gasieniec, and W. Rytter (2000) Fast Broadcasting and Gossiping in Radio Networks, IEEE FOCS.]]

Digital Library

[10]

A.E.F. Clementi, A. Monti, R. Silvestri (2001), Selective Families, Superimposed Codes and Broadcasting in Unknown Radio Networks, Proc. 12th ACM-SIAM SODA, 709-718.]]

Digital Library

[11]

R. Cole, R. Hariharan, and P. Indyk (1999), Tree Pattern matching and subset matching in deterministic O(n log 3 n)-time, Proc. of 11th Ann. ACM-SIAM Syrup. on Discrete Algorithms]]

Digital Library

[12]

A.G. Dyachkov and V.V Rykov (1983), A survey of superimposed code theory, Problems of Control and Information Theory, 12(4), 1-13.]]

[13]

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

[14]

E. Fachini, J. Korner (2000), A note on counting very different sequences, to appear on Combinatorics, Probability, and Computing.]]

Digital Library

[15]

R. Gallager (1985), A perspective on multiaccess channels, IEEE Trans. Inform. Theory (special issue on random access communications), 31, 124-142.]]

[16]

F.K. Hwang and V.T. Sos (1987), Non-adaptive hypergeometric group testing, Studio Scient. Math. Hungarica, 22, 257-263.]]

[17]

P. Indyk (1997), Deterministic Superimposed Coding with Application to Pattern Matching, Proc. of IEEE- FOCS'97, 127-136.]]

Digital Library

[18]

W.H. Kautz and RR.C. Singleton (1964) Nonrandom binary superimposed codes, IEEE Trans. on Inform. Theory, 10, 363-377.]]

Digital Library

[19]

E. Knshilevitz and Y. Mansour (1993), An O(Dlog(n/D)) lower bound for broadcast in radio networks, Proc. of 12th ACM - PODC, 65-73.]]

Digital Library

[20]

L.G. Roberts (1972), Aloha Packet System with and without Slots and Capture, Ass Notes 8, Advanced Research Projects Agency, Network Information Center, Stanford Research Institute.]]

[21]

U. Vishkin (1991), Deterministic sampling - a new technique for fast pattern matching, SICOMP, 20, 22-40.]]

Digital Library

Cited By

De Bonis A(2024)Group Testing in Arbitrary Hypergraphs and Related Combinatorial StructuresSOFSEM 2024: Theory and Practice of Computer Science10.1007/978-3-031-52113-3_11(154-168)Online publication date: 7-Feb-2024
https://doi.org/10.1007/978-3-031-52113-3_11
Kowalski DMosteiro MZaki K(2023)Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance ModelTheory of Computing Systems10.1007/s00224-023-10131-167:4(825-854)Online publication date: 10-Jul-2023
https://dl.acm.org/doi/10.1007/s00224-023-10131-1
De Bonis A(2023)Conflict Resolution in Arbitrary HypergraphsAlgorithmics of Wireless Networks10.1007/978-3-031-48882-5_2(13-27)Online publication date: 3-Dec-2023
https://doi.org/10.1007/978-3-031-48882-5_2
Show More Cited By

Index Terms

Distributed multi-broadcast in unknown radio networks

Recommendations

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 ...
Distributed Broadcast in Unknown Radio Networks

We consider the problem of broadcasting in an unknown radio network modeled as a directed graph $G=(V,E)$, where $|V|=n$. In unknown networks, every node knows only its own label, while it is unaware of any other parameter of the network, including its ...
A Faster Distributed Radio Broadcast Primitive: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

We present a faster distributed broadcasting primitive for the classical radio network model.

The most basic distributed radio network broadcasting primitive - called Decay - dates back to a PODC'87 result of Bar-Yehuda, Goldreich, and Itai. In any ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '01: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing

August 2001

323 pages

ISBN:1581133839

DOI:10.1145/383962

Chairmen:
Ajay Kshemkalyani
Univ. of Illinois at Chicago, Chicago
,
Nir Shavit
Tel-Aviv Univ.; and Sun Labs.

Copyright © 2001 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: 01 August 2001

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC01

Sponsor:

PODC01: 20th Annual ACM Symposium on Principles of Distributed Computing

Rhode Island, Newport, USA

Acceptance Rates

PODC '01 Paper Acceptance Rate 39 of 118 submissions, 33%;

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

120
Total Citations
View Citations
301
Total Downloads

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

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

De Bonis A(2024)Group Testing in Arbitrary Hypergraphs and Related Combinatorial StructuresSOFSEM 2024: Theory and Practice of Computer Science10.1007/978-3-031-52113-3_11(154-168)Online publication date: 7-Feb-2024
https://doi.org/10.1007/978-3-031-52113-3_11
Kowalski DMosteiro MZaki K(2023)Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance ModelTheory of Computing Systems10.1007/s00224-023-10131-167:4(825-854)Online publication date: 10-Jul-2023
https://dl.acm.org/doi/10.1007/s00224-023-10131-1
De Bonis A(2023)Conflict Resolution in Arbitrary HypergraphsAlgorithmics of Wireless Networks10.1007/978-3-031-48882-5_2(13-27)Online publication date: 3-Dec-2023
https://doi.org/10.1007/978-3-031-48882-5_2
Egorova EKabatiansky G(2021)Separable Collusion-Secure Multimedia CodesProblems of Information Transmission10.1134/S003294602102006X57:2(178-198)Online publication date: 7-Jul-2021
https://doi.org/10.1134/S003294602102006X
Chrobak MCostello KGąsieniec L(2021)Information Gathering in Ad-Hoc Radio NetworksInformation and Computation10.1016/j.ic.2021.104769(104769)Online publication date: May-2021
https://doi.org/10.1016/j.ic.2021.104769
Krisko CMiller A(2021)Labeling Schemes for Deterministic Radio Multi-broadcastGraph-Theoretic Concepts in Computer Science10.1007/978-3-030-86838-3_29(374-387)Online publication date: 23-Jun-2021
https://dl.acm.org/doi/10.1007/978-3-030-86838-3_29
Bu GPotop-Butucaru MRabie M(2021)Wireless Broadcast with Short LabelsNetworked Systems10.1007/978-3-030-67087-0_10(146-169)Online publication date: 14-Jan-2021
https://doi.org/10.1007/978-3-030-67087-0_10
Moses WVaya S(2020)Deterministic protocols in the SINR model without knowledge of coordinatesJournal of Computer and System Sciences10.1016/j.jcss.2020.06.002Online publication date: Aug-2020
https://doi.org/10.1016/j.jcss.2020.06.002
Ahmadi MKuhn FKutten SMolla APandurangan G(2019)The Communication Cost of Information Spreading in Dynamic Networks2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2019.00044(368-378)Online publication date: Jul-2019
https://doi.org/10.1109/ICDCS.2019.00044
Hounkanli KMiller APelc A(2019)Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access ChannelTheoretical Computer Science10.1016/j.tcs.2019.09.020Online publication date: Sep-2019
https://doi.org/10.1016/j.tcs.2019.09.020
Show More Cited By

View Options

Get Access

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