TY - JOUR

T1 - Broadcasting in UDG radio networks with unknown topology

AU - Emek, Yuval

AU - Ga̧sieniec, Leszek

AU - Kantor, Erez

AU - Pelc, Andrzej

AU - Peleg, David

AU - Su, Chang

N1 - Funding Information:
The research of Leszek Ga̧sieniec is partially supported by Royal Society International Joint Project 2006/R2. The research of Andrzej Pelc is partially supported by NSERC discovery grant and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais. The research of David Peleg is partially supported by grants from the Minerva Foundation and the Israel Ministry of Science.

PY - 2009/2

Y1 - 2009/2

N2 - The paper considers 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 (D g) under the conditional wake up model and prove that broadcasting in this model cannot be accomplished by any deterministic algorithm in time better than Ω (D √ g) . For the spontaneous wake up model, we design two deterministic broadcasting algorithms: the first works in time O (D + g 2) and the second in time O (D log g). While neither 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 (D + g2, D logg), turns out to be optimal by establishing a matching lower bound.

AB - The paper considers 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 (D g) under the conditional wake up model and prove that broadcasting in this model cannot be accomplished by any deterministic algorithm in time better than Ω (D √ g) . For the spontaneous wake up model, we design two deterministic broadcasting algorithms: the first works in time O (D + g 2) and the second in time O (D log g). While neither 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 (D + g2, D logg), turns out to be optimal by establishing a matching lower bound.

KW - Ad hoc networks

KW - Broadcasting

KW - Radio networks

KW - Unit disk graphs

UR - http://www.scopus.com/inward/record.url?scp=60449107686&partnerID=8YFLogxK

U2 - 10.1007/s00446-008-0075-z

DO - 10.1007/s00446-008-0075-z

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:60449107686

SN - 0178-2770

VL - 21

SP - 331

EP - 351

JO - Distributed Computing

JF - Distributed Computing

IS - 5

ER -