FOREX Press I. J. of Electrical & Electronics Research
Support Open Access
  • Home/
  • IJEER-040308

Research Article |

Energy Efficient Cluster-Based Routing Protocol in Wireless Sensor Network using Flower Pollination Algorithm

Author(s): Deepika Rana* and Mamta Arora

Published In : International Journal of Electrical and Electronics Research (IJEER)        Volume 4, issue 3

Publisher : FOREX Publication

Published : 30 september 2016

e-ISSN : 2347-470X

Page(s) : 102-109

DOI: https://doi.org/10.37391/IJEER.040308

Abstract

Main ambition of wireless sensor networks (WSN) is to exploit network lifetime and stability periods. Flower Pollination Algorithm (FPA) is uses to elect the cluster head (CH) in set up phase of WSN such that the intra cluster average distance between the member nodes and their respective CHs is minimized and the sum of ratio of residual energy of alive nodes in cluster or energy level of CH is also minimized via maximized. In the research, a Flower Pollination Algorithm based Energy Efficient Routing Protocol (EERPFPA) has been proposed to apply FPA the problem of electing the CH in the cluster set-up phase based on minimizing the intra cluster average distance between the member nodes and their CHs and minimizing the sum of ratio of remaining power/energy of active sensor nodes in cluster to energy/power intensity of CH. It efficiently maximizes the network life time and improves the stability period. In this paper, the simulation results are showed by using MATLAB. The results showed that the proposed algorithm is more energy efficient and more reliable in clustering process as compared to WSN with Harmony search algorithm (HSA) for heterogeneous networks.

Keywords: Energy Efficient Routing Protocol on Flower Pollination Algorithm (EERPFPA), Wireless Sensor Networks (WSN) Cluster Head (CH), Harmony search algorithm (HSA), Flower Pollination Algorithm (FPA).




Deepika Rana*, PG Student ECE Department Chandigarh University Gharuan Punjab, India; Email: deepikarana138@gmail.com

Mamta Arora, Assistant Professor, ECE Department Chandigarh University Gharuan Punjab, India; Email: mamta_arora30@yahoo.com

    [1] Rabiner,W.; Kulik, J.; Balakrishnan, H. “Adaptive Protocols for Information Dissemination in Wireless Sensor Networks”. In Proceedings of the Fifth Annual International Conference on Mobile Computing and Networking (MOBICOM), Seattle, WA, USA, August, 1999; pp. 174–185.
    [2] Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan. “Energy-Efficient Communication Protocol forWireless Microsensor Networks” Proceedings of the 33rd Hawaii International Conference on System Sciences Massachusetts Institute of Technology Cambridge, MA 02139 2000 IEEE.
    [3] Heinzelman, W.B.; Chandrakasan, A.P.; Balakrishnan, H. “An Application-Specific Protocol Architecture for Wireless Microsensor Networks.” IEEE Trans. Wirel. Commun. 2002, 1, 660–670. Konstantin Kalpak, Koustuv Dasgupta, Parag Namioshi,” Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.” The International Journal of Computer and Telecommunications Networking, Volume 42 Issue 6, 21 August 2003.
    [4] Ye Ming Lu,Vincent W. S. Wong,” An energy-efficient multipath routing protocol for wireless sensor networks.” International Journal of Communication Systems. 14 September 2006.
    [5] Sajid Hussain, Abdul Wasey Matin, Obidul Islam,” Genetic Algorithm for Hierarchical Wireless Sensor Networks. Journal of Networks, VOL. 2, NO. 5, SEPTEMBER 2007.
    [6] Selcuk Okdem and Dervis Karaboga: “Routing in Wireless Sensor Networks Using an Ant Colony Optimization (ACO) Router Chip”:In Sensors 2009.
    [7] Shio Kumar Singh, M P Singh, and D K Singh: “Energy Efficient Homogenous Clustering Algorithm for Wireless Sensor Networks”: International Journal of Wireless & Mobile Networks (IJWMN), Vol.2, No.3, August 2010.
    [8] Y. Zhang, L. D. Kuhn, and M. P. J. Fromherz, "Improvements on Ant Routing for Sensor Networks," M. Dorigo et al. (Eds.): ANTS 2004, Springer-Verlag Berlin Heidelberg 2004, vol. LNCS 3172, pp. 154-165, 2004.
    [9] Lindsey, S.; Raghavendra, C.S. PEGASIS: “Power-Efficient Gathering in Sensor Information Systems”. In Proceedings of the Aerospace Conference, Big Sky, MT, March, 2002; pp. 1125 1130.
    [10] Ayon Chakraborthy,Swarup kumar Mitra,Mrinal Kanti Niskar: “A Genetic Algorithm Inspired routingProtocol for Wireless sensor Network”: in International Journal of Computational IntelligenceTheory and practice,Vol 6No.1 June 2011.
    [11] Bara’a A. Attea*, Enan A. Khalil.” A new evolutionary based routing protocol for clustered heterogeneous wireless sensor networks.” Department of Computer Science, Baghdad University, Iraq 2011 Elsevier.
    [12] Sourabh Jain, Praveen Kaushik, Jyoti Singhai,” Energy Efficient Maximum Lifetime Routing for Wireless Sensor Network.” International Journal of Advanced Smart Sensor Network Systems (IJASSN), Vol 2, No.1, January 2012.
    [13] Xin-She Yang, Mehmet Karamanoglu, Xingshi He.” Multi- objective Flower Algorithm for Optimization” International Conference on Computational Science, ICCS 2013, 2013 Elsevier.
    [14] Neha Mehndiratta, Manju, Harish Bedi.” Design Issues for Routing Protocols in WSNs Based on Classification.” International Journal of Application or Innovation in Engineering & Management (IJAIEM) Volume 2, Issue 3, March 2013.
    [15] Georgios Smaragdakis, Ibrahim Matta, Azer Bestavros, “SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks.”
    [16] 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 Netwroks”, IEEE transactions on industrial informatics, Vol. 10, No. 1, February 2014, pp. 774-783.
    [17] Glover, B.J., (2007). Understanding Flowers and Flowering: An Integrated Approach, Oxford University Press, Oxford, UK.

Deepika Rana and Mamta Arora (2016), Energy Efficient Cluster-Based Routing Protocol in Wireless Sensor Network using Flower Pollination Algorithm . IJEER 4(3), 102-109. DOI: 10.37391/IJEER.040308.