Average-time complexity of gossiping in radio networks

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

8 Scopus citations

Abstract

Radio networks model wireless synchronous communication with only one wave frequency used for transmissions. In the problem of many-to-all (M2A) communication, some nodes hold input rumors, and the goal is to have all nodes learn all the rumors. We study the average time complexity of distributed many-to-all communication by deterministic protocols in directed networks under two scenarios: of combined messages, in which all input rumors can be sent in one packet, and of separate messages, in which every rumor requires a separate packet to be transmitted. Let n denote the size of a network and k be the number of nodes activated with rumors; the case when k = n is called gossiping. We give & gossiping protocol for combined messages that works in the average time script O sign(n/log n), which is shown to be optimal. For the general M2A communication problem, we show that it can be performed in the average time script O sign(min{k log(n/k),n/log n}) with combined messages, and that Ω(k/log n + log n) is a lower bound. We give a gossiping protocol for separate messages that works in the average time script O sign(n log n), which is shown to be optimal. For the general M2A communication problem, we develop a protocol for separate messages with the average time script O sign(k log(n/k) log n), and show that Ω(k log n) is a lower bound.

Original languageEnglish (US)
Title of host publicationStructural Information and Communication Complexity - 13th International Colloquium, SIROCCO 2006, Proceedings
PublisherSpringer Verlag
Pages253-267
Number of pages15
ISBN (Print)3540354743, 9783540354741
DOIs
StatePublished - Jan 1 2006
Externally publishedYes
Event13th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2006 - Chester, United Kingdom
Duration: Jul 2 2006Jul 5 2006

Publication series

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

Conference

Conference13th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2006
CountryUnited Kingdom
CityChester
Period7/2/067/5/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Average-time complexity of gossiping in radio networks'. Together they form a unique fingerprint.

  • Cite this

    Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2006). Average-time complexity of gossiping in radio networks. In Structural Information and Communication Complexity - 13th International Colloquium, SIROCCO 2006, Proceedings (pp. 253-267). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4056 LNCS). Springer Verlag. https://doi.org/10.1007/11780823_20