BibTeX:

@article{IJIRSTV2I11157,
     title={An Efficient Data Gathering and Aggregation for Multiple Applications in Wireless Sensor Networks},
     author={Mr. T. Balaji, Mr. P. Nanda Kumar, Mrs. M. Fathima Begum, Mr. M. Abdul Naseer and Mr. S. Abdul Kani},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={2},
     number={11},
     pages={764--770},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV2I11157.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}

Data aggregation in wireless sensor networks refers to acquiring the sensed data from the sensors to the gateway node. It reduces the amount of power consumed during data transmission between the sensor nodes. Generally homomorphic encryptions have been applied to conceal communication during aggregation. Since enciphered data can be aggregated algebraically without decryption. Here adversaries are able to forge aggregated results by compromising them. However, these schemes are not satisfying multi-application environments, provide insecure transmission and do not provide secure counting for unauthorized aggregation attacks. In this paper, we propose a new concealed data aggregation scheme extended from homomorphic privacy encryption system. The proposed scheme designed for a multi-application environment, mitigates the impact of compromising attacks in single application environments and also it can avoid the damage from unauthorized aggregations by the privacy homomorphic encryption scheme.

Elliptic curve cryptography, cluster head, privacy homomorphic encryption, wireless sensor networks, Concealed data aggregation