Data networks
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
On the upper bound of α-lifetime for large sensor networks
ACM Transactions on Sensor Networks (TOSN)
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
Maximizing Network Lifetime for Connected Target Coverage in Wireless Sensor Networks
WIMOB '06 Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
An Integrated Approach to Energy-Aware Medium Access for Wireless Sensor Networks
IEEE Transactions on Signal Processing - Part I
Transmission Scheduling for Optimizing Sensor Network Lifetime: A Stochastic Shortest Path Approach
IEEE Transactions on Signal Processing
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Energy-efficient information retrieval for correlated source reconstruction in sensor networks
IEEE Transactions on Wireless Communications
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random field. We address optimal sensor scheduling and information routing under the performance measure of network lifetime. Both single-hop and multi-hop transmissions from sensors to an access point are considered. For both cases, we formulate the problems as integer programming based on the theories of coverage and connectivity in sensor networks. We derive upper bounds for the network lifetime that provide performance benchmarks for suboptimal solutions. Suboptimal sensor scheduling and data routing algorithms are proposed to approach the lifetime upper bounds with reduced complexity. In the proposed algorithms, we consider the impact of both the network geometry and the energy consumption in communications and relaying on the network lifetime. Simulation examples are used to demonstrate the performance of the proposed algorithms as compared to the lifetime upper bounds.