Power Assignment Problems in Wireless Communication

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; for example one problem studied before in \cite{Carrots, Bilo} aims to select and assign powers to $k$ of the stations such that all other stations are within reach of at least one of the selected stations. We improve the running time for obtaining a $(1+\epsilon)$-approximate solution for this problem from $n^{((\alpha/\epsilon)^{O(d)})}$ as reported by Bilo et al. (\cite{Bilo}) to $O(n+ {(\frac{k^{2d+1}}{\epsilon^d})}^{\min{\{2k, (\alpha/\epsilon)^{O(d)} \}}})$ that is, we obtain a running time that is \emph{linear} in the network size. Further results include a constant approximation algorithm for the TSP problem under squared (non-metric!) edge costs, which can be employed to implement a novel data aggregation protocol, as well as efficient schemes to perform $k$-hop multicasts.

[1]  Andrea E. F. Clementi,et al.  Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks , 2004, STACS.

[2]  Samir Khuller,et al.  Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, Inf. Comput..

[3]  Robert Krauthgamer,et al.  Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[4]  Klaus Jansen,et al.  Polynomial-time approximation schemes for geometric graphs , 2001, SODA '01.

[5]  Christoph Ambühl,et al.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005, ICALP.

[6]  Esther M. Arkin,et al.  Minimum-cost coverage of point sets by disks , 2006, SCG '06.

[7]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[8]  Andrea E. F. Clementi,et al.  Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks , 2001 .

[9]  Peter Sanders,et al.  Approximating Energy Efficient Paths in Wireless Multi-hop Networks , 2003, ESA.

[10]  Sanjeev Arora.  Approximation Schemes for Geometric NP-Hard Problems: A Survey , 2001, FSTTCS.

[11]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[13]  Sanjeev Arora,et al.  Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.

[14]  Vittorio Bilò,et al.  Geometric Clustering to Minimize the Sum of Cluster Sizes , 2005, ESA.

[15]  Stéphane Pérennes,et al.  Improved Approximation Results for the Minimum Energy Broadcasting Problem , 2004, DIALM-POMC '04.

[16]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[17]  P. Orponen,et al.  On Approximation Preserving Reductions: Complete Problems and Robust Measures (Revised Version) , 1987 .

[18]  Piotr Indyk,et al.  Approximate clustering via core-sets , 2002, STOC '02.

[19]  Stefan Funke,et al.  Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets , 2007, STACS.

[20]  Andrea E. F. Clementi,et al.  On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.