Design of Evolutionary Algorithm Based Unequal Clustering for Energy Aware Wireless Sensor Networks

Wireless Sensor Networks (WSN) play a vital role in several real-time applications ranging from military to civilian. Despite the benefits of WSN, energy efficiency becomes a major part of the challenging issue in WSN, which necessitate proper load balancing amongst the clusters and serves a wider monitoring region. The clustering technique for WSN has several benefits: lower delay, higher energy efficiency, and collision avoidance. But clustering protocol has several challenges. In a large-scale network, cluster-based protocols mainly adapt multi-hop routing to save energy, leading to hot spot problems. A hot spot problem becomes a problem where a cluster node nearer to the base station (BS) tends to drain the energy much quicker than other nodes because of the need to implement more transmission. This article introduces a Jumping Spider Optimization Based Unequal Clustering Protocol for Mitigating Hotspot Problems (JSOUCP-MHP) in WSN. The JSO algorithm is stimulated by the characteristics of spiders naturally and mathematically modelled the hunting mechanism such as search, persecution, and jumping skills to attack prey. The presented JSOUCPMHP technique mainly resolves the hot spot issue for maximizing the network lifespan. The JSOUCP-MHP technique elects a proper set of cluster heads (CHs) using average residual energy (RE) to attain this. In addition, the JSOUCP-MHP technique determines the cluster sizes based on two measures, i.e., RE and distance to BS (DBS), showing the novelty of the work. The proposed JSOUCP-MHP technique is examined under several experiments to ensure its supremacy. The comparison study shows the significance of the JSOUCPMHP technique over other models. This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. DOI: 10.32604/csse.2023.035786 Article ech T Press Science


Introduction
Wireless Sensor Networks (WSNs) are advanced for monitoring and sensing vital signs of area and environment using linked and distributed sensor nodes (SNs). The SNs were divided into Gateway Nodes (GN), normal, and sink nodes [1]. The SNs were small in size and had insufficient sources concerning processing, storage, and space energy [2]. In many cases, the SNs were deployed in a very harsh and intense ecosystem. The first and foremost goal of this positioning was to sense information distantly and sends it to the system or user for decision-making. To send data, there comes a demand for more effective systems for managing the energy system of nodes and enhancing network lifetime [3]. The SNs perceive and sense the data from nearby environments, make processes, and transmit it to the nearby nodes until data arrives at the base station (BS). In WSN, because of the restricted energy sources of SNs, there comes a crucial need for a well-effective and balanced data aggregation system and energyefficient routing protocol [4]. The energy feature becomes one factor to consider for devising any solution for WSNs. Numerous routing protocols were devised to conserve the energy of SNs [5]. The clustering approach becomes an effective topological control system that could efficiently enhance the scalability duration and lifetime of WSNs. The WSN applications have achieved popularity, including health monitoring, target tracking, disaster response, environmental monitoring, and security [6].
In a clustering ecosystem, data can be involved from one node to another and occurs energy holes or hotspot difficulties [7]. A hotspot can be made by SNs positioned nearby the BS and rapidly drain energy because traffic arises from other nodes and is sent from it. Such SNs not just transmit their data but also send it from other bases because the initial death of nodes causes hotspot problems. The methods, namely unequal clustering methods and mobile sinks or mobile data mules, were majorly utilized to resolve this problem [8]. But many unequal clustering techniques were devised for the solution of the hotspot leverages cluster, which is smaller in size adjacent to BS and cluster size rose case when we were going far away from BS. The cluster size was inversely proportional to the distance from BS. The clusters adjacent to BS hold a greater quantity of nodes that is helpful in efficient load sharing [9]. The projected method for size allotment and size difference of clusters leads to a reduction of frequency where a specific node turns out to be a cluster head (CH) [10]. This aids in the maintenance of the overall connectivity and thwarts network isolation. In line with this, hot spot issues can be reduced. One of the problems concerning unequal clustering was cluster size decreasing or increasing ratio that was not conferred in prevailing methods.
This article introduces a Jumping Spider Optimization Based Unequal Clustering Protocol for Mitigating Hotspot Problems (JSOUCP-MHP) in WSN. The JSO algorithm is stimulated by the characteristics of spiders in nature and mathematically modelled the hunting mechanism such as search, jumping skills, and persecution to attack prey. The presented JSOUCP-MHP technique mainly resolves the hot spot issue for maximizing the network lifespan. To attain this, the JSOUCP-MHP technique elects a proper set of cluster heads (CHs) using average RE. In addition, the JSOUCP-MHP technique determines the cluster sizes based on two measures i.e., RE and distance to BS (DBS). The proposed JSOUCP-MHP technique is examined under several experiments to ensure its supremacy.

