GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Peer-to-Peer Spatial Queries in Sensor Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Supporting spatial aggregation in sensor network databases
Proceedings of the 12th annual ACM international workshop on Geographic information systems
A framework for spatio-temporal query processing over wireless sensor networks
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Exploiting Correlated Attributes in Acquisitional Query Processing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
ProcessingWindow Queries in Wireless Sensor Networks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Wireless sensor network localization techniques
Computer Networks: The International Journal of Computer and Telecommunications Networking
The emergence of networking abstractions and techniques in TinyOS
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Top-k Monitoring in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
STAR: self-tuning aggregation for scalable monitoring
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient geographic routing over lossy links in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Self-Tuning, Bandwidth-Aware Monitoring for Dynamic Data Streams
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Sampling Based (epsilon, delta)-Approximate Aggregation Algorithm in Sensor Networks
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Quality of Trilateration: Confidence-Based Iterative Localization
IEEE Transactions on Parallel and Distributed Systems
Bernoulli sampling based (ε, δ)-approximate aggregation in large-scale sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Duty cycle aware spatial query processing in wireless sensor networks
Computer Communications
Hi-index | 0.00 |
After wireless sensor network is deployed, users often submit spatial window aggregation queries to obtain statistical information of the regions of interest, such as maximum temperature, average humidity etc. Existing spatial window aggregation query processing algorithms are based on the assumption that the communication links are ideal which means there are perfect communication links within a given communication range, and none beyond. However, it is not valid in realistic sensor networks, which leads to high retransmissions of data frames. In order to address this problem, a reliable spatial window aggregation query processing algorithm called RESA is proposed in this paper. RESA only requires each node to maintain locations and residual energy of its neighbors and link qualities between them. According to the information, it divides the query area into several sub-regions, followed by collection of sensor readings in each sub-region. RESA traverses all the sub-regions within the query area to ensure the correctness of query result. Based on RESA's energy consumption formula derived, two highly efficient methods for sub-regional division are proposed to reduce packet loss rate during data communication and balance the load of nodes, hence saving energy consumption and extending lifetime. Experimental results show that in most cases RESA outperforms the existing algorithms in terms of energy consumption, quality of query results and lifetime.