Abstract
A fundamental class of problems in wireless communication is concerned with the assignment of suitable transmission powers to wireless devices/stations such that the resulting communication graph satisfies certain desired properties and the overall energy consumed is minimized. Many concrete communication tasks in a wireless network like broadcast, multicast, point-to-point routing, creation of a communication backbone, etc. can be regarded as such a power assignment problem.
This paper considers several problems of that kind; the first problem was studied before in [1,6] and aims to select and assign powers to k out of a total of n wireless network stations such that all stations are within reach of at least one of the selected stations. We show that the problem can be (1 + ε) approximated by only looking at a small subset of the input, which is of size , i.e. independent of n and polynomial in k and 1/ε. Here d denotes the dimension of the space where the wireless devices are distributed, so typically d ≤ 3 and describes the relation between the Euclidean distance between two stations and the power consumption for establishing a wireless connection between them. Using this coreset we are able to improve considerably on the running time of \(n^{((\alpha/\epsilon)^{O(d)})}\) for the algorithm by Bilo et al. at ESA’05 ([6]) actually obtaining a running time that is linear in n. Furthermore we sketch how outliers can be handled in our coreset construction.
The second problem deals with the energy-efficient, bounded-hop multicast operation: Given a subset C out of a set of n stations and a designated source node s we want to assign powers to the stations such that every node in C is reached by a transmission from s within k hops. Again we show that a coreset of size independent of n and polynomial in k, |C|, 1/ε exists, and use this to provide an algorithm which runs in time linear in n.
The last problem deals with a variant of non-metric TSP problem where the edge costs are the squared Euclidean distances; this problem is motivated by data aggregation schemes in wireless sensor networks. We show that a good TSP tour under Euclidean edge costs can be very bad in the squared distance measure and provide a simple constant approximation algorithm, partly improving upon previous results in [5], [4].
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
Alt, H., Arkin, E.M., Brönnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: SCG 2006: Proc. 22nd Ann. Symp. on Computational Geometry, pp. 449–458. ACM Press, New York (2006)
Ambühl, C.: An optimal bound for the mst algorithm to compute energy-efficient broadcast trees in wireless networks. In: ICALP, pp. 1139–1150 (2005)
Ambühl, C., Clementi, A.E.F., Ianni, M.D., Lev-Tov, N., Monti, A., Peleg, D., Rossi, G., Silvestri, R.: Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks. In: STACS, pp. 418–427 (2004)
Andreae, T.: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks 38(2), 59–67 (2001)
Bender, M.A., Chekuri, C.: Performance guarantees for the TSP with a parameterized triangle inequality. Information Processing Letters 73(1–2), 17–21 (2000)
Bilò, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: European Symposium on Algorithms (ESA), pp. 460–471 (2005)
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: STACS, pp. 121–131 (2001)
Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: 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), pp. 23–38 (2002)
Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), Washington, DC, pp. 671–679 (2001)
Funke, S., Laue, S.: Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 272–283. Springer, Heidelberg (2007)
Har-Peled, S.: Clustering motion. Discrete Comput. Geom. 31(4), 545–565 (2004)
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theor. Comput. Sci. 243(1-2), 289–305 (2000)
Orponen, P., Mannila, H.: On approximation preserving reductions: Complete problems and robust measures. Technical Report, University of Helsinki (1990)
Guha, S., Khuller, S.: Improved methods for approximating node weighted steiner trees and connected dominating sets. Information and Computation 150, 57–74 (1999)
Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proc. 20th ACM Symp. on Theory of Computing (1988)
Wan, P.-J., Calinescu, G., Li, X., Frieder, O.: Minimum-energy broadcast routing in static ad hoc wireless networks. In: INFOCOM, pp. 1162–1171 (2001)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: INFOCOM, pp. 585–594 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Funke, S., Laue, S., Naujoks, R., Lotker, Z. (2008). Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours. In: Nikoletseas, S.E., Chlebus, B.S., Johnson, D.B., Krishnamachari, B. (eds) Distributed Computing in Sensor Systems. DCOSS 2008. Lecture Notes in Computer Science, vol 5067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69170-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-69170-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69169-3
Online ISBN: 978-3-540-69170-9
eBook Packages: Computer ScienceComputer Science (R0)