Article

Faster communication in known topology radio networks

Authors:

Leszek Gasieniec,

Qin XinAuthors Info & Claims

PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

Pages 129 - 137

https://doi.org/10.1145/1073814.1073840

Published: 17 July 2005 Publication History

Abstract

This paper concerns the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in radio networks with known topology, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network.The first part of the paper examines the two communication primitives in general graphs. In particular, it proposes a new (efficiently computable) deterministic schedule that uses O(D+Δ log n) time units to complete the gossiping task in any radio network with size n, diameter D and max-degree Δ. Our new schedule improves and simplifies the currently best known gossiping schedule, requiring time O(D+√[i+2]DΔ logⁱ⁺¹ n), for any network with the diameter D=Ω(logⁱ⁺⁴n), where i is an arbitrary integer constant i ≥ 0, see [17]. For the broadcast task we deliver two new results: a deterministic efficient algorithm for computing a radio schedule of length D+O(log³ n), and a randomized algorithm for computing a radio schedule of length D+O(log² n). These results improve on the best currently known D+O(log⁴ n) time schedule due to Elkin and Kortsarz [12].The second part of the paper focuses on radio communication in planar graphs, devising a new broadcasting schedule using fewer than 3D time slots. This result improves, for small values of D, on currently best known D+O(log³ⁿ) time schedule proposed by Elkin and Kortsarz in [12]. Our new algorithm should be also seen as the separation result between the planar and the general graphs with a small diameter due to the polylogarithmic inapproximability result in general graphs due to Elkin and Kortsarz, see [11].

References

[1]

B. Awerbuch and D. Peleg. Sparse partitions. Proc. 31st Symp. on Foundations of Computer Science, 1990, pp. 503--513.

Digital Library

[2]

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

Digital Library

[3]

R. Bar-Yehuda, O. Goldreich and A. Itai. On the time complexity of broadcasting in radio networks: an exponential gap between determinism and randomization. Proc. 5th Symp. on Principles of Distributed Computing, 1986, 98 -- 107.

Digital Library

[4]

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

[5]

I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. Proc. Proc. INFOCOM, 1987.

[6]

M. Christersson, L. Gasieniec and A. Lingas. Gossiping with bounded size messages in ad-hoc radio networks. Proc. 29th Int. Colloq. on Automata, Languages and Programming, 2002, pp. 377--389.

Digital Library

[7]

M. Chrobak, L. Gasieniec and W. Rytter, Fast broadcasting and gossiping in radio networks. J. of Algorithms 43(2), (2002), pp. 177--189.

Digital Library

[8]

T.H. Cormen, C.E. Leiserson and R.L. Rivest. Introduction to Algorithms. MIT Press, 1990.

Digital Library

[9]

A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. Proc. 44th Symp. on Foundations of Computer Science, 2003, pp. 492--501.

Digital Library

[10]

K. Diks, E. Kranakis and A. Pelc. The impact of knowledge on broadcasting time in radio networks. Proc. 7th European Symp. on Algorithms, 1999, pp. 41--52.

Digital Library

[11]

M. Elkin and G. Kortsarz. Polylogarithmic inapproximability of the radio broadcast problem. Proc. APPROX, 2004, LNCS 3122.

[12]

M. Elkin and G. Kortsarz. Improved broadcast schedule for radio networks. Proc. 16th ACM-SIAM Symp. on Discrete Algorithms, 2005.

Digital Library

[13]

I. Gaber and Y. Mansour. Broadcast in radio networks. Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 577--585.

Digital Library

[14]

L. Gasieniec and A. Lingas. On adaptive deterministic gossiping in ad hoc radio networks, Information Processing Letters 2(83), 2002, pp. 89--94.

Digital Library

[15]

L. Gasieniec, E. Kranakis, A. Pelc and Q. Xin. Deterministic M2M multicast in radio networks. Proc. 31st Int. Colloq. on Automata, Languages and Programming, 2004, LNCS 3142, pp. 670--682.

[16]

L. Gasieniec and I. Potapov, Gossiping with unit messages in known radio networks. Proc. 2nd IFIP Int. Conference on Theoretical Computer Science, 2002, pp. 193--205.

Digital Library

[17]

L. Gasieniec, I. Potapov and Q. Xin. Efficient gossiping in known radio networks. Proc. 11th Int. Colloq. on Structural Information and Communication Complexity, 2004, LNCS 3104, pp. 173--184.

[18]

L. Gasieniec, T. Radzik and Q. Xin. Faster deterministic gossiping in ad-hoc radio networks. Proc. 9th Scandinavian Workshop on Algorithm Theory, 2004, LNCS 3111, pp. 397--407.

[19]

D. Kowalski and A. Pelc. Centralized deterministic broadcasting in undirected multi-hop radio networks. Proc. APPROX, 2004, LNCS 3122, pp. 171--182.

[20]

D. Liu and M. Prabhakaran. On randomized broadcasting and gossiping in radio networks. Proc. 8th Int. Conf. on Computing and Combinatorics, 2002, pp. 340--349.

Digital Library

[21]

A. Sen and M.L. Huson. A new model for scheduling packet radio networks. Proc. 15th Joint Conf. of IEEE Computer and Communication Societies, 1996, pp. 1116--1124.

