Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours

In this paper, we present approximation algorithms for a variety of problems occurring in the design of energy-efficient wireless communication networks. We first study the k-station network problem, where for a set S of stations and some constant k, one wants to assign transmission powers to at most k senders such that every station in S can receive a signal from at least one sender. We give a (1+@e)-approximation algorithm for this problem. The second problem deals with energy-efficient networks, allowing bounded hop multicast operations, that is given a subset C of the stations S and a designated source node s@?S, we want to assign powers to the sending stations, such that every node in C can be reached by a transmission from s within k hops. For this problem, we provide an algorithm which runs in time linear in |S|. The last problem deals with a variant of the non-metric TSP problem where the edge costs correspond to the Euclidean distances to the power of some @a>=1; this problem is motivated by data aggregation schemes in wireless sensor networks. We provide a simple constant approximation algorithm, which improves upon previous results when 2=<@a=<2.7.

[1]  János Pach,et al.  Combinatorial and Computational Geometry , 2011 .

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

[3]  Sariel Har-Peled.  Clustering Motion , 2004, Discret. Comput. Geom..

[4]  Upena Dalal,et al.  Wireless Communication , 2010 .

[5]  Daniel Patel.  Energy in Ad-Hoc Networking for the PicoRadio , 2000 .

[6]  Kasturi R. Varadarajan,et al.  Geometric Approximation via Coresets , 2007 .

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

[8]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[9]  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).

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

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

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

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

[14]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

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

[16]  Michael A. Bender,et al.  Performance guarantees for the TSP with a parameterized triangle inequality , 1999, Inf. Process. Lett..

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

[18]  Michael A. Bender,et al.  Performance guarantees for the TSP with a parameterized triangle inequality , 2000, Inf. Process. Lett..

[19]  Thomas Andreae,et al.  On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality , 2001, Networks.

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

[21]  Seung-Jun Yu,et al.  Wireless Communication , 1916, Nature.

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

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

[24]  Xiang-Yang Li,et al.  Erratum: Minimum-Energy Broadcast in Static Ad Hoc Wireless Networks , 2005, Wirel. Networks.

[25]  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).