A Novel Approach on RCDA with Deffie Hellman in Wireless Sensor Networks

Recently, several data aggregation schemes based on privacy homomorphism encryption have been proposed and investigated on wireless sensor networks. These data aggregation schemes provide better security compared with traditional aggregation since cluster heads (aggregator) can directly aggregate the cipher texts without decryption; consequently, transmission overhead is reduced. However, the base station only retrieves the aggregated result, not individual data, which causes two problems. First, the usage of aggregation functions is constrained. Second, the base station cannot confirm data integrity and authenticity via attaching message digests or signatures to each sensing sample. This paper attempted to overcome the above two drawbacks. In this proposed design, the base station can recover all sensing data even these data has been aggregated. This property is called recoverable. Furthermore, the design has been generalized and adopted on both homogeneous and heterogeneous wireless sensor networks. The proposed work uses the elliptic curve Deffie- Hellman key exchange with RSA for file encryption and decryption and the signature was generated using message digest method namely Digital signature Algorithm. The proposed work was implemented using. Net. Experiment results demonstrate that the transmission overhead is still reduced even if this approach is recoverable on sensing data.