Call for Paper

CAE solicits original research papers for the October 2021 Edition. Last date of manuscript submission is September 30, 2021.

Read More

Investigating Optimization Techniques for Cluster Head Election in WSN

Amanjot Kaur, Gaurav Mehta. Published in Information Sciences.

Communications on Applied Electronics
Year of Publication: 2016
Publisher: Foundation of Computer Science (FCS), NY, USA
Authors: Amanjot Kaur, Gaurav Mehta
10.5120/cae2016652226

Amanjot Kaur and Gaurav Mehta. Investigating Optimization Techniques for Cluster Head Election in WSN. Communications on Applied Electronics 5(2):28-37, May 2016. BibTeX

@article{10.5120/cae2016652226,
	author = {Amanjot Kaur and Gaurav Mehta},
	title = {Investigating Optimization Techniques for Cluster Head Election in WSN},
	journal = {Communications on Applied Electronics},
	issue_date = {May 2016},
	volume = {5},
	number = {2},
	month = {May},
	year = {2016},
	issn = {2394-4714},
	pages = {28-37},
	numpages = {10},
	url = {http://www.caeaccess.org/archives/volume5/number2/599-2016652226},
	doi = {10.5120/cae2016652226},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

Wireless sensor network (WSN) is a briskly augmenting high-tech platform with remarkable and neoteric applications. Many new protocols specifically designed for the requirement of energy awareness are provided as per consequence of newfangled advances in WSN. In Actu, optimization of the network operation is vital to prolong network’s lifetime. For energy-efficiency in WSNs, one of the most accepted solutions is to cluster the networks. The regular nodes sensing the field and sending their data to the cluster-head, and then, transmitting to the base station is a process usually followed in a typical clustered WSN. Furthermore, cluster formation done inaptly, can make some CHs burdened with high number of sensor nodes. This overwork may lead to abrupt death of the CHs thereby deteriorating the overall performance of the WSN. Network Lifetime can be increased by preventing faster death of the highly loaded CHs. Three evolutionary algorithms namely Flower Pollination Algorithm (FPA), Harmony Search Algorithm (HSA) and Particle Swarm Optimization (PSO) with appropriate fitness functions are compared with the intrinsic properties of clustering in mind. The main idea is the embodiment of criteria of compactness (i.e. cohesion) and separation error in the fitness function to direct the search into promising solutions. The property of heterogeneity of nodes, in terms of their energy; in hierarchically clustered wireless sensor networks has also been involved. Simulation over 20 random heterogeneous WSNs shows that our FPA always prolongs the network lifetime, sustain more energy in comparison to the results obtained using the PSO and HSA protocols.

References

  1. W.Heinzelman, A.Chandrakasan, H.Balakrishnan, Energy-efficient communication protocol for wireless microsensor networks, in Proceedings of the 33rd International Conference on System Science(ICSS’00),Hawaii, U.S.A. ,pp 1-10, 2000
  2. M.A.Adnan, M.A.Razzaque, I.Ahmed and I.F.Isnin, Bio-Mimic Optimization Strategies in Wireless Sensor Networks: A Survey, Sensors 2014,Vol 14, pp.299-345,2014
  3. PratyayKuila, Prasanta K. Jana, A novel differential evolution based clustering algorithm for wireless sensor networks, Applied Soft Computing 25 (2014) 414–425
  4. Gupta, S.K., Kuila, P., Jana, P.K, GAR: an energy efficient GA-based routing for wireless sensor networks, In: ICDCIT 2013, LNCS 7753, 267–277, 2013.
  5. Saleem, M., et al.. Swarm intelligence based routing protocol for wireless sensor networks: survey and future directions. Inf. Sci, 181, 4597-4624, 2011.
  6. Kulkarni,R.V., Particle swarm optimization in wireless-sensor networks: a brief survey. IEEE Trans. Syst., Man, Cybern.–Part C: Appl. Rev.41, 262-267,2011
  7. Zungeru, A.M., Classical and swarm intelligence based routing protocols for wireless sensor networks: a survey and comparison. J. Netw. Comput. Appl, 35, 1508–1536, 2012.
  8. Kuila, P., Gupta, S.K., Jana, P.K, A novel evolutionary approach for load balanced clustering problem for wireless sensor networks”, Swarm Evol. Comput. 12, 48–56,2013
  9. Xin-She Yanga, Mehmet Karamanoglua, Xingshi He, Multi-objective Flower Algorithm for Optimization, International Conference on Computational Science, ICCS 2013, Procedia Computer Science 18 ( 2013 ) 861 – 868
  10. P. Kuila, P.K. Jana, Energy efficient clustering and routing algorithms for wireless sensor networks: Particle swarm optimization approach, Engineering Applications of Artificial Intelligence, Vol 33, pp.127-140,2014.
  11. D.C. Hoang,P. Yadav,R. Kumar, and S.K. Panda, Real Time Implementation of a Harmony Search Algorithm based Clustering Protocol for Energy Efficient Wireless Sensor Networks, IEEE transactions on industrial informatics, Vol 10, pp. 774-783,2014.
  12. A. Immanuel Selvakumar and K. Thanushkodi , A new particle swarm optimization Solution to nonconvex economic dispatch problems, IEEE Trans. on power systems, Vol. 22, No. 1, pp. 42-51,2007.
  13. Z. W. Geem, J. H. Kim, and G. V. Loganathan, A new heuristic optimization algorithm: harmony search, Simulation, vol. 76, no. 2, pp. 60-68, 2001.
  14. G. Smaragdakis, I. Matta, A. Bestavros, SEP: a stable election protocol for clustered heterogeneous wireless sensor networks, in: Second International Workshop on Sensor and Actor Network Protocols and Applications (SANPA 2004), Boston, MA, 2004.
  15. Bara’a A. Attea, Enan A. Khalil, A new evolutionary based routing protocol for clustered heterogeneous wireless sensor networks, Applied Soft Computing 12 (2012) 1950–1957

Keywords

Flower Pollination Algorithm (FPA), Harmony Search Algorithm (HSA), Particle Swarm Optimization (PSO), Cohesion, Separation, Fitness Function.