Gossiping with bounded size messages in ad hoc radio networks

Malin Christersson, Leszek Ga̧sieniec, Andrzej Lingas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

34 Scopus citations

Abstract

We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary information, where b is an integer function and n is the number of nodes in the network.We term such a restricted gossiping problem b(n)-gossiping. We showthat √n-gossiping in an ad hoc radio network on n nodes can be done deterministically in time Õ(n 3/2) which asymptotically matches the best known upper bound on the time complexity of unrestricted deterministic gossiping†. Our upper bound on √n-gossiping is tight up to a poly-logarithmic factor and it implies similarly tight upper bounds on b(n)-gossiping where function b is computable and 1 ≤ b(n) ≤ √n holds. For symmetric ad hoc radio networks, we show that even 1-gossiping can be done deterministically in time Õ(n 3/2). We also demonstrate that O(nt)-gossiping in a symmetric ad hoc radio network on n nodes can be done in time O(n 2-t). Note that the latter upper bound is o(n3/2) when the size of a combined message is ω(n1/2). Furthermore, by adopting known results on repeated randomized broadcasting in symmetric ad hoc radio networks, we derive a randomized protocol for 1-gossiping in these networks running in time Õ(n) on the average. Finally, we observe that when a collision detection mechanism is available, even deterministic 1-gossiping in symmetric ad hoc radio networks can be performed in time Õ(n).

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings
Pages377-389
Number of pages13
StatePublished - Dec 1 2002
Externally publishedYes
Event29th International Colloquium on Automata, Languages, and Programming, ICALP 2002 - Malaga, Spain
Duration: Jul 8 2002Jul 13 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2380 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference29th International Colloquium on Automata, Languages, and Programming, ICALP 2002
CountrySpain
CityMalaga
Period7/8/027/13/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Gossiping with bounded size messages in ad hoc radio networks'. Together they form a unique fingerprint.

  • Cite this

    Christersson, M., Ga̧sieniec, L., & Lingas, A. (2002). Gossiping with bounded size messages in ad hoc radio networks. In Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings (pp. 377-389). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2380 LNCS).