Broadcasting with the Least Energy is an NP-Complete Problem

Energy conservation is an important issue in wireless networks. We propose a method for estimating the least amount of energy needed for broadcasting a message to all nodes in the network. The method can work with any reasonable energy models. We prove that this least-energy problem is NP-complete by showing that the maximum-leaf spanning-tree problem is a special case of the least-energy problem.

[1]  Jenhui Chen,et al.  MR/sup 2/RP: the multi-rate and multi-range routing protocol for ad hoc wireless networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  Gábor Wiener,et al.  On finding spanning trees with few leaves , 2008, Inf. Process. Lett..

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

[5]  Deborah Estrin,et al.  Medium access control with coordinated adaptive sleeping for wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.

[6]  R. Ravi,et al.  Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.

[7]  Hsueh-I Lu,et al.  The Power of Local Optimizations: Approximation Algorithms for Maximun-leaf Spanning Tree (DRAFT)* , 1996 .

[8]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[9]  Hong Linh Truong,et al.  Power and rate adaptation in IEEE 802.11a wireless LANs , 2003, The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring..

[10]  W. T. Tutte.  Graph Theory , 1984 .

[11]  Panos M. Pardalos,et al.  A distributed optimization algorithm for power control in wireless ad hoc networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[12]  Richard Han,et al.  Adaptive power control and selective radio activation for low-power infrastructure-mode 802.11 LANs , 2003, 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings..

[13]  Roberto Solis-Oba,et al.  A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves , 1998, Algorithmica.

[14]  Jenhui Chen,et al.  MR2RP: The Multi-Rate and Multi-Range Routing Protocol for IEEE 802.11 Ad Hoc Wireless Networks , 2003, Wirel. Networks.

[15]  Nicholas Bambos,et al.  Efficient data prefetching for power-controlled wireless packet networks , 2004, The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2004. MOBIQUITOUS 2004..

[16]  Gerhard J. Woeginger,et al.  A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves , 2003, MFCS.

[17]  Yu-Chee Tseng,et al.  Minimize waiting time and conserve energy by scheduling transmissions in IEEE 802.11-based ad hoc networks , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[18]  Roberto Cusani,et al.  Wireless LANs: an adaptive algorithm to reduce power consumption , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[19]  Anthony Ephremides,et al.  On the construction of 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).

[20]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[21]  Kuei-Ann Wen,et al.  Low power pseudo noise codec design for spread spectrum wireless communication , 1999, 42nd Midwest Symposium on Circuits and Systems (Cat. No.99CH36356).