Digital Library

[22]

P.J. Slater, E.J.Cockayne and S.T. Hedetniemi. Information dissemination in trees. SIAM J. on Computing 10, (1981), pp. 892--701.

[23]

A.N. Strahler. Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Amer. 63, (1952), pp. 117--1142.

[24]

X.G. Viennot. A Strahler bijection between Dyck paths and planar trees. Discrete Mathematics 246, (2002), pp. 317--329.

Digital Library

[25]

Y. Xu. An O(n1.5) deterministic gossiping algorithm for radio networks. Algorithmica, 36(1), (2003), pp. 93--96.

Digital Library

Cited By

Dinitz MEphraim N(2019)Reception Capacity: Definitions, Game Theory and HardnessAlgorithms for Sensor Systems10.1007/978-3-030-34405-4_6(96-115)Online publication date: 5-Nov-2019
https://doi.org/10.1007/978-3-030-34405-4_6
Xia YXin Q(2017)Minimum-Latency Communication in Wireless Mesh Networks Under Noisy Physical Interference Model2017 9th International Conference on Wireless Communications and Signal Processing (WCSP)10.1109/WCSP.2017.8171145(1-7)Online publication date: Oct-2017
https://doi.org/10.1109/WCSP.2017.8171145
Xia TZhang YLiu YSun Y(2017)Expression recognition in the wild with transfer learning2017 9th International Conference on Wireless Communications and Signal Processing (WCSP)10.1109/WCSP.2017.8170910(1-6)Online publication date: Oct-2017
https://doi.org/10.1109/WCSP.2017.8170910
Show More Cited By

Index Terms

Faster communication in known topology radio networks
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Faster communication in known topology radio networks

This paper concerns the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed in advance ...
Faster Deterministic Communication in Radio Networks

We study the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full ...
Faster centralized communication in radio networks
ISAAC'06: Proceedings of the 17th international conference on Algorithms and Computation

We study the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

July 2005

364 pages

ISBN:1581139942

DOI:10.1145/1073814

General Chair:
Marcos Aguilera
HP Labs
,
Program Chair:
James Aspnes
Yale University

Copyright © 2005 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: 17 July 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC05

Sponsor:

PODC05: ACM Symposium on Principles of Distributed Computing

July 17 - 20, 2005

NV, Las Vegas, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

83
Total Citations
View Citations
379
Total Downloads

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

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dinitz MEphraim N(2019)Reception Capacity: Definitions, Game Theory and HardnessAlgorithms for Sensor Systems10.1007/978-3-030-34405-4_6(96-115)Online publication date: 5-Nov-2019
https://doi.org/10.1007/978-3-030-34405-4_6
Xia YXin Q(2017)Minimum-Latency Communication in Wireless Mesh Networks Under Noisy Physical Interference Model2017 9th International Conference on Wireless Communications and Signal Processing (WCSP)10.1109/WCSP.2017.8171145(1-7)Online publication date: Oct-2017
https://doi.org/10.1109/WCSP.2017.8171145
Xia TZhang YLiu YSun Y(2017)Expression recognition in the wild with transfer learning2017 9th International Conference on Wireless Communications and Signal Processing (WCSP)10.1109/WCSP.2017.8170910(1-6)Online publication date: Oct-2017
https://doi.org/10.1109/WCSP.2017.8170910
Haeupler BWajc DGiakkoupis G(2016)A Faster Distributed Radio Broadcast PrimitiveProceedings of the 2016 ACM Symposium on Principles of Distributed Computing10.1145/2933057.2933121(361-370)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2933057.2933121
Ghaffari MHaeupler B(2016)Near-Optimal BFS-Tree Construction in Radio NetworksIEEE Communications Letters10.1109/LCOMM.2016.253994020:6(1172-1174)Online publication date: Jun-2016
https://doi.org/10.1109/LCOMM.2016.2539940
Pignolet YSchmid STredan G(2016)Upper and lower bounds for deterministic broadcast in powerline communication networksDistributed Computing10.1007/s00446-016-0263-129:4(239-250)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1007/s00446-016-0263-1
Levin LKowalski DSegal M(2015)Message and time efficient multi-broadcast schemesTheoretical Computer Science10.1016/j.tcs.2014.12.006569:C(13-23)Online publication date: 2-Mar-2015
https://dl.acm.org/doi/10.1016/j.tcs.2014.12.006
Ghaffari MHaeupler BKhabbazian M(2015)Randomized broadcast in radio networks with collision detectionDistributed Computing10.1007/s00446-014-0230-728:6(407-422)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1007/s00446-014-0230-7
Pignolet YSchmid STredan G(2014)ColorCast: Deterministic broadcast in powerline networks with uncertainties2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)10.1109/SmartGridComm.2014.7007689(458-463)Online publication date: Nov-2014
https://doi.org/10.1109/SmartGridComm.2014.7007689
Manfredi S(2014)A theoretical analysis of multi-hop consensus algorithms for wireless networksAd Hoc Networks10.1016/j.adhoc.2011.05.00513(234-244)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1016/j.adhoc.2011.05.005
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