An Updated Particle Gaggle Based Optimization Routing Algorithm for Wireless Sensor Networks
DOI:
https://doi.org/10.26438/ijcse/v6i2.7983Keywords:
Particle Gaggle Optimization, Routing, Lifetime, Wireless Sensor Network, Energy EfficiencyAbstract
The wireless sensor network is a largely growing research field in the recent world. This network has a vast area of implementation now and is gradually increasing day by day. The main use of the wireless sensor network technology is in the environment system, the object tracking system, sensing data from the location where human can’t reach etc. A sensor network is a combination of low-cost sensor devices with a limited range of data transmission and battery power. A sensor node is responsible to collect sensed data and send those data to the base station and the base station processes those data. Normally a sensor network requires a fixed amount of energy to collect a bit of data. The battery use of the sensor nodes depends on the data collected and transmitted to the base station and also the data transmission range. So, it is very difficult for a sensor network to send data directly to the base station as some sensor nodes may be placed at a long distance from the base station. Then to send data to the base station will finish all its power and the node will die soon. This is the reason the sensor nodes use the clustering technique where the nodes send data to its cluster head and the cluster head forwards data as a tree structure to the base station. This assures a better lifetime of the sensor devices. Some common well known lifetime optimization algorithms are- LEACH, LEACH-C, PEGASIS, GROUP, Ant Colony etc [1]. In this paper, we have proposed an Updated Particle Gaggle Optimization based Routing protocol (UPGOR) where energy efficiency of the sensor nodes is the major focus for the routing protocol and finding an optimized path for data forwarding to the base station and data processing through the base station.
References
N. Jamal, “Routing techniques in wireless sensor
networks a survey,” IEEE Wireless communication, Vol
(6), 2012
S. K. 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.
S. Okdem and D. Karaboga, Routing in Wireless Sensor Networks Using an Ant Colony Optimization (ACO) Router
Chip In Sensors”, 2009.
Z. Luo, L. Lu, J. Xie, J. He, “An ant colony
optimization-based trustful routing algorithm for wireless sensor networks,” in 2015 4th International Conference on Computer Science and Network Technology (ICCSNT), pp. 1128–1131, IEEE, dec 2015
R. Arya, S.C. Sharma, “Analysis and
optimization of energy of sensor node using ACO in
wireless sensor network,” Elsevier B.V, Vol. 45, pp. 681-
, 2015
W. B. Heinzelman, A. P. Chandrakasan, H. Balakrishnan,“An Application-Specific Protocol Architecture for Wireless Microsensor Networks”, IEEE Trans. Wirel. Commun. 2002, 1, 660–670.
S. Lindsey, C. S. Raghavendra, “PEGASIS: Power-Efficient Gathering in Sensor Information Systems”, In Proceedings of the Aerospace Conference, Big Sky, MT, March, 2002; pp. 1125–1130.
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
A. Chakraborthy, S. K. Mitra, M. K. Niskar, “A Genetic Algorithm Inspired routing Protocol for Wireless
sensor Network”, in International Journal of Computational Intelligence Theory and practice, Vol 6 No.1 June 2011
S. Mccanne, S. Floyd, and K. Fall, "Network Simulator 2 (NS-2) version 2.35," in http://www-nrg.ee.lbl.gov/ns/,
http://www.isi.edu/nsnam/ns (1998)
P. Rani, A. Gupta, Y. Singh, “Multiple Event Detection In Wireless Sensor Networks Using Compressed Sensing: Health Monitoring Perspective ”, in International Journal of Computer Science and Engineering, vol.6 , Issue.1 , pp.36-41, Jan-2018
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
