On the complexity of energy-efficient broadcasting in wireless networks

Date

2008-08-14T22:56:23Z

Authors

Hollemans, Peter Francis

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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

Description

Keywords

wireless, communication, systems

Citation