Abstract
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 networks, see [2]. Most of the work on deterministic communication in ad-hoc networks was done for the model with labels of size O(n), with few exceptions; Peleg [19] raised the problem of deterministic communication in ad-hoc radio networks with large labels and proposed the first deterministic O(n 2 log n)- time broadcasting algorithm. In [11] Chrobak et al. proved that deterministic radio broadcasting can be performed in time O(n log 2 n); their result holds for large labels.
Here we propose two new deterministic gossiping algorithms for ad-hoc radio networks with large labels. In particular:
-
a communication procedure giving an O(n 5/3 log 3 n)-time deterministic gossiping algorithm for directed networks and an O(n 4/3 log 3 n)- time algorithm for undirected networks;
-
a gossiping procedure designed particularly for undirected networks resulting in an almost linear O(n log 3 n)-time algorithm.
Research supported in part by GR/N09855 and GR/R85921 EPSRC grants.
Part of this work was done while this author was with the Department of Computer Science, University of Liverpool.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Alon, A. Bar-Noy, N. Linial and D. Peleg, A lower bound for radio broadcast, Journal of Computer and System Sciences 43, (1991), pp. 290–298.
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, Journal of Computer and System Sciences, 45 (1992), pp. 104–126.
R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM Journal on Computing 22 (1993), pp. 875–887.
D. Brusci, and M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing, 10 (1997), pp. 129–135.
I. Chlamtac and O. Weinstein, The Wave Expansion Approach to Broadcasting in Multihop Radio Networks, IEEE Trans. on Communications, 39(3), pp. 426–433, 1991.
B.S. Chlebus, L. Gaşieniec, 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.
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, (DIALM’2001), pp. 44–51.
B. S. Chlebus, L. Gaşieniec, A. Östlin, and J.M. Robson, Deterministic radio broadcasting, In Proc 27th Int. Colloq. on Automata, Languages and Programming, (ICALP’2000), LNCS 1853, pp. 717–728.
M. Christersson, L. Gaşieniec, and A. Lingas, Gossiping with bounded size messages in ad-hoc radio networks, to appear in Proc 29th Int. Colloq. on Automata, Languages and Programming, (ICALP’2002), Malaga, July 2002.
M. Chrobak, L. Gaşieniec, and W. Rytter, A randomized algorithm for gossiping in radio networks, In Proc. 7th Annual Int. Computing and Combinatorics Conference, (COCOON’2001), pp. 483–492.
M. Chrobak, L. Gaşieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, In Proc. 41st IEEE Symp. on Found. of Computer Science, (FOCS’2000), pp. 575–581. A full version to appear in Journal of Algorithms.
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, Washington, DC, 2001, pp. 709–718.
A.E. F. Clementi, A. Monti, and R. Silvestri, Round robin is optimal for faulttolerant broadcasting on wireless networks, In Proc. 9th Ann. European Symposium on Algorithms, (ESA’2001), pp 452–463.
G. De Marco, and A. Pelc, Faster broadcasting in unknown radio networks, Information Processing Letters, 79(2), pp 53–56, (2001).
L. Gaşieniec & A. Lingas, On adaptive deterministic gossiping in ad-hoc radio networks, In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’2002), January 2002, pp 689–690.
L. Gaşieniec and I. Potapov, Gossiping with unit messages in known radio networks, to appear in Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, August 2002.
P. Indyk, Explicit constructions of selectors and related combinatorial structures with applications, In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, (SODA’2002), January 2002, pp 697–704.
E. Kushilevitz, and Y. Mansour, An Ω(Dlog(N/D)) lower bound for broadcast in radio networks, SIAM J. on Computing, 27 (1998), pp. 702–712.
D. Peleg, Deterministic radio broadcast with no topological knowledge, 2000, a manuscript.
K. Ravishankar and S. Singh, Asymptotically optimal gossiping in radio networks, Discrete Applied Mathematics 61 (1995), pp 61–82.
K. Ravishankar and S. Singh, Gossiping on a ring with radios, Par. Proc. Let. 6, (1996), pp 115–126.
S. Tabbane, Handbook of Mobile Radio Networks, Artech House Publishers, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaşieniec, L., Pagourtzis, A., Potapov, I. (2002). Deterministic Communication in Radio Networks with Large Labels. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_46
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive