Abstract
Used for topology control in ad-hoc wireless networks, Power Assignment is a family of problems, each defined by a certain connectivity constraint (such as strong connectivity) The input consists of a directed complete weighted graph G=(V,c). The power of a vertex u in a directed spanning subgraph H is given by PH (u) = max uv ∈ E(H) c(uv). The power of H is given by \(p(H) = \sum_{u \in v}p{\sc H}(u)\), Power Assignment seeks to minimize p(H) while H satisfies the given connectivity constraint. We present asymptotically optimal O(log n)-approximation algorithms for three Power Assignment problems: Min-Power Strong Connectivity, Min-Power Symmetric Connectivity (the undirected graph having an edge uv iff H has both uv and vu must be connected) and Min-Power Broadcast (the input also has r ∈ V , and H must be a r-rooted outgoing spanning arborescence).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wan, P., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum energy broadcast in static ad hoc wireless networks. Wireless Networks (2002)
Calinescu, G., Mandoiu, I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Baeza-Yates, R., Montaniri, U., Santoro, N. (eds.) Proc. 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), pp. 119–130. Kluwer Academic Publ., Dordrecht (2002)
Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of FOCS (1997)
Cardei, D.-Z.D.M.: Improving wireless sensor network lifetime through power aware organization. Submitted to ACM Wireless Networks
Slijepcevic, S., Potkonjak, M.: Power Efficient Organization of Wireless Sensor Networks. In: IEEE International Conference on Communications (ICC), Helsinki, June 2001, pp. 472–476 (2001)
Zussman, G., Segall, A.: Energy efficient routing in ad hoc disaster recovery networks. In: IEEE INFOCOM 2003 (2003)
Leighton, F., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM 6, 787–832 (1999)
Chen, W., Huang, N.: The strongly connecting problem on multihop packet radio networks. IEEE Transactions on COmmunications 37, 293–295 (1989)
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000); preliminary version in STACS 1997
Clementi, E., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Electronic Colloquium on Computational Complexity, vol. Report TR00-054 (2000); preliminary results in APPROX 1999 and STACS 2000
Clementi, A., 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)
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: New results for energyefficient broadcasting in wireless networks. In: ISAAC 2002, pp. 332–343 (2002)
Althaus, E., Calinescu, G., Mandoiu, I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment in ad-hoc wireless networks. In: WCNC 2003, pp. 1889–1894 (2003)
Blough, D., Leoncini, M., Resta, G., Santi, P.: On the symmetric range assignment problem in wireless ad hoc networks. In: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), pp. 71–82. Kluwer Academic Publishers, Dordrecht (2002)
Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.: Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In: Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE) (2002)
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45, 634–652 (1998)
Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for nodeweighted steiner trees. Journal of Algorithms 19, 104–115 (1995)
Chvatal, V.: A greedy heuristic for the set covering problem. Mathematics of Operation Research 4, 233–235 (1979)
Könneman, J.: Personal communication
Guha, S., Khuller, S.: Improved methods for approximating node weighted steiner trees and connected dominating sets. Information and Computation 150, 57–74 (1999)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979); Numerische Mathematik, vol. 1, pp. 269–271 (1960)
Liang, W.: Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks. In: MOBIHOC 2002, pp. 112–122 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A. (2003). Network Lifetime and Power Assignment in ad hoc Wireless Networks. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive