Gossiping with unit messages in known radio networks

Leszek Gasieniec, Igor Potapov

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

42 Scopus citations

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(l), 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 3 1/6 n - 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).

Original languageEnglish (US)
Title of host publicationFoundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002)
PublisherSpringer New York LLC
Pages193-205
Number of pages13
ISBN (Print)9781475752755
StatePublished - Jan 1 2002
Externally publishedYes
EventIFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002 - Montreal, QC, Canada
Duration: Aug 25 2002Aug 30 2002

Publication series

NameIFIP Advances in Information and Communication Technology
Volume96
ISSN (Print)1868-4238

Conference

ConferenceIFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002
CountryCanada
CityMontreal, QC
Period8/25/028/30/02

ASJC Scopus subject areas

  • Information Systems and Management

Fingerprint Dive into the research topics of 'Gossiping with unit messages in known radio networks'. Together they form a unique fingerprint.

  • Cite this

    Gasieniec, L., & Potapov, I. (2002). Gossiping with unit messages in known radio networks. In Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002) (pp. 193-205). (IFIP Advances in Information and Communication Technology; Vol. 96). Springer New York LLC.