Power Assignment for Symmetric Communication in Wireless Sensor Networks

We show that two incremental power heuristics for power assignment in a wireless sensor network have approximation ratio 2. Enhancements to these heuristics are proposed. It is shown that these enhancements do not reduce the approximation ratio of the considered incremental power heuristics. However, experiments conducted by us indicate that the proposed enhancements, reduce the power cost of the assignment on average. Further, the two-edge switch enhancement yields a power-cost reduction (relative to using minimum cost spanning trees) that is, on average, twice as much as obtainable from any of the heuristics proposed earlier.

[1]  Mauro Leoncini,et al.  On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks , 2002, IFIP TCS.

[2]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[3]  Ian F. Akyildiz,et al.  A New Connection Admission Control for Spotbeam Handover in LEO Satellite Networks , 2002, Wirel. Networks.

[4]  Suresh Singh,et al.  Power-Aware Broadcasting in Mobile Ad Hoc Networks∗ , 1999 .

[5]  Anthony Ephremides,et al.  Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks , 2001, Mob. Networks Appl..

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

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[9]  Ion I. Mandoiu,et al.  Symmetric Connectivity with Minimum Power Consumption in Radio Networks , 2002, IFIP TCS.

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

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

[12]  Wen-Tsuen Chen,et al.  The strongly connecting problem on multihop packet radio networks , 1989, IEEE Trans. Commun..

[13]  Ernst Althaus,et al.  Power efficient range assignment in ad-hoc wireless networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[14]  Xiuzhen Cheng,et al.  Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics , 2003, IEEE Trans. Mob. Comput..

[15]  T. Gonzalez,et al.  Minimum-energy Broadcast in Simple Graphs with Limited Node Power , 2007 .

[16]  Arindam Kumar Das,et al.  Minimum power broadcast trees for wireless networks: integer programming formulations , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[17]  Andrea E. F. Clementi,et al.  On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..

[18]  Sartaj Sahni,et al.  Maximum Lifetime Broadcasting in Wireless Networks , 2005, IEEE Trans. Computers.

[19]  Sartaj Sahni,et al.  Data Structures, Algorithms and Applications in Java , 1998 .

[20]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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