Faster deterministic gossiping in directed ad hoc radio networks

Leszek Ga̧sieniec, Tomasz Radzik, Qin Xin

Research output: Chapter in Book/Report/Conference proceedingChapter

31 Scopus citations

Abstract

We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/3 log4 n). The algorithm allows the labels (identifiers) of the nodes to be polynomially large in n, and is based on a novel way of using selective families. The previous best general (i.e., dependent only on n) deterministic upper bounds were O(n5/3 log3 n) for networks with polynomially large node labels [1], and O(n3/2 log2 n) for networks with linearly large node labels [2,3,4].

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsTorben Hagerup, Jyrki Katajainen
PublisherSpringer Verlag
Pages397-407
Number of pages11
ISBN (Electronic)3540223398, 9783540223399
DOIs
StatePublished - 2004

Publication series

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Faster deterministic gossiping in directed ad hoc radio networks'. Together they form a unique fingerprint.

  • Cite this

    Ga̧sieniec, L., Radzik, T., & Xin, Q. (2004). Faster deterministic gossiping in directed ad hoc radio networks. In T. Hagerup, & J. Katajainen (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 397-407). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3111). Springer Verlag. https://doi.org/10.1007/978-3-540-27810-8_34