Related Works
Arikumar et al. [11] modelled an Energy Efficient LifeTime Maximization (EELTM) technique that uses intelligent techniques of Fuzzy Inference System (FIS) and particle swarm optimization (PSO). In addition, an optimal CH-CR selecting method in this technique exploits fitness values (FV) computed by the PSO approach for determining 2 optimal nodes in every cluster to serve as Cluster Router (CR) and CH. The CH, which is selected, exclusively accumulates the data from its cluster members. However, the CR is accountable for receiving the data collected from its CH and sending it to BS. Mehra [12] formulated an enhanced fuzzy unequal clustering and routing protocol (E-FUCA) in which vital variables were regarded at the time of CH candidate selection, and non-CH nodes considered intellectual decisions utilizing FL at the time of the election of its CH for forming clusters. FL is utilized as the next-hop choice for effective routing to expand the lifespan. And carried out the simulation experimentations for 4 cases, and a comparison was made with the propound performance of protocol with recent similar protocols.
Wang et al. [13] introduced an energy-efficient unequal clustering routing algorithm (UCRA). At first, the monitoring region was separated by concentric circles as rings of various sizes. Then, the CH was selected relating to RE and position. Before clustering, every typical sensor links cluster related to the electability of every CH. Nguyen et al. [14] presented a new optimization technique, like the compact bat algorithm (cBA), for using it for optimisation issues involving gadgets containing inadequate hardware sources. A real-valued prototype vector can be employed for probabilistic functions for generating every candidate solution for optimizing cBA. The projected cBA was widely assessed on numerous continual multi-modal functions and the unequal clustering of WSN (uWSN) issues.
In [15], competitive swarm optimization (CSO) related methods were introduced, together called such methods as CSO-UCRA. Initially, the CH selecting approach relies on CSO related approach after assigning non-CH sensors to CHs. At last, a CSO-related routing method was provided. New fitness functions and efficient particle encoding techniques were advanced for such methods. Guleria et al. [16] devise the new ant colony meta-heuristic related to unequal clustering for novel CH election. The neighbor finding level and link maintenance by Meta-Heuristic Ant Colony Optimization (ACO) technique choose the optimal path among the nodes that raises the packets distributed to the destiny. Though several models are available in the literature review, still much work is needed to resolve the hot spot problem. In addition, unequal clustering should be performed by the use of multiple input parameters.

The Proposed Unequal Clustering Protocol
This article presented a novel JSOUCP-MHP algorithm for resolving hot spot issues in WSN. The JSO algorithm is stimulated by the characteristics of spiders in nature and mathematically modelled the hunting mechanism such as search, jumping skills, and persecution to attack prey. The presented JSOUCP-MHP technique mainly resolves the hot spot issue for maximizing network lifespan. Fig. 1 depicts the overall process of the JSOUCP-MHP approach.

