Power Assignment for Symmetric Communication in Wireless Sensor Networks

Abstract

We show that two incremental power heuristics for power assignment in a wireless sensor network have an approximation ratio 2. Enhancements to these heuristics are proposed. It is shown that these enhancements do not reduce the approximation ratio of the considered incremental power heuristics. However, experiments conducted by us indicate that the proposed enhancements reduce the power cost of the assignment on average. Further, the two-edge switch enhancements reduce the power-cost reduction (relative to using minimum cost spanning trees) that is, on average, twice as much as obtainable from any of the heuristics proposed earlier.

Keywords:

• Power Assignment
• Symmetric Connectivity
• Wireless Sensor Networks
• Approximation Algorithm

This research was supported, in part, by the National Science Foundation under grant ITR-0326155.

Notes

¹When a directed graph contains the directed edges (u, v) and (v, u), we say that (u, v) is bidirectional. A bidirectional edge may be modeled as an undirected edge. Hence, we use the terms bidirectional and undirected interchangeably.