Optimal Cluster Head Selection in Wireless Sensor Network via Multi-constraint Basis using Hybrid Optimization Algorithm: NMJSOA

Abstract

Due to its general use in various practical applications, number of innovations in Wireless Sensor Networks (WSN) is receiving a lot of consideration from researchers. It shows significant technological development with excessive capacity since it gives useful information to users in a particular field through real-time monitoring. Due to its characteristics, such as infrastructure-less adoption and resource limitations, wireless sensor networks bring several problems that could impair the system's operation. Cluster based routing in WSN is the major concern in this field that could conflicts with the effectiveness of energy, suitable Cluster Head (CH) selection, protected data transport as well as network lifetime augmentation, demand major consideration, etc. However, it remains challenging to make optimal clustering process of WSN that makes the routing process more effective. Thereby, this work proposes a new Namib Merged Jelly Search Optimization Algorithm (NMJSOA) approach for the optimal CH selection in WSN by the different constraints. Initially, the sensor nodes are grouped together to form the clusters by the k-means clustering techniques. Subsequently, allocating the CH for each cluster by computing the weight function for each cluster depends on the conditions such as energy, delay, distance and security. According to the NMJSOA method, the Namib Beetle Optimization (NBO) searching position and the Jellyfish swam old position are added together to get the best optimum position. Finally, the performance of the suggested model is investigated over the conventional methods in terms of different performance measures.