Wireless integrated network sensors
Communications of the ACM
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Energy Efficient Data Collection in Distributed Sensor Environments
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Simulating the power consumption of large-scale sensor network applications
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint
IEEE Transactions on Mobile Computing
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
IEEE Transactions on Parallel and Distributed Systems
Top-k Monitoring in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Guaranteeing the network lifetime in wireless sensor networks: A MAC layer approach
Computer Communications
ASAP: An Adaptive Sampling Approach to Data Collection in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
An adaptive in-network aggregation operator for query processing in wireless sensor networks
Journal of Systems and Software
Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Query Processing in Sensor Networks
IEEE Pervasive Computing
Near-lifetime-optimal data collection in wireless sensor networks via spatio-temporal load balancing
ACM Transactions on Sensor Networks (TOSN)
Predictive modeling-based data collection in wireless sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
An adaptive strategy for energy-efficient data collection in sparse wireless sensor networks
EWSN'10 Proceedings of the 7th European conference on Wireless Sensor Networks
Cross-Layer Design for Lifetime Maximization in Interference-Limited Wireless Sensor Networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
We study the processing of continuous top-k data collection (CTKDC) queries in lifetime-constrained wireless sensor networks. A query of this type continuously collects a list of k highest sensor readings into the base station in every epoch and reports to the user. So far, algorithms proposed to process these queries conventionally assume that k is a fixed number and then try to reduce the energy consumption of the sensor nodes or to maximize the lifetime of the network. However, in many practical monitoring applications, the most important user requirement is that the network can collect sensor data effectively for at least a designated amount of time while the value of k can be changed flexibly and only needs to be as high as possible. Therefore, in this paper, we propose an adaptive algorithm to process CTKDC queries in lifetime-constrained wireless sensor networks. Our algorithm works proactively at the sensor nodes and guides each sensor node to compute adaptively the amount of sensor data that it should send to the base station in each sampling interval. By controlling carefully the amounts of sensor data sent, and thus the cost of message transmissions, all sensor nodes together both make sure that the network will run until when the lifetime constraint is satisfied, and maximize the amount of top-k data reported to the user. Through experimental results, we show that the proposed algorithm can effectively ensure the network lifetime requirements when processing CTKDC queries. Moreover, the average amount of top-k data collected by this algorithm in a sampling interval is very close to the one obtained by the offline optimal algorithm in which all sensor readings are assumed to be known a priori.