Abstract
The rapid growth in wireless technology is enabling a variety of advances in wireless sensor networks (WSNs). By providing the sensing capabilities and efficient wireless communication, WSNs are becoming important factor in day to day life. WSNs have many commercial, industrial and telecommunication applications. Maximizing network lifespan is a primary objective in wireless sensor networks as the sensor nodes are powered by a non-rechargeable battery. The main challenges in wireless sensor networks (WSNs) are area of coverage, network’s lifetime and aggregating. Balanced node establishment (clustering) is the foremost strategy for extending the entire network's lifetime by aggregating the sensed information at the head of the cluster. The recent research trend suggests Meta-heuristic algorithms for the intelligent selection of ideal Cluster Heads (CHs). The existing Cluster Head Selection (CHS) algorithm suffers from the inconsistent trade-offs between exploration – exploitation and global best examine constraints. In this research, a novel Camel series Elephant Herding Optimization (CSEHO) algorithm is proposed to enhance the random occurrences of Camel algorithm by the Elephant Herding Optimization algorithm for optimal CHS. The Camel algorithm imitates the itinerant actions of a camel in the desert for the scavenging procedure. The visibility monitoring condition of the camel algorithm improves the efficiency of exploitation, whereas the exploration inefficiency of a Camel algorithm is compensated optimally by the Elephant Herding Optimization operator (Clan and separator). The superior performance of the proposed CSEHO algorithm is validated by comparing its performance with various other existing CHS algorithms. The overall attainment of the offered CSEHO algorithm is 21.01%, 31.21%, 44.08%, 67.51%, and 85.66%, better than that of EHO, CA, PSO, LEACH, and DT, respectively.
Highlights
A sensor network incorporates multiple minimal prices and low-battery sensor nodes
The first node in the wireless sensor networks (WSNs) for the proposed HCSEHO is alive till the round number 2038, whereas, for the algorithms: Camel, Elephant Herding Optimization (EHO), PSO, LEACH, and DT, the nodes die at 1298, 1602, 1201, 270, and 44, respectively
The lifetime of the nodes for the proposed HCSEHO is 31.21% more than the Camel algorithm, 21.01% more than the EHO algorithm, 44.08% more than the PSO algorithm, 67.51% more than the LEACH protocol, and 85.66% more than the DT
Summary
A sensor network incorporates multiple minimal prices and low-battery sensor nodes. Every sensor nodes are situated in a specific zone and typically install a remote system by the method of self-sorting out. The sensor nodes can investigate typically at some of the extraordinary and critical circumscribe that individuals cannot handle [1]. The fundamental concept of clustering is to boundaries around the nodes of the active sensor into separate groups and chooses leaders for all groups. The groups are known as clusters while group leaders are known as Cluster Heads (CHs) of the groups to perform data communication [2]. In such condition, electing the CH under several constraints such as less amount of energy consumption, distance, delay and so on is the vital character of every clustering algorithm. The responsibility of the CH is that it should organize each and every node existing in the cluster
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
