Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Optimal workload allocation in open networks of multiserver queues
Management Science
Power management techniques for mobile communication
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Energy-conserving access protocols for identification networks
IEEE/ACM Transactions on Networking (TON)
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
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Proceedings of the 8th annual international conference on Mobile computing and networking
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Dynamic node activation in networks of rechargeable sensors
IEEE/ACM Transactions on Networking (TON)
Multi-sensor event detection under temporal correlations with renewable energy sources
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Multi-sensor activation for temporally correlated event monitoring with renewable energy sources
International Journal of Sensor Networks
| Hi-index | 0.00 |
We address the problem of optimal node activation in a sensor network, where the optimization objective is represented as a global time-average utility function over the deployment area of the network. Each sensor node is rechargeable, and can hold up to K quanta of energy. When the recharge and/or discharge processes in the network are random, the problem of optimal sensor activation is a complex stochastic decision question. For the case of identical sensor coverages, we show the existence of a simple threshold policy which is asymptotically optimal with respect to the energy bucket size K, that is, the performance of this threshold policy approaches the optimal performance as K becomes large. We also show that the performance of the optimal threshold policy is robust to the degree of spatial correlation in the discharge and/or recharge processes. We then extend this approach to a general sensor network where coverage areas of different sensors could have complete, partial or no overlap with each other. We demonstrate through simulations that a local information based threshold policy, with an appropriately chosen threshold, achieves a performance which is very close to the global optimum.