A Novel Verification Scheme for Fine-Grained Top-k Queries in Two-Tiered Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
In this paper, we focus on designing efficient query of top-k data produced by sensor nodes in a wireless sensor network (WSN). Assume that we are given a connected WSN of diameter D, consisting of n nodes with maximum node degree ?. Two different models are studied. In the first model, each node holds a numeric element, the goal is to determine the top-k smallest (or biggest) of these elements from all nodes. In the second model, there are m objects in set L, each node v