DocumentCode
3338970
Title
Broadcasting with the Least Energy is an NP-Complete Problem
Author
Yang, Wuu ; Tseng, Huei-Ru ; Jan, Rong-Hong ; Shen, Bor-Yeh
Author_Institution
Nat. Chiao-Tung Univ., Hsinchu
fYear
2008
fDate
24-26 April 2008
Firstpage
197
Lastpage
200
Abstract
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.
Keywords
computational complexity; radio broadcasting; radio networks; NP-complete problem; broadcasting; least-energy problem; maximum-leaf spanning-tree problem; wireless networks; Algorithm design and analysis; Batteries; Costs; Data communication; Digital multimedia broadcasting; Energy consumption; NP-complete problem; Power engineering and energy; Radio broadcasting; Wireless networks; NP-complete; graph theory; least-energy problem; maximum-leaf spanning-tree problem; wireless network;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia and Ubiquitous Engineering, 2008. MUE 2008. International Conference on
Conference_Location
Busan
Print_ISBN
978-0-7695-3134-2
Type
conf
DOI
10.1109/MUE.2008.48
Filename
4505720
Link To Document