Yuval Emek
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 Ω(D√g). For the spontaneous wake up model, we design two deterministic broadcasting algorithms: the first works in time O(D + g2) 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 +g2,Dlogg}), turns out to be optimalby establishing a matching lower bound.
- Alon, N., Bar-Noy, A., Linial, N. Peleg, D.: A lower bound for radio broadcast. J. of Computer and System Sciences 43, (1991), 290--298. Google Scholar
Digital Library
- Avin, C., Ercal, G.: On the Cover Time of Random Geometric Graphs. In Proc. ICALP 2005, 677--689. Google ScholarDigital Library
- Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. J. of Computer and System Sciences 45, (1992), 104--126. Google ScholarDigital Library
- Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing 10, (1997), 129--135. Google ScholarDigital Library
- Chlamtac, I., Kutten, S.: On broadcasting in radio networks - problem analysis and protocol design. IEEE Trans. on Communications 33, (1985), 1240--1246.Google ScholarCross Ref
- Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. on Communications 39, (1991), 426--433.Google ScholarCross Ref
- Chlebus, B., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing 15, (2002), 27--38. Google ScholarDigital Library
- Chlebus, B., Gasieniec, L., Östlin, A., Robson, J. M.: Deterministic radio broadcasting. In Proc. ICALP 2000, 717--728. Google ScholarDigital Library
- Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In Proc. PODC 2004, 266--274. Google ScholarDigital Library
- Chrobak, M., Gasieniec, L., Kowalski, D.: The wake-up problem in multi-hop radio networks. In Proc. SODA 2004, 985--993. Google ScholarDigital Library
- Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In Proc. FOCS 2000, 575--581. Google ScholarDigital Library
- Clementi, A. E. F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In Proc. SODA 2001, 709--718. Google ScholarDigital Library
- Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In Proc. FOCS 2003, 492--501. Google ScholarDigital Library
- Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. J. of Discrete Algorithms 5 (2007), 187--201. Google ScholarDigital Library
- Diks, K., Kranakis, E., Krizanc, D., Pelc, A.: The impact of knowledge on broadcasting time in linear radio networks. Theoretical Computer Science 287, (2002), 449--471. Google ScholarDigital Library
- Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In Proc. SODA 2005, 222--231. Google ScholarDigital Library
- Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. J. of Algorithms 46, (2003), 1--20. Google ScholarDigital Library
- Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM J. on Discrete Mathematics 14, (2001), 207--222. Google ScholarDigital Library
- Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In Proc. PODC 2005, 129--137. Google ScholarDigital Library
- Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In Proc. ISAAC 2002, 535--549. Google ScholarDigital Library
- Kesselman, A. , Kowalski, D.,: Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks. In Proc. WONS 2005, 119--124. Google ScholarDigital Library
- Kowalski, D., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge, SIAM J. on Computing 33, (2004), 870--891. Google ScholarDigital Library
- Kowalski, D., Pelc, A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science 333, (2005), 355--371. Google ScholarDigital Library
- Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18, (2005), 43--57. Google ScholarDigital Library
- Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing, to appear.Google Scholar
- Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks, J. of Algorithms 39, (2001), 47--67. Google ScholarDigital Library
- Kushilevitz, E., Mansour, Y.: An Ω(Dlog(N/D)) lower bound for broadcast in radio networks. SIAM J. on Computing 27, (1998), 702--712. Google ScholarDigital Library
- Moscibroda, T., Wattenhofer, R.: Maximal independent sets in radio networks. In Proc. PODC 2005, 148--157. Google ScholarDigital Library
- Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In Proc. SPAA 2005, 39--48. Google ScholarDigital Library
- Muthukrishnan, S., Pandurangan, G.: The bin-covering technique for thresholding random geometric graph properties, In Proc. SODA 2005, 989--998. Google ScholarDigital Library
- Ravishankar, K., Singh, S.: Broadcasting on {0,L}. Discrete Applied Mathematics 53, (1994), 299--319. Google ScholarDigital Library
- Sen, A., Huson, M. L.: A New Model for Scheduling Packet Radio Networks, In Proc. IEEE INFOCOM 96, 1116--1124.Google Scholar
Index Terms
- Broadcasting in udg radio networks with unknown topology
Recommendations
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
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computingThe 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) ...
Efficient broadcasting in radio networks with long-range interference
We study broadcasting, also known as one-to-all communication, in synchronous radio networks with known topology modeled by undirected (symmetric) graphs, where the interference range of a node is likely exceeding its transmission range. In this model, ...
Comments