Secure and Energy Efficient Data Aggregation Technique for Cluster Based Wireless Sensor Network

In the past few years secure transmission of data along with efficiency is a serious issue for wireless sensor networks (WSNs).Clustering is a powerful and convenient way to enhance performance of the WSNs system. In this project work, a secure transmission of data for cluster-based WSNs (CWSNs) is studied, where the clusters are formed dynamically and infrequently. Basically protocols for CWSNs, called SET-IBS (Identity-Based digital Signature)scheme and SET-IBOOS (Identity-Based Online / Offline digital Signature)scheme, correspondingly. In SET-IBS, security relies on the hardness of the Dill-Hellman difficulty in the pairing area. Data aggregation is the process of abbreviation and combining sensor data in order to reduce the amount of data transmission in the network. This paper investigates the relationship between security and data aggregation process in wireless sensor networks. In this paper propose SET-IBS and data aggregation techniques for secure and efficient data transmission. For energy consumption using DRINA algorithm. DRINA means Data Routing for In-Network Aggregation, that has some key aspects such as high aggregation rate, a reduced number of messages for setting up a routing

SECURE AND ENERGY EFFICIENT DATA AGGREGATION IN WIRELESS SENSOR NETWORKS

ABSTRACT To decrease the correspondence overhead and drag out the system lifetime information accumulation is utilized in remote sensor systems. Then again, a rival may bargain some sensor hubs, and utilization them to produce false values as the accumulation result. Past secure information conglomeration plans have handled this issue from diverse points. The objective of those calculations is to guarantee that the Base Station (BS) does not acknowledge any fashioned collection results. Be that as it may none of them have attempted to identify the hubs that infuse into the system fake collection results. Also, the greater part of them generally has a correspondence overhead that is, (best case scenario) logarithmic every hub. In this paper, we propose a protected and vitality effective information total plan that can distinguish the awful hubs with a steady every hub correspondence overhead. In our answer, all total results are marked with the private keys of the aggregators so they can't be modified by others. Hubs on every connection moreover utilize their pair-wise imparted key for secure correspondences. Every hub gets the total results from its parent (sent by the guardian of its parent) and its kin (through its parent hub), and confirms the collection aftereffect of the guardian hub. Hypothetical examination on vitality utilization and correspondence overhead concurs with our correlation based recreation examine over irregular information conglomeration trees