Secure data aggregation in wireless sensor networks using randomized dispersive routes

In a Wireless sensor network, specifically data aggregation reduces the amount of communication and energy utilization. Newly, the research centre has proposed a strong aggregation framework called synopsis diffusion which combines multipath routing schemes with duplicate-insensitive algorithms to perfectly compute aggregates (e.g., predicate Count, Sum) unkindness of message losing results from node and communication failures. But this aggregation framework does not solve the problems which are appearing at base station side. These problems may occur due to the irrespective of the network size, the per node communication over-head. In this paper, we make the synopsis diffusion approach secure against attacks in which compromised nodes put in false sub aggregate values. In particular, we present a novel lightweight verification algorithm by which the base station can determine if the computed aggregate (predicate Count or Sum) includes any false input. In this paper, we study the compromised node and denial-of-service is the two key attacks in wireless sensor networks. We disagree that multipath routing approaches are highly helpless to such attacks. So, for these attacks we develop the mechanisms that generate randomized multipath routes. In this designing, the routes are taken by the shares of dissimilar packets transform over time. So, we analytically examine the security and energy performance of proposed schemes.