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 mod- els. 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.
|Number of pages||12|
|Journal||International Journal of Multimedia and Ubiquitous Engineering|
|State||Published - 1 Dec 2008|
- Graph theory
- Least-energy problem
- Maximum-leaf spanning- tree problem
- Wireless network