Abstract
The paper concerns time-efficient k-shot broadcasting in undirected radio networks. In a k-shot broadcasting algorithm, each node in the network is allowed to transmit at most k times. Both known and unknown topology models are considered. For the known topology model, the problem has been studied before by Ga̧sieniec et al. [14], who established an upper bound of D + O(kn 1/(k − 2)log2 n) and a lower bound of \(D+{\it \Omega}((n-D)^{1/2k})\) on the length of k-shot broadcasting schedules for n-node graphs of diameter D. We improve both the upper and the lower bound, providing a randomized algorithm for constructing a k-shot broadcasting schedule of length D + O(kn 1/2klog2 + 1/k n) on undirected graphs, and a lower bound of \(D+{\it \Omega}(k\cdot(n-D)^{1/2k})\), which almost closes the gap between these bounds. For the unknown topology model, we provide the first k-shot broadcasting algorithm. Assuming that each node knows only the network size n (or a linear upper bound on it), our randomized k-shot broadcasting algorithm completes broadcasting in O((D + min {D ·k,logn}) ·n 1/(k − 1)logn) rounds with high probability. Moreover, we present an \({\it \Theta}(\log n )\)-shot broadcasting algorithm that completes broadcasting in at most O(Dlogn + log2 n) rounds with high probability. This algorithm matches the broadcasting time of the algorithm of Bar-Yehuda et al. [3], which assumes no limitation on the maximum number of transmissions per node.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported in part by grants from the Minerva Foundation and the Israel Ministry of Science.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, A., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Compt. Syst. Science 43, 290–298 (1991)
Ambühl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1139–1150. Springer, Heidelberg (2005)
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. J. Compt. Syst. Science 45, 104–126 (1992)
Chlamtac, I., Kutten, S.: On broadcasting in radio networks - problem analysis and protocol design. IEEE Trans. Communications 33, 1240–1246 (1985)
Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Communications 39, 426–433 (1991)
Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. 41st Symp. on Foundations of Computer Science (FOCS), pp. 575–581 (2000)
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, R., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Proc. 18th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 12–131 (2001)
Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 22nd ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 709–718 (2001)
Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unkown topology. In: Proc. 44rd IEEE Symp. on Foundations of Computer Science (FOCS), pp. 492–501 (2003)
De Marco, G.: Distributed broadcast in unknown radio networks. In: Proc. 29th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 208–217 (2008)
Elkin, M., Kortsarz, G.: Improved schedule for radio broadcast. In: Proc. 26th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 222–231 (2005)
Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. Journal of Algorithms 46(1), 1–20 (2003)
Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th ACM symp. on Principles of Distributed Computing (PODC), pp. 129–137 (2005)
Ga̧sieniec, L., Kantor, E., Kowalski, D.R., Peleg, D., Su, C.: Time efficient k-shot broadcasting in known topology radio networks. Distributed Computing 21(2), 117–127 (2008)
Guha, S., Khuller, S.: Improved methods for approximating node-weighted steiner trees and connected dominating sets. Information and Computation 150, 57–74 (1999)
Klasing, R., Navarra, A., Papadopoulos, A., Perennes, S.: Adaptive broadcast consumption (abc), a new heuristic and new bounds for the minimum energy broadcast routing problem. In: Networking, pp. 866–877 (2004)
Kowalski, D.R.: On selection problem in radio networks. In: Proc. 24th ACM symp. on Principles of Distributed Computing (PODC), pp. 158–166 (2005)
Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. In: Proc. 22nd ACM symp. on Principles of Distributed Computing (PODC), pp. 73–82 (2003)
Kowalski, D.R., Pelc, A.: Faster deterministic broadcasting in ad hoc radio networks. In: Proc. 20th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 109–120 (2003)
Kowalski, D.R., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing 19, 185–195 (2007)
Kushilevitz, E., Mansour, Y.: An ω(dlog(n/d)) lower bound for broadcast in radio networks. SIAM J. on Computing 27, 702–712 (1998)
Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)
Wan, P.J., Calinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcast routing in static ad hoc wireless networks. In: Proc. 20th Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), pp. 1162–1171 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kantor, E., Peleg, D. (2009). Efficient k-Shot Broadcasting in Radio Networks. In: Keidar, I. (eds) Distributed Computing. DISC 2009. Lecture Notes in Computer Science, vol 5805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04355-0_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-04355-0_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04354-3
Online ISBN: 978-3-642-04355-0
eBook Packages: Computer ScienceComputer Science (R0)