On the complexity of energy-efficient broadcasting in wireless networks

On the complexity of energy-efficient broadcasting in wireless networks

We examine the complexity of the minimum-energy broadcast tree problem for wire-less networks. Some versions are known to be NP-complete. We show that the Euclidean version with unlimited power levels is also NP-complete. We assume a broadcast power metric of p(r) = kra where r is the broadcast radi...

Full description

Bibliographic Details
Main Author: Hollemans, Peter Francis
Other Authors: King, Valerie
Language:English
en
Published: 2008
Subjects:
wireless
communication
systems
UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science
Online Access:http://hdl.handle.net/1828/1071

Internet

http://hdl.handle.net/1828/1071

Similar Items