System Model
A WSN comprises N uniform distribution sensors. There is one BS interconnected with users through the Internet. Let assume S ¼ S 1 ; S 2; ... ; s i ; s N À1 ; s N È É as the group of nodes, whereby s i denotes a nodei and S j j ¼ N . WNS makes use of wireless radio transceivers depending on the different variables, for example, energy utilization and distance. The distance between the receiver and transmitter, followed by attenuated transceiver power, exponentially reduced with increased distance. Now, we represent x i ; Áy i ð Þ and x j ; Áy j À Á were the coordinates of nodes i and j. Assume node i sent to destination node j, the energy consumed on communication over d distance can be evaluated as follows: In Eq. (1), E refers to the energy consumption; Tx is to transfer, elect, amp specifies electronic and amplify to modulate, digitalized coding, spreading, and filter signals. It illustrates that multi-hop transmission is highly efficient in WSN. d o denotes a threshold of space model, In Eq. (2), the power loss e fs =e mp are free space and multi-path model, and it is formulated by WSN considered N node in the region of 2D M 2 with k cluster. In relation to the hotspot, perplexity in WSN was balancing the load amongst CHs according to the clustering technique. Unequal clustering decreases the cluster size nearer to BS, and the size of the cluster rises as the distance between the BS ad well as CH rises. The cluster member senses the real-time parameter and transfers the sensed value to CH. CH aggregates and receives information to eliminate inessential information and transfer aggregated information to BS directly or through intermediatory CH. In equal clustering, the cluster size remains unchanged all over the network. But, in unequal clustering, the cluster size can be described according to the DBS [17]: Let N =k À 1 be the average of member nodes from the cluster, E CH , E members denotes dissipated energy for CH and member correspondingly, and it is evaluated by: As a result, the energy consumed for WSN from the generation formulated from the energy process and transceiver was given by: In Eq. (7), E p is the energy consumed for the microcontroller and source voltage of the node. It doesn't affect the optimization process. As a result, the consumed energy E frame optimizes according to the distance for clustering optimization.

Design of JSO Algorithm
The mathematical modelling of the jumping spider's hunting strategy is initially proposed. Then, The JSOA approach was introduced. The hunting strategies are searching, jumping on the prey, and attacking by persecution [18]. Also, the algorithm describes the pheromone rate of the spider as follows.
Once the spider is away from a distance, whereas it could catch the prey by jumping, it moves closer by indulging in certain stealthy movements till it is at an attainable distance where it can catch the prey and pounces on it. The persecution approach can be described as the uniform accelerated rectilinear motion.
In Eq. (8), x i demonstrates the location of the i th follower spider, t refers to the time, v 0 represents the speed initially. The acceleration can be shown as a In this study, to optimize, every iteration can be regarded as the duration, in which the differences between iterations are equivalent to 1, and initially, the speed is fixed as zero, v 0 ¼ 0. And it is formulated as follows: In Eq. (9), x i ! g þ 1 ð Þ represents the novel location of the search agent to generation g þ 1; x i ! g ð Þ indicates the present i-th searching agent in generation g, and x r ! g ð Þ ! denotes the r-th searching agent arbitrarily chosen, with i 6 ¼ r, whereas r represents an arbitrary value ranging from 1 to the size of maximal searching agent.
The jumping spider follows the prey and jumps on them. The hunting strategy of jumping on prey is characterized by a projectile motion.
Likewise, the vertical axis and the derivative w.r.t time can be given as.
Similarly, time is characterized by strategy 1. Thus we attain the trajectory equation as follows. y Lastly, the trajectory is formulated by: a ¼ φp 180 In Eq. (13), x i ! g þ 1 ð Þ refers to the novel location of a searching agent, representing jumping spider movement, x i ! g ð Þ denotes the existing i-th searching agent, V 0 is fixed as 100 mm/seg, g denotes the gravity ð9.80665 m=s 2 Þ, and the a angle can be measured by an φ angle arbitrarily produced within zero and one.
The Jumping spider implements a random search around the environment to locate prey. Local and global search are the two mathematical functions presented as follows.
The local search can be defined as follows: In Eq. (14), Þrefers to the novel location of the searching agent, x ! best g ð Þ denotes the optimal searching agent found from the preceding iteration, the walk was a normally distributed pseudo-random integer within À2; 2 ð Þ, e denotes a pseudo-random number uniformly distributing from 0; 1 ð Þ.
At the same time, the Global search can be expressed as follows.
In Eq. (15), Þdenotes the novel location of a searching agent, x best ! g ð Þ and x worst ! g ð Þ indicates the best and worst searching agent form preceding iteration; correspondingly, and k refers to a Cauchy random integer with l fixed as 0 and h fixed as 1.
Pheromone is released by several animals, amongst which were insects, together with spiders. Nonetheless, they produce pheromones; the modelling of the rate of pheromones was taken and described as follows: In Eq. (16), Fitness max and Fitness min represent the worst and the best FV in the present generation, correspondingly, while Fitness(i) refers to the present FV of the i-th searching agent. Eq. (16) normalizes the FV within zero and one whereas 0 indicates the worst pheromone rate, while 1 denotes the optimal. The criteria involve for lower pheromone rate value equivalent to or lesser than 0.3 as follows: In Eq. (17), x i ! g ð Þ represent the searching agent (jumping spider) with a lower pheromone rate that is upgraded, r 1 and r 2 indicate arbitrary number produced from 1 to the maximal size of a searching agent, with r 1 6 ¼ r 2 , while x r 1 ! g ð Þ and x r 2 ! g ð Þ are the r 1 , r 2 th searching agent selected, x best ! g ð Þ indicates the best searching agent from preceding iteration and r indicates a binary number produced, r 2 0; 1 f g.

