article

Deterministic Communication in Radio Networks with Large Labels

Authors:

Leszek Gasieniec,

Aris Pagourtzis,

Tomasz RadzikAuthors Info & Claims

Algorithmica, Volume 47, Issue 1

Pages 97 - 117

Published: 01 January 2007 Publication History

Abstract

We study deterministic gossiping in ad hoc radio networks with large node labels. The labels (identifiers) of the nodes come from a domain of size N which may be much larger than the size n of the network (the number of nodes). Most of the work on deterministic communication has been done for the model with small labels which assumes N = O(n). A notable exception is Peleg's paper, where the problem of deterministic communication in ad hoc radio networks with large labels is raised and a deterministic broadcasting algorithm is proposed, which runs in O(n2log n) time for N polynomially large in n. The O(nlog2n)-time deterministic broadcasting algorithm for networks with small labels given by Chrobak et al. implies deterministic O(n log N log n)-time broadcasting and O(n2log2N log n)-time gossiping in networks with large labels. We propose two new deterministic gossiping algorithms for ad hoc radio networks with large labels, which are the first such algorithms with subquadratic time for polynomially large N. More specifically, we propose: a deterministic O(n3/2log2N log n)-time gossiping algorithm for directed networks; and a deterministic O(n log2N log2n)-time gossiping algorithm for undirected networks.

References

[1]

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

Digital Library

[2]

R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. System Sci., 45(1):104-126, 1992.

Digital Library

[3]

R. Bar-Yehuda, A. Israeli, and A. Itai. Multiple communication in multi-hop radio networks. SIAM J. Comput., 22(4):875-887, 1993.

Digital Library

[4]

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

Digital Library

[5]

I. Chlamtac and O. Weinstein. Thewave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Commun., 39(3):426-433, 1991.

[6]

B. S. Chlebus, L. Gasieniec, A. M. Gibbons, A. Pelc, and W. Rytter. Deterministic broadcasting in unknown radio networks. In Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA 2000), pp. 861-870. ACM/SIAM, New York, 2000.

[7]

B. S. Chlebus, L. Gasieniec, A. Lingas, and A. Pagourtzis. Oblivious gossiping in ad hoc radio networks. In Proc. 5th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), pp. 44-51. ACM, New York, 2001.

[8]

B. S. Chlebus, L.Gasieniec, A. Östlin, and J.M. Robson. Deterministic radio broadcasting. In Proc. 27th Int. Colloq. on Automata, Languages and Programming (ICALP 2000), LNCS vol. 1853, pp. 717-728. Springer, Berlin, 2000.

Digital Library

[9]

M. Christersson, L. Gasieniec, and A. Lingas. Gossiping with bounded size messages in ad hoc radio networks. In Proc. 29th Int. Colloq. on Automata, Languages and Programming (ICALP 2002), LNCS vol. 2380, pp. 377-389. Springer, Berlin, 2002.

[10]

M. Chrobak, L. Gasieniec, and W. Rytter. A randomized algorithm for gossiping in radio networks. In Proc. 7th Ann. Int. on Computing and Combinatorics Conference (COCOON 2001), LNCS vol. 2108, pp. 483-492. Springer, Berlin, 2001.

[11]

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

Digital Library

[12]

A. E. F. Clementi, A. Monti, and R. Silvestri. Selective families, superimposed codes, and broadcasting in unknown radio networks. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), pp. 709-718. ACM/SIAM, New York, 2001.

[13]

A. E. F. Clementi, A. Monti, and R. Silvestri. Distributed multi-broadcast in unknown radio networks. In Proc. 20th Ann. ACM Symp. on Principles of Distributed Computing (PODC 2001), pp. 255-264. ACM, New York, 2001.

Digital Library

[14]

A. E. F. Clementi, A. Monti, and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. In Proc. 9th Ann. European Symp. on Algorithms (ESA 2001), LNCS vol. 2161, pp. 452-463. Springer, Berlin, 2001.

