On the effect of the deployment setting on broadcasting in Euclidean radio networks

The paper studies broadcasting in radio networks whose stations are represented by points in the Euclidean plane (each station knows its own coordinates). In any given time step, a station can either receive or transmit . A message transmitted from station v is delivered to every station u at distance at most 1 from v , but u successfully hears the message if and only if v is the only station at distance at most 1 from u that transmitted in this time step. A designated source station has a message that should be disseminated throughout the network. All stations other than the source are initially idle and wake up upon the first time they hear the source message. It is shown in [ 17 ] that the time complexity of deterministic broadcasting algorithms depends on two parameters of the network, namely, its diameter (in hops) D and a lower bound d on the Euclidean distance between any two stations. The inverse of d is called the granularity of the network, denoted by g . Specifically, the authors of [ 17 ] present a deterministic broadcasting algorithm that works in time O ( Dg ) and prove that every broadcasting algorithm requires ( D √(g)) time. In this paper, we distinguish between the arbitrary deployment setting , originally studied in [ 17 ], in which stations can be placed everywhere in the plane, and the new grid deployment setting , in which stations are only allowed to be placed on a d -spaced grid . Does the latter (more restricted) setting provide any speedup in broadcasting time complexity? Although the O ( Dg ) broadcasting algorithm of [ 17 ] works under the (original) arbitrary deployment setting, it turns out that the ( D √(g)) lower bound remains valid under the grid deployment setting. Still, the above question is left unanswered. The current paper answers this question affirmatively by presenting a provable separation between the two deployment settings. We establish a tight lower bound on the time complexity of deterministic broadcasting algorithms under the arbitrary deployment setting proving that broadcasting cannot be completed in less than (D g) time. For the grid deployment setting, we develop a deterministic broadcasting algorithm that runs in time O ( D g^5 / 6log g ) , thus breaking the linear dependency on g .