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...
Main Author: | |
---|---|
Other Authors: | |
Language: | English en |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/1828/1071 |
Summary: | 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 radius, and k > 0 and a > 2 are properties of the signal propagation medium. We prove NP-completeness using a reduction from the planar 3-satisfiability problem |
---|