Discrete Mathematics - Topics on domination
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Wireless integrated network sensors
Communications of the ACM
Proceedings of the 7th annual international conference on Mobile computing and networking
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Infrastructure tradeoffs for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Energy management for battery-powered embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Energy Efficient Multi-Hop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Constructing Battery-Aware Virtual Backbones in Sensor Networks
ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
IEEE Communications Magazine
Information Sciences: an International Journal
Hi-index | 0.00 |
A critical issue in battery-powered sensor networks is to construct energy efficient virtual backbones for network routing. Recent study in battery technology reveals that batteries tend to discharge more power than needed and reimburse the overdischarged power if they are recovered. In this paper we first provide a mathematical battery model suitable for implementation in sensor networks. We then introduce the concept of battery-aware connected dominating set (BACDS) and show that in general the minimum BACDS (MBACDS) can achieve longer lifetime than the previous backbone structures. Then we show that finding a MBACDS is NP-hard and give a distributed approximation algorithm to construct the BACDS. The resulting BACDS constructed by our algorithm is at most (8 + Δ)opt size, where Δ is the maximum node degree and opt is the size of an optimal BACDS. Simulation results show that the BACDS can save a significant amount of energy and achieve up to 30% longer network lifetime than previous schemes.