Abstract
The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V,E) where |V| = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires \(D+\Omega(\sqrt{n-D})\) transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in \(D+O(\sqrt{n}\log n)\) rounds. Moreover, if we allow each node to transmit at most k times, the lower bound D + Ω((n − D)1/(2k)) on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in D + O(kn 1/(k − 2)log2 n) rounds. The paper concludes with a discussion of several other strategies for energy efficient radio broadcasting and a number of open problems in the area.
This is a preview of subscription content, log in via an institution to check access.
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
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)
Ambühl, C., Erlebach, T., Mihalak, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 3–14. Springer, Heidelberg (2006)
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Computer and System Sciences 43, 290–298 (1991)
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcasting in radio networks: an exponential gap between determinism and randomization. In: Proc. 5th Symposium on Principles of Distributed Computing (PODC), pp. 98–107 (1986)
Berenbrink, P., Cooper, C., Hu, Z.: Energy efficient randomised communication in unknown adhoc networks. In: Proc. 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 250–259 (2007)
Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. on Communications 39, 426–433 (1991)
Cicalese, F., Manne, F., Xin, Q.: Faster centralised communication in radio networks. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 339–348. Springer, Heidelberg (2006)
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 121–131. Springer, Heidelberg (2001)
Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 222–231 (2005)
Flammini, M., Navarra, A., Klasing, R., Perennes, S.: Improved approximation results for the minimum energy broadcasting problem. In: Proc. DIALM-POMC Workshop on Foundations of Mobile Computing, pp. 85–91 (2004)
Gaber, I., Mansour, Y.: Centralised broadcast in multihop radio networks. J. Algorithms 46(1), 1–20 (2003)
Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 129–137 (2005)
Gasieniec, L., Potapov, I., Xin, Q.: Efficient gossiping in known radio networks. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 173–184. Springer, Heidelberg (2004)
Goldberg, M., Spencer, T.: An efficient parallel algorithm that finds independent sets of guaranteed size. SIAM J. of Discrete Mathematics 6(3), 443–459 (1993)
Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)
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. Networking, 866–877 (2004)
Kowalski, D.R., Pelc, A.: Centralised deterministic broadcasting in undirected multi-hop radio networks. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 171–182. Springer, Heidelberg (2004)
Kowalski, D.R., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing 19(3), 185–195 (2007)
Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)
Navarra, A.: Tighter bounds for the minimum energy broadcasting problem. In: Proc. 3rd International Symposium on Modeling and Optimisation in Mobile, Ad-Hoc and Wireless Networks, pp. 313–322 (2005)
Wan, P.J., Calinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcast routing in static ad hoc wireless networks. In: Proc. 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1162–1171 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ga̧sieniec, L., Kantor, E., Kowalski, D.R., Peleg, D., Su, C. (2007). Energy and Time Efficient Broadcasting in Known Topology Radio Networks. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-75142-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75141-0
Online ISBN: 978-3-540-75142-7
eBook Packages: Computer ScienceComputer Science (R0)