ABSTRACT
The paper studies broadcasting in radio networks whose stations are represented by points in the Euclidean plane. 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 [11] that the time complexity of broadcasting 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 [11] present a broadcasting algorithm that works in time (O (D g)) and prove that every broadcasting algorithm requires Ω (D √g) time. In this paper, we distinguish between the arbitrary deployment setting, originally studied in [11], 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 provides any speedup in broadcasting time complexity? Although the (O (D g)) broadcasting algorithm of [11] 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 broadcasting 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 broadcasting algorithm that runs in time O ( D g5 / 6 log g), thus breaking the linear dependency on (g).
- N. Alon, A. Bar-Noy, N. Linial and D. Peleg. A lower bound for radio broadcast. J. Comput. Syst. Sci., 43(2):290--298, 1991. Google ScholarDigital Library
- R. Bar-Yehuda, O. Goldreich and A. Itai. On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci., 45(1):104--126, 1992. Google ScholarDigital Library
- I. Chlamtac and S. Kutten. On broadcasting in radio networks--problem analysis and protocol design. IEEE Trans. on Communications, 33:1240--1246, 1985.Google ScholarCross Ref
- I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. on Communications, 39(3):426--433, 1991.Google ScholarCross Ref
- B. S. Chlebus, L. Gasieniec, A. Ostlin and J. M. Robson. Deterministic Radio Broadcasting. In Proc. International Colloquium on Automata, Languages and Programming (ICALP), 717--728, 2000. Google ScholarDigital Library
- M. Chrobak, L. Gasieniec and W. Rytter. Fast Broadcasting and Gossiping in Radio Networks. In Proc. IEEE Symposium on Foundations of Computer Science (FOCS), 575--581, 2000. Google ScholarDigital Library
- A. E. F. Clementi, A. Monti and R. Silvestri. Selective families, superimposed codes, and broadcasting on unknown radio networks. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), 709--718, 2001. Google ScholarDigital Library
- A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. In Proc. IEEE Symposium on Foundations of Computer Science (FOCS), 492--501, 2003. Google ScholarDigital Library
- A. Dessmark and A. Pelc. Broadcasting in geometric radio networks. J. Discrete Algorithms, 5(1):187--201, 2007. Google ScholarDigital Library
- M. Elkin and G. Kortsarz. Improved schedule for radio broadcast. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), 222--231, 2005. Google ScholarDigital Library
- Y. Emek, L. Gasieniec, E. Kantor, A. Pelc, D. Peleg and C. Su. Broadcasting in UDG radio networks with unknown topology. In Proc. ACM Symposium on Principles of Distributed Computing (PODC), 195--204, 2007. Google ScholarDigital Library
- I. Gaber and Y. Mansour. Centralized broadcast in multihop radio networks. J. Algorithms, 46(1):1--20, 2003. Google ScholarDigital Library
- L. Gasieniec, D. Peleg and Q. Xin. Faster communication in known topology radio networks. In Proc. ACM Symposium on Principles of Distributed Computing (PODC), 129--137, 2005. Google ScholarDigital Library
- D. R. Kowalski and A. Pelc. Time of deterministic broadcasting in radio networks with local knowledge. SIAM J. on Computing, 33:870--891, 2004. Google ScholarDigital Library
- D. R. Kowalski and A. Pelc. Broadcasting in undirected ad hoc radio networks. Distributed Computing, 18(1):43--57, 2005. Google ScholarDigital Library
- D. R. Kowalski and A. Pelc. Optimal deterministic broadcasting in known topology radio networks. Distributed Computing, 19(3):185--195, 2007. Google ScholarDigital Library
- E. Kushilevitz and Y. Mansour. An (Ω (D log (N / D)) ) lower bound for broadcast in radio networks. SIAM J. Comput., 27(3):702--712, 1998. Google ScholarDigital Library
- T. Moscibroda and R. Wattenhofer. Maximal independent sets in radio networks. In Proc. ACM Symposium on Principles of Distributed Computing (PODC), 148--157, 2005. Google ScholarDigital Library
- T. Moscibroda and R. Wattenhofer. Coloring unstructured radio networks. In Proc. ACM Symposium on Parallel Algorithms (SPAA), 39--48, 2005. Google ScholarDigital Library
Index Terms
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
Recommendations
Broadcasting in udg radio networks with unknown topology
PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computingWe 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 ...
Broadcasting in UDG radio networks with unknown topology
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 ...
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 ...
Comments