Optimization of Top-k Query in Sensor Networks with Limited Memory

With the increasing events monitored in sensor networks, it generates a vital amount of data which have to be stored for further retrieval and data analysis. Since sensor nodes are battery-powered and memory-constraint, it is necessary to design energy and storage efficient algorithms for query processing. In this paper, we propose a limited-cache approach to optimizing the storage problem. We apply the approach to top-k query problem and design new algorithms. Storage costs can be reduced by limiting cache of each node. Simulation results show that the storage cost can be reduced significantly while only little energy is consumed. This approach can be generalized for other query problems.