Title :
Energy Efficient Approximate Top-k Range Queries in Sensor Networks
Author :
Wang, Yufeng ; Chen, Hong
Author_Institution :
Sch. of Inf., Renmin Univ. of China, Beijing, China
Abstract :
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.
Keywords :
approximation theory; pattern clustering; wireless sensor networks; approximate top-k range scheme; disjoint clusters network; sensor networks; top-k range queries; value based D-hop cluster mode; Algorithm design and analysis; Analytical models; Clustering algorithms; Computer networks; Costs; Energy efficiency; Irrigation; Routing; Technical Activities Guide -TAG; Approximate; Sensor networks; Top-k Range query;
Conference_Titel :
Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on
Conference_Location :
Sanya, Hainan
Print_ISBN :
978-0-7695-3605-7
DOI :
10.1109/CSO.2009.54
