Power Assignment for Symmetric Communication in Wireless Sensor Networks

Authors:
Joongseok Park;Sartaj Sahni
Affiliations:
Computer & Information Science & Engineering, University of Florida, Gainesville, FL, USA;Computer & Information Science & Engineering, University of Florida, Gainesville, FL, USA
Venue:
International Journal of Distributed Sensor Networks
Year:
2009

Citing 10
Cited 0

Power consumption in packet radio networks

Theoretical Computer Science
Algorithms for energy-efficient multicasting in static ad hoc wireless networks

Mobile Networks and Applications
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Symmetric Connectivity with Minimum Power Consumption in Radio Networks

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Approximation Algorithms for Connected Dominating Sets

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics

IEEE Transactions on Mobile Computing
Maximum Lifetime Broadcasting in Wireless Networks

IEEE Transactions on Computers
Data Structures, Algorithms, And Applications In Java

Data Structures, Algorithms, And Applications In Java

Quantified Score

Hi-index	0.00

Visualization

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.