Time efficient k-shot broadcasting in known topology radio networks

Leszek Ga̧sieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su

Research output: Contribution to journalArticle

13 Scopus citations

Abstract

The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where |V| = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in rounds. Moreover, if we allow each node to transmit at most k times, the lower bound on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in rounds. The paper concludes with a number of open problems in the area.

Original languageEnglish (US)
Pages (from-to)117-127
Number of pages11
JournalDistributed Computing
Volume21
Issue number2
DOIs
StatePublished - Jul 1 2008
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Cite this