An Energy Efficient Clustering Algorithm for Network Lifetime in Wireless Sensor Network

Authors

  • Madhuri N. Khuspare  Department of Electronics Engineering, Priyadarshini College of Engineering, Nagpur, Maharashtra, India
  • Dr. Awani S. Khobragade  Department of Electronics Engineering, Priyadarshini College of Engineering, Nagpur, Maharashtra, India

DOI:

https://doi.org//10.32628/IJSRSET2183181

Keywords:

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

Abstract

In wireless sensor networks, information aggregation accept a fundamental part in lessening essentialness use. Starting late, investigate has focused on secure information aggregation due to the open and disagreeable condition passed on. The Homomorphic Encryption (HE) contrive is generally used to secure information grouping. In any case, HE-based information aggregation designs have the going with disservices: adaptability, unapproved aggregation, and obliged aggregation limits. To deal with these issues, we propose a safe information aggregation plot by solidifying homomorphic encryption development with a check plan. To answer this issue we exhibited a system addresses a procedure in that intense cluster head is picked based on the partition from the base station and remaining imperativeness. Consequent to picking the cluster head, it impacts use of minor measure of essentialness of sensor to organize and what's more improves the lifetime of the system of sensor arrange. Aggregation of the information got from the cluster people is commitment of cluster head in the cluster. Affirmation of information is done by the cluster head going before the information aggregation if information got isn't honest to goodness by then got information is discarded. Simply affirmed information is taken for aggregation at cluster head. Encryption is done by making use of homomorphic encryption procedure and also encoded information send to the cluster head and information disentangling 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 demonstrate the method for recovering the information which is lost in light of the pad surge. In given system cache memory is given by the cluster head to recovery of information mishap. At long last test comes to fruition indicates depending upon parameter like time and furthermore essentialness usage on Jung test system that system showed is incredible appeared differently in relation 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.
  13. 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. 
  14. 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.
  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. 
  16. 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.
  17. A. Karlof and D. Wagner, “Secure routing in wireless sensor networks: Attacks and countermeasures,” Ad Hoc Networks, vol. 1,pp. 293–315, 2003.
  18. X. Liu, “Survey on clustering routing protocols in wireless sensor networks,” Sensors, vol. 12, pp. 11113–11153, 2012.
  19. 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 Engrg. 25 (7) (2013) 1471–1483.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2021-06-30

Issue

Volume 8, Issue 3, May-June-2021

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]
Madhuri N. Khuspare, Dr. Awani S. Khobragade, " An Energy Efficient Clustering Algorithm for Network Lifetime in Wireless Sensor Network, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 8, Issue 3, pp.426-434, May-June-2021. Available at doi : https://doi.org/10.32628/IJSRSET2183181