摘要
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.
| 原文 | English |
|---|---|
| 頁（從 - 到） | 55-66 |
| 頁數 | 12 |
| 期刊 | International Journal of Multimedia and Ubiquitous Engineering |
| 卷 | 3 |
| 發行號 | 3 |
| DOIs | |
| 出版狀態 | Published - 2008 |
