ABSTRACT
Abstract Power is one of the most critical resources in wireless ad hoc networks. One way of conserving power is to assign transmission power levels to the wireless nodes. Recently, much progress has been made on algorithmic and probabilistic studies of various power assignment problems. These problems come in many flavors, depending on the power requirement function and the connectivity constraint, and minimizing the total power consumption is NP-hard for most versions. We present without proofs the best known approximation algorithms for minimizing the total power consumption in the network, and sketch useful heuristics with practical value.
