Broadcasting in udg radio networks with unknown topology

Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su

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

14 Scopus citations

Abstract

We consider broadcasting in radio networks, modeled as unit disk graphs (UDG). Such networks occur in wireless communication between sites (e.g., stations or sensors) situated in a terrain. Network stations are represented by points in the Euclidean plane, where a station is connected to all stations at distance at most 1 from it. A message transmitted by a station reaches all its neighbors, but a station hears a message (receives the message correctly) only if exactly one of its neighbors transmits at a given time step. One station of the network, called the source, has a message which has to be disseminated to all other stations. Stations are unaware of the network topology. Two broadcasting models are considered. In the conditional wake up model, the stations other than the source are initially idle and cannot transmit until they hear a message for the first time.In the spontaneous wake up model, all stations are awake (and may transmit messages) from the beginning. It turns out that broadcasting time depends on two parameters of the UDG network, namely, its diameter D and its granularity g, which is the inverse of the minimum distance between any two stations. We present a deterministic broadcasting algorithm which works in time O(Dg) under the conditional wake up model and prove that broadcasting in this model cannot be accomplished by any deterministic algorithm in time better than (Dg). For the spontaneous wake up model, we design two deterministic broadcasting algorithms: the first works in time O(D + g 2) and the second intime O(Dlog g). While none of these algorithms alone is optimal for all parameter values, we prove that the algorithm obtained by interleaving their steps, and thus working in time O(min{D +g 2,Dlogg}), turns out to be optimalby establishing a matching lower bound.

Original languageEnglish (US)
Title of host publicationPODC'07
Subtitle of host publicationProceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing
Pages195-204
Number of pages10
DOIs
StatePublished - Dec 14 2007
Externally publishedYes
EventPODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing - Portland, OR, United States
Duration: Aug 12 2007Aug 15 2007

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

ConferencePODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing
CountryUnited States
CityPortland, OR
Period8/12/078/15/07

Keywords

  • Ad hoc networks
  • Broadcasting
  • Radio networks
  • Unit disk graphs

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Broadcasting in udg radio networks with unknown topology'. Together they form a unique fingerprint.

  • Cite this

    Emek, Y., Gasieniec, L., Kantor, E., Pelc, A., Peleg, D., & Su, C. (2007). Broadcasting in udg radio networks with unknown topology. In PODC'07: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (pp. 195-204). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). https://doi.org/10.1145/1281100.1281130