Абстрактный

Disperse Processing of Presumption Top-K Inquire in Wireless Sensor Networks

K.Shanmuga priya, M.Manopriya

The Top-k query processing in sensor network is to evaluate the high ranked data tuples from the sensor node. Data pruning operations are performed on the cluster head for uncertain data. Accordingly, the new algorithm such as Sufficient Set-Based (SSB), Necessary Set-Based (NSB) for local Intercluster processing of the query. The Boundary-Based (BB) algorithm is proposed to process the query between two different boundary regions. There is the data distribution that changes dynamically, the adaptive algorithm is used to reduce transmission cost and there is a constant round of data communication in the network. The performance is evaluated in two-tier hierarchical network.