A randomized algorithm for gossiping in radio networks

Marek Chrobak, Leszek Gąsieniec, Wojciech Rytter

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

26 Scopus citations

Abstract

We present an O(n log4 n)-time randomized algorithm for gossiping in radio networks with unknown topology. This is the first algorithm for gossiping in this model whose running time is only a polylogarithmic factor away from the optimum. The fastest previously known (deterministic) algorithm for this problem works in time O(n3/2 log2 n).

Original languageEnglish (US)
Title of host publicationComputing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings
EditorsJie Wang
PublisherSpringer Verlag
Pages483-492
Number of pages10
ISBN (Print)9783540424949
StatePublished - Jan 1 2001
Externally publishedYes
Event7th Annual International Conference on Computing and Combinatorics, COCOON 2001 - Guilin, China
Duration: Aug 20 2001Aug 23 2001

Publication series

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

Conference

Conference7th Annual International Conference on Computing and Combinatorics, COCOON 2001
CountryChina
CityGuilin
Period8/20/018/23/01

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chrobak, M., Gąsieniec, L., & Rytter, W. (2001). A randomized algorithm for gossiping in radio networks. In J. Wang (Ed.), Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings (pp. 483-492). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2108). Springer Verlag.