Efficient Data Aggregation for Enhanced Network Lifetime in Wireless Sensor Network

Authors

  • Arjulata Naukarkar  M. Tech Student, Department of Computer Science and Engineering, V. M. Institute of Engineering and Technology, Nagpur, Maharashtra, India
  • Prof. Gurudev Savarkar  Assistant Professor, Department of Computer Science and Engineering, V. M. Institute of Engineering and Technology, 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 acknowledge a crucial part in diminishing centrality utilize. Beginning late, explore has concentrated on secure data aggregation because of the open and upsetting condition passed on. The Homomorphic Encryption (HE) think up is by and large used to secure data gathering. Regardless, HE-based data aggregation outlines have the running with injuries: flexibility, unapproved aggregation, and obliged aggregation limits. To manage these issues, we propose a protected data aggregation plot by hardening homomorphic encryption advancement with a check design. To answer this issue we displayed a system tends to a method in that extraordinary cluster head is picked based on the parcel from the base station and remaining noteworthiness. Resulting to picking the cluster head, it impacts utilization of minor measure of centrality of sensor to sort out and what's more enhances the lifetime of the system of sensor orchestrate. Aggregation of the data got from the cluster individuals is duty of cluster head in the cluster. The cluster head going before the data aggregation if data got isn’t true blue by then got data is disposed of finishes confirmation of data. Asserted data is taken for aggregation at cluster head. Encryption is finished by making utilization of homomorphic encryption strategy and furthermore encoded data send to the cluster head and data unraveling is performed by base station (BS) for offering end to end security. An ID based stamp system is made for hop-by-hop authentication. In this paper, we exhibit the strategy for recuperating the data which is lost in light of the cushion surge. In given system the cluster head to recuperation of data incident give cache memory. Finally test works out as intended demonstrates relying on parameter like time and moreover vitality use on Jung test system that system indicated is mind blowing showed up distinctively in connection to the open 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. S. Banbyopadhyay and E.J. Coyle, “An energy efficient hierarchical clustering algorithm for wireless sensor networks”, Twenty-Second Annual Joint Conference of the IEEE Computer and Communications IEEE Societies (INFOCOM 2003), vol.3, April 2003, pp.1713-1723.
  16. 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.
  17. S. Soro and W.B. Heinzelman, “Prolonging the lifetime of wireless sensor networks via unequal clustering,” in Proceedings of 19th IEEE International Parallel and Distributed Processing Symposium, April 2005.
  18. A. Karlof and D. Wagner, “Secure routing in wireless sensor networks: Attacks and countermeasures,” Ad Hoc Networks, vol. 1, pp. 293–315, 2003.
  19. X. Liu, “Survey on clustering routing protocols in wireless sensor networks,” Sensors, vol. 12, pp. 11113–11153, 2012.
  20. Y.H. Lin, S.Y. Chang, H.M. Sun, CDAMA: Concealed Data Aggregation Scheme for Multiple Applications in Wireless Sensor Networks, IEEE Trans. Knowledge Data Engg. 25 (7) (2013) 1471–1483.

Try to solve the new Formula Cube! It works exactly like a Rubik's Cube but it is only $2, from China. Learn to solve it with the tutorial on rubiksplace.com or use the solver to calculate the solution in a few steps.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2018-04-30

Issue

Volume 4, Issue 2, March-April-2018

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

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

How to Cite

[1]
Arjulata Naukarkar, Prof. Gurudev Savarkar, " Efficient Data Aggregation for Enhanced Network Lifetime in Wireless Sensor Network, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.345-351, March-April-2018.