Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Dimensions: why do we need a new data handling architecture for sensor networks?
ACM SIGCOMM Computer Communication Review
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
Balancing energy efficiency and quality of aggregate data in sensor networks
The VLDB Journal — The International Journal on Very Large Data Bases
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
The threshold join algorithm for top-k queries in distributed sensor networks
DMSN '05 Proceedings of the 2nd international workshop on Data management for sensor networks
The coverage problem in a wireless sensor network
Mobile Networks and Applications
Coverage and connectivity in three-dimensional networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Top-k Monitoring in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Optimizing parallel itineraries for knn query processing in wireless sensor networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Energy-efficient skyline queries over sensor network using mapped skyline filters
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Continuously maintaining sliding window skylines in a sensor network
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
| Hi-index | 0.00 |
The task of querying wireless sensor network (WSN) to retrieve data of interest is very significant and a wealth of query types have been proposed in the context of WSNs. This article describes the d-hop k-data coverage query problem, which is a novel query type, aiming at extracting "feature(s) distribution maps" from WSNs. This problem generalizes earlier research problems, like top-k, skyband, and d-hop dominating sets. For this problem, we provide a fully distributed solution, the DaCoN protocol, that avoids constructing a "network spanner", since such a structure requires an expensive initialization procedure, misses the notion of neighborhoods, and most importantly, it creates hot-spots of communication, that shorten the network lifetime (i.e., some nodes deplete their energy very fast). We have developed a simulator to study the performance and behavior of the DaCoN protocol for various sensornet topologies and data distributions, and the obtained results attested the energy-efficiency and effectiveness of the protocol.