Wireless integrated network sensors
Communications of the ACM
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Data Dissemination with Ring-Based Index for Wireless Sensor Networks
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Matching data dissemination algorithms to application requirements
Proceedings of the 1st international conference on Embedded networked sensor systems
Making data-centric storage adaptive and cost-optimal
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Recent years have witnessed growing research interest in wireless sensor networks. In the literature, three data storage strategies, i.e., local, data-centric, and index-centric, have been proposed to answer one-shot queries originated from inside the network. Through careful analysis, we show in this paper that each of the three strategies respectively achieves the best performance in a certain range of query-rate to update-rate (Q2U) ratios. We therefore propose several adaptive schemes which periodically adjust the data storage and dissemination strategy in accordance with the Q2U ratio observed in the network. Experimental results demonstrate that in dynamic environments the proposed adaptive schemes substantially outperform the three basic strategies.