Energy Efficient Approximate Top-k Range Queries in Sensor Networks

In some special situations, current Top-k query can not provide a satisfying result since it can only return single nodes. This paper studies Top-k Range query which find the regions with highest average readings. Top-k Range query is novel addition to the family of Top-k queries. This paper first proposes a naive solution and then proposes an approximate Top-k Range scheme. It uses Value based D-hop cluster Mode dividing network into disjoint clusters and then return top-k clusters. Theoretical analyze and simulation proves that the algorithm will satisfy the userpsilas need with rather low energy cost.