Data Aggregation Scheme for Energy Efficiency in Wireless Sensor Network

Authors

  • Bhagyashri Julme  PG Scholar, Department of Computer Science and Engineering, Abha-Gaikwad Patil College of Engineering, Nagpur, Maharashtra, India
  • Prof. Pragati Patil  Assistant Professor, Department of Computer Science and Engineering, Abha-Gaikwad Patil College of Engineering, Nagpur, Maharashtra, India

Keywords:

Sensor Nodes,Cluster Head, Base Station,Wireless Sensor Networks, Cache Based System, Hop by hop authentication.

Abstract

In wireless sensor networks, data aggregation assumes an essential part in diminishing vitality utilization. As of late, explore has concentrated on secure data aggregation because of the open and unfriendly condition conveyed. The Homomorphic Encryption (HE) conspire is widely used to secure data classification. Be that as it may, HE-based data aggregation plans have the accompanying disadvantages: flexibility, unapproved aggregation, and constrained aggregation capacities. To take care of these issues, we propose a secure data aggregation plot by consolidating homomorphic encryption innovation with a mark conspire. To answer this issue we presented a system speaks to a strategy in that powerful cluster head is picked based on the separation from the base station and remaining vitality. Subsequent to choosing the cluster head, it influences utilization of minor measure of vitality of sensor to network and in addition enhances the lifetime of the network of sensor network. Aggregation of the data got from the cluster individuals is obligation of cluster head in the cluster. Confirmation of data is finished by the cluster head preceding the data aggregation if data got isn't legitimate at that point got data is disposed of. Just confirmed data is taken for aggregation at cluster head. Encryption is finished by making utilization of homomorphic encryption technique and additionally encoded data send to the cluster head and data decoding is performed by base station (BS) for offering end to end security. An ID based mark system is created for hop by hop authentication. In this paper, we show the technique for recuperating the data which is lost because of the cushion flood. In given system cache memory is given by the cluster head to recuperation of data misfortune. Finally test comes about shows relying upon parameter like time and additionally vitality utilization on Jung test system that system exhibited is great contrasted with the accessible system.

References

  1. K.A. Shim, C.M. Park, A secure data aggregation scheme based on appropriate cryptographic primitives in heterogeneous wireless sensor networks, IEEE Parallel Distrib. Syst. 26 (8) (2015) 2128–2139.
  2. O.R.M. Boudia, S.M. Senouci, M. Feham, A novel secure aggregation scheme for wireless sensor networks using stateful public key cryptography, Ad Hoc Netw. (2015).
  3. A. Boukerche, X. Cheng, J. Linus, A performance evaluation of a novel energyaware data-centric routing algorithm in wireless sensor networks, Wirel.Netw. 11 (5) (2005) 619–635.
  4. X. Fei, A. Boukerche, R. Yu, An efficient markov decision process based mobile data gathering protocol for wireless sensor networks, in: Wireless Communications and Networking Conference (WCNC), IEEE, 2011, pp. 1032–1037.
  5. D. Boneh and M. Franklin, “Identity-based encryption from the Weil pairing,” SIAM J. Comput., vol. 32, no. 3, pp. 586–615, 2003.
  6. A. Castelluccia, E. Mykletun, and G. Tsudik, “Efficient aggregation of encrypted data in wireless sensor network, MobiQuitous ’05,” pp. 1–9, 2005.
  7. C.-M. Chen, Y.-H.Lin, Y.-C.Lin, and H.-M. Sun, “RCDA: Recoverable concealed data aggregation for data integrity in wireless sensor networks,” IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 4, pp. 727–734, Apr. 2012.
  8. J. Domingo-Ferrer, “A provably secure additive and multiplicative privacy homomorphism,” in Proc. 5th Int. Conf. Inf. Security, 2002, pp. 471–483.
  9. J. Girao, D. Westhoff, and M. Schneider, “CDA: Concealed data aggregation for reverse multicast traffic wireless sensor networks,” in Proc. IEEE Int. Conf. Commun., 2005, pp. 3044–3049.
  10. E. Mykletun, J. Girao, and D. Westhoff, “Public key based cryptoschemes for data concealment in wireless sensor networks,” in Proc. IEEE Int. Conf. Commun., 2006, pp. 2288–2295.
  11. A. Shamir, “Identity-based cryptosystems and signature schemes,” in Proc. Int. Cryptol. Conf. Adv. Cryptol., 1984, pp. 47–53.
  12. S. Lindsey and C.S. Raghavendra, “PEGASIS:Power efficient gathering in sensor information system”, in Proc. of IEEE Aerospace conference, vol.3, March 2002, pp.1125-1130.
  13. A. Manjeshwar and D.P. Agrawal, “TEEN: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks”, Proceedings of the15th International Parallel & Distributed Processing Symposium, IEEE Computer Society, April 2000, pp. 2009-2015.
  14. A. Manjeshwar and D. P. Agarwal, “APTEEN: A hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks,” in Proceedings of the 2nd International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile computing, FL, USA, April 2002, pp.195–202.
  15. O. Younis and S. Fahmy, “HEED: A Hybrid, Energy- Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks”, IEEE Transactions on Mobile Computing, vol.3, no. 4, Oct 2004, pp.366-379.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2019-04-30

Issue

Volume 6, Issue 2, March-April-2019

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Bhagyashri Julme, Prof. Pragati Patil, " Data Aggregation Scheme for Energy Efficiency in Wireless Sensor Network, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 6, Issue 2, pp.504-510, March-April-2019.