Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
New ideas for solving covering problems
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
A dual-space approach to tracking and sensor management in wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Optimizing Sensor Networks in the Energy-Latency-Density Design Space
IEEE Transactions on Mobile Computing
Energy management for battery-powered embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Analysis of discharge techniques for multiple battery systems
Proceedings of the 2003 international symposium on Low power electronics and design
Prediction-based monitoring in sensor networks: taking lessons from MPEG
ACM SIGCOMM Computer Communication Review - Special issue on wireless extensions to the internet
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Explicit and implicit algorithms for binate covering problems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Energy budgeting for battery-powered sensors with a known task schedule
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Location-unaware coverage in wireless sensor networks
Ad Hoc Networks
Sensor selection cost function to increase network lifetime with QoS support
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Energy budget approximations for battery-powered systems with a fixed schedule of active intervals
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Optimization-based dynamic sensor management for distributed multitarget tracking
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Markov decision process-based analysis of rechargeable nodes in wireless sensor networks
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
| Hi-index | 0.00 |
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the region R. When no such subset exists, the network is said to be dead. A key challenge in the design of a DSN is to maximize the operational life of the network. Since sensors are typically powered by batteries, this requires maximizing the battery lifetime. One way to achieve this is to determinethe optimal schedule for transitioning sets of sensors between active and inactive states while satisfying user specified performance constraints. This requires identification of feasible subsets (covers) of sensors and a scheme for switching between such subsets. We present an algorithmic solution to compute all the sensor covers in an implicit manner by formulating the problem as unate covering problem (UCP). The representation of all possible sensor sets is extremely efficient and can accommodate very large number of sensor covers. The representation and formulation makes it possible to consider the residual battery charge when switching between covers. We develop algorithms for switching between sensor covers aimed at maximizing the lifetime of the network. The algorithms take into account the transmission/reception costs of sensors, a user specified quality constraint and also utilize a novel battery model that accounts for the rate-dependent capacity effect and charge recoveryduring idle periods. Our simulation results show that lifetime improvement can be achieved by exploiting the charge recovery process. The work 1 presented here constitutes a framework for battery aware sensor management in which various types of constraints can be incorporated and a range of other communication protocols can be examined.