Abstrakt

Evaluation of Probabilistic Top-k Queries in Wireless Sensor Network by Expected Ranking Method

Shanmuga priya.k, Manopriya.M

A wireless sensor Network consists of spatially dispersed self-directed sensors to monitor the environment conditions. In probabilistic Top-k, a new approach such as Expected ranking method is used to get accurate result in finding Top-k results and as well as accurate probability. For intercluster processing three algorithm is used namely Sufficient-set based, Necessary-set based and Boundary based algorithm. For reducing transmission cost adaptive algorithm is used and this gives the efficient result in the bounded rounds of communication. This gives least transmission cost and not exceeds two rounds of communication.