Abstract
A gossiping is a communication primitive in which each node of the network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping problem in known ad hoc radio networks, where during each transmission only unit messages originated at any node of the network can be transmitted successfully. We survey a number of radio network topologies. Assuming that the size (a number of nodes) of the network is n we show that the exact complexity of radio gossiping in stars is 2n–1, in rings is 2n±O(1), and on a line of processors is 3n ± O(1). We later prove that radio gossiping in free trees is harder and it requires at least 31/6n – 16 time steps to be completed. For free trees we also show a gossiping algorithm with time complexity 5n + 8. In conclusion we prove that in general graphs radio gossiping requires Ω(n log n) time, and we propose radio gossiping algorithm that works in time O(n log2 n).
Supported in part by EPSRC grants GR/N09855 and GR/R85921.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM Journal on Computing 22 (1993), pp. 875–887.
J.C. Bermond, L. Gargano, A.A. Rescigno, and U. Vacarro, Fast Gossiping by Short Messages, In Proc 22th Int. Colloq. on Automata, Languages andProgramming,(ICALP’1995), LNCS 944, pp. 135–146.
D.P. Bertsekas and J.N.Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1988.
I. Chlamtac and O. Weinstein, The Wave Expansion Approach to Broadcasting in Multihop Radio Networks, In Proc. INFOCOM, 1987.
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.
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.
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), to appear.
M. Chrobak, L. Gasieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, In Proc. 41st IEEE Symp. on Found. of Comp. Sci.,(FOCS’2000), pp. 575–581.
M. Chrobak, L. Gasieniec, 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.
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.
M. Flamini and S. Perennes, Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols, Tech Report, INRIA, January 1999.
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors, Volume 1, Prentice-Hall, 1988.
I. Caber and Y. Mansour, Broadcast in radio networks, in Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms,(SODA’1995), pp. 577–585.
L. Gasieniec and A. Lingas, On adaptive deterministic gossiping in ad hoc radio networks, In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA’2002), pp. 689–690.
P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, In Proc. 13th ACM-SIAM Symp. on Disc. Alg.,(SODA’2002), pp. 697–704.
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 Science+Business Media New York
About this chapter
Cite this chapter
Gąsieniec, L., Potapov, I. (2002). Gossiping with Unit Messages in Known Radio Networks. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP — The International Federation for Information Processing, vol 96. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_17
Download citation
DOI: https://doi.org/10.1007/978-0-387-35608-2_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5275-5
Online ISBN: 978-0-387-35608-2
eBook Packages: Springer Book Archive