[15]

A. E. F. Clementi, A. Monti, and R. Silvestri. Distributed broadcast in radio networks of unknown topology. Theoret. Comput. Sci., 1-3(302):337-364, 2003.

Digital Library

[16]

A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. In Proc. 44th Symp. on Foundations of Computer Science (FOCS 2003), pp. 492-501. IEEE Computer Society, Los Alamitos, CA, 2003.

Digital Library

[17]

G. De Marco and A. Pelc. Faster broadcasting in unknown radio networks. Inform. Process. Lett., 79(2):53-56, 2001.

Digital Library

[18]

M. Elkin and G. Kortsarz. Improved schedule for radio broadcast. In Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2005), pp. 222-231. ACM/SIAM, New York, 2005.

[19]

I. Gaber and Y. Mansour. Centralized broadcast in multihop radio networks. J. Algorithms, 46(1):1-20, 2003.

Digital Library

[20]

L. Gasieniec and A. Lingas. On adaptive deterministic gossiping in ad hoc radio networks. Inform. Process. Lett., 83(2):89-93, 2002.

Digital Library

[21]

L. Gasieniec, A. Pagourtzis, and I. Potapov. Deterministic communication in radio networks with large labels. In Proc. 10th Ann. European Symp. on Algorithms (ESA 2002), LNCS vol. 2461, pp. 512-524. Springer, Berlin, 2002.

[22]

L. Gasieniec, D. Peleg, and Q. Xin. Faster communication in known topology radio networks. In Proc. 24th Ann. ACM Symp. on Principles of Distributed Computing (PODC 2005), pp. 129-137. ACM, New York, 2005.

Digital Library

[23]

L. Gasieniec and I. Potapov. Gossiping with unit messages in known radio networks. In Proc. 2nd IFIP Int. Conf. on Theoretical Computer Science (TCS 2002), IFIP Conference Proceedings vol. 223, pp. 193-205. Kluwer, Dordrecht, 2002.

[24]

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

[25]

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

[26]

D. R. Kowalski and A. Pelc. Deterministic broadcasting time in radio networks of unknown topology. In Proc. 43rd Symp. on Foundations of Computer Science (FOCS 2002), pp. 63-72. IEEE Computer Society, Los Alamitos, 2002.

[27]

D. R. Kowalski and A. Pelc. Broadcasting in undirected ad hoc radio networks. In Proc. 22nd Ann. ACM Symp. on Principles of Distributed Computing (PODC 2003), pp. 73-82. ACM, New York, 2003.

Digital Library

[28]

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

[29]

D. R. Kowalski and A. Pelc. Faster deterministic broadcasting in ad hoc radio networks. SIAM J. Discrete Math., 18(2):332-346, 2004.

Digital Library

[30]

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

Digital Library

[31]

D. Liu and M. Prabhakaran. On randomized broadcasting and gossiping in radio networks. In Proc. 8th Ann. Int. Conf. Computing and Combinatorics (COCOON 2002), LNCS vol. 2387, pp. 340-349. Springer, Berlin, 2002.

[32]

D. Peleg. Deterministic radio broadcast with no topological knowledge, manuscript, 2000.

[33]

K. Ravishankar and S. Singh. Asymptotically optimal gossiping in radio networks. Discrete Appl. Math., 61(1):61-82, 1995.

Digital Library

[34]

K. Ravishankar and S. Singh, Gossiping on a ring with radios, Parallel Process. Lett., 6(1):115-126, 1996.

[35]

S. Tabbane. Handbook of Mobile Radio Networks. Artech House, Norwood, MA, 2000.

[36]

Y. Xu. An O(n^1.5) deterministic gossiping algorithm for radio networks. Algorithmica, 36(1):93-96, 2003.

Digital Library

Cited By

