GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Dimensions: why do we need a new data handling architecture for sensor networks?
ACM SIGCOMM Computer Communication Review
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Data Dissemination with Ring-Based Index for Wireless Sensor Networks
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Multi-dimensional range queries in sensor networks
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 |
Event-based ad hoc query processing is one of the most important functions of wireless sensor networks. Data centric storage algorithm is carried out to solve the problem but the traditional algorithm neglects that events will last for a time. During this time, the relationship between the query frequency and the data production frequency will change, which is an important feature to affect the energy consumption of the event-based ad hoc query processing in sensor networks. In this paper, we propose an adaptive data transmission algorithm, which takes the relationship into account. Experiments shows that our adaptive algorithm can save more energy than the traditional data centric storage algorithm.