Download now Free registration required
Energy conservation is an important issue in wireless networks. The authors 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. They 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. In wireless networks, devices communicate with radio signal and are powered by battery, which can hold very limited energy. Recharging the battery is usually inconvenient, if not impossible.
- Format: PDF
- Size: 141.09 KB