Clustering by Improved PSO based Jaya Algorithm for Energy Optimization of Wireless Sensor Networks

In recent years, industries have automated processes which mean the amount of human participation has decreased, resulting in the Fourth Industrial Revolution. A highly distributed self-organizing system known as a Wireless Sensor Networks is employed in so many control systems such as monitoring th...

Full description

Saved in:
Bibliographic Details
Published in2023 Fifth International Conference on Electrical, Computer and Communication Technologies (ICECCT) pp. 1 - 6
Main Authors Malarvizhi, P., Kavithaa, G.
Format Conference Proceeding
LanguageEnglish
Published IEEE 22.02.2023
Subjects
clustering
Clustering algorithms
Energy optimization
Event detection
Fourth Industrial Revolution
Industries
jaya optimization algorithm
particle swarm optimization
Power demand
Quality of service
Security
wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:In recent years, industries have automated processes which mean the amount of human participation has decreased, resulting in the Fourth Industrial Revolution. A highly distributed self-organizing system known as a Wireless Sensor Networks is employed in so many control systems such as monitoring the surroundings, automate the reporting, and detecting the event. High bandwidth needs, high power consumption, security and quality of service delivery are some of the obstacles that wireless sensor networks must overcome. Each sensor node in a wireless sensor networks has a different power consumption rate based on the non-uniformity of event detection and the interspace between the sink node and sensor node. This shortens the lifespan of the network and causes an energy difference between the sensor nodes. Particle Swarm Optimization based Jaya algorithm (PSO-J) has been experimented to lower the power consumption of the sensor node by improving the selection of cluster head. The proposed algorithm provides better results than existing clustering algorithms.
DOI:10.1109/ICECCT56650.2023.10179659