Process Involved in JSOUCP-MHP Technique
In the real-time application of WSN, a massive amount of nodes is positioned generally with a higher node density. Assume a proper threshold T for controlling the proportion of CH, T is fixed at 0.4. Every node S j evaluates the value of l. When l < T, node S j become a CCH; or else, node S j becomes a regular node and go to a dormant state until the last CH selection is accomplished as follows.
In Eq. (18), l 0 refers to a uniformly distributed arbitrary value within 0; 1 ½ , and E avg indicates the average RE of an alive node. The computation method was given in the following: The data packet transferred by the node includes RE i . Afterward, the BS received, the average RE E avg of each alive node is evaluated; RE i characterizes the RE of node S i . Clearly, the large of RE i , the small of l, hence the better possibility that S i becomes a CH.
In the JSOUCP-MHP technique, consider the distance from CH to BS and ignore the energy. This might leads to a lower energy node being the CH, and afterward generating a cluster, the member in the cluster causes an increase in the energy usage of CH. As a result, a competitive radius considering distance and energy is presented, and the competitive radius for CH v i is evaluated as follows.
In Eq. (5), d max and d min denotes the maximal and minimal distances from the alive node to the BS; correspondingly, d v i ; BS ð Þ represents the distance from v i to the BS; RE v i indicates the RE of v i ; w 1 and w 2 are constant within ½0; 1, and w 1 þ w 2 ¼ 1.

Conclusion
In this article, a novel JSOUCP-MHP system has been presented for resolving hot spot issues in WSN. The JSO algorithm is stimulated by the characteristics of spiders naturally and mathematically modelled the hunting mechanism such as jumping skills, persecution, and search, to attack prey. The presented JSOUCP-MHP technique mainly resolves the hot spot issue for maximizing the network lifetime. To attain this, the JSOUCP-MHP technique elects proper set of CHs using average RE. Also, the JSOUCP-MHP system determines the cluster sizes dependent upon two measures such as RE and DBS. The proposed JSOUCP-MHP technique is examined under several experiments to ensure its supremacy. The comparison study shows the significance of the JSOUCP-MHP technique over other models. In upcoming years, the performance of the JSOUCP-MHP system will be improved by data aggregation approaches. Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.