Ellen FGorain BMiller APelc A(2021)Constant-Length Labeling Schemes for Deterministic Radio BroadcastACM Transactions on Parallel Computing10.1145/34706338:3(1-17)Online publication date: 20-Sep-2021
https://dl.acm.org/doi/10.1145/3470633
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
Ellen FGorain BMiller APelc AScheideler CBerenbrink P(2019)Constant-Length Labeling Schemes for Deterministic Radio BroadcastThe 31st ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3323165.3323194(171-178)Online publication date: 17-Jun-2019
https://dl.acm.org/doi/10.1145/3323165.3323194
Show More Cited By

Index Terms

Deterministic Communication in Radio Networks with Large Labels
1. Networks
  1. Network properties
    1. Network structure
  2. Network protocols
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

Deterministic Communication in Radio Networks with Large Labels
ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms

We study deterministic gossiping in ad-hoc radio networks, where labels of the nodes are large, i.e., they are polynomially large in the size n of the network. A label-free model was introduced in the context of randomized broadcasting in ad-hoc radio ...
Deterministic Communication in Radio Networks

In this paper we improve the deterministic complexity of two fundamental communication primitives in the classical model of ad hoc radio networks with unknown topology: broadcasting and wake-up. We consider an unknown radio network, in which all nodes ...
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 ...

Comments

Information & Contributors

Information

Published In

cover image Algorithmica

Algorithmica Volume 47, Issue 1

January 2007

115 pages

ISSN:0178-4617

Issue’s Table of Contents

Copyright © Copyright © 2007 Springer.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 January 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ellen FGorain BMiller APelc A(2021)Constant-Length Labeling Schemes for Deterministic Radio BroadcastACM Transactions on Parallel Computing10.1145/34706338:3(1-17)Online publication date: 20-Sep-2021
https://dl.acm.org/doi/10.1145/3470633
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
Ellen FGorain BMiller APelc AScheideler CBerenbrink P(2019)Constant-Length Labeling Schemes for Deterministic Radio BroadcastThe 31st ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3323165.3323194(171-178)Online publication date: 17-Jun-2019
https://dl.acm.org/doi/10.1145/3323165.3323194
Gorain BPelc A(2018)Finding the Size of a Radio Network with Short LabelsProceedings of the 19th International Conference on Distributed Computing and Networking10.1145/3154273.3154298(1-10)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3154273.3154298
Miller A(2015)On the complexity of neighbourhood learning in radio networksTheoretical Computer Science10.1016/j.tcs.2015.04.027608:P2(135-145)Online publication date: 10-Dec-2015
https://dl.acm.org/doi/10.1016/j.tcs.2015.04.027
Czumaj AElsässer RGąsieniec LSauerwald TWang X(2013)Fast message dissemination in random geometric networksDistributed Computing10.1007/s00446-011-0154-426:1(1-24)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1007/s00446-011-0154-4
Fusco EPelc APetreschi R(2013)Learning a ring cheaply and fastProceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II10.1007/978-3-642-39212-2_49(557-568)Online publication date: 8-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39212-2_49
Miller ABlin LBusnel Y(2012)Gossiping in one-dimensional synchronous ad hoc wireless radio networksProceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems10.1145/2414815.2414822(32-43)Online publication date: 17-Dec-2012
https://dl.acm.org/doi/10.1145/2414815.2414822
Vaya S(2011)Brief announcementProceedings of the 13th international conference on Stabilization, safety, and security of distributed systems10.5555/2050613.2050654(449-450)Online publication date: 10-Oct-2011
https://dl.acm.org/doi/10.5555/2050613.2050654
Elsässer RGąsieniec LSauerwald T(2008)On Radio Broadcasting in Random Geometric GraphsProceedings of the 22nd international symposium on Distributed Computing10.1007/978-3-540-87779-0_15(212-226)Online publication date: 22-Sep-2008
https://dl.acm.org/doi/10.1007/978-3-540-87779-0_15

View Options

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

Media

Figures

Other

Tables

View Issue’s Table of Contents