Energy Efficient Clustering Protocol to Enhance Network Lifetime in Wireless Sensor Networks

: In this paper, the energy conservation in the ununiform clustered network field is proposed. The fundamental reason behind the methodology is that in the process of CH election, nodes Competition Radius (CR) task is based on not just the space between nodes and their Residual Energy (RE), which is utilized in Energy-Aware Distributed Unequal Clustering (EADUC) protocol but also a third-degree factor, i.e., the nearby multi-hop node count. In contrast, a third-factor nearby nodes count is also used. This surrounding data is taken into account in the clustering feature to increase the network’s life span. The proposed method, known as Energy Conscious Scattered Asymmetric Clustering (ECSAC), self-controls the nodes’ energy utilization for equal allotment and un-equal delivery. Besides, extra attention is agreed to energy consumption in the communication process by applying a timeslot-based backtracking algorithm for increasing the network’s lifetime. The proposed methodology reduces the clustering overhead and node communication energy consumption to extend the network’s lifetime. Our suggested method’s results are investigated against the classical techniques using the lifetime of the network, RE, alive hop count and energy consumption during transmission as the performance metric.

The Multi-Hop (MH) communication works well in handling the downfalls in signal propagation because the radio loses energy not just while transmitting but also while receiving messages; transmitting straight away is even helpful. Yet, the occurrence of restriction is present here. It is fair to utilize it up to some distance only [16,17]. Because of the reason being, when it comes to the extent of transmitting above the saturation point, the usage of energy raises based on the 4th power of the distance [8]. Hence, to increase the network's expansion, MH communication is most sought over [18,19]. When it comes to communication from the CH node to the BS and if BS is at a distance from the sensor field, it is improved by utilizing MH neighbourhood node communication. A CH is severely overloaded with clustering protocol because it has to do different work like forming clusters, aggregating information, transmitting information and relaying. CHs, hence use more energy than other non-CH nodes. While sending inter-clusters for the two modes of communication viz., SH and MH, there is an unavoidable energy issue, not balancing amid SNs. For SH communication, CHs placed at a distance from BS use most of their energy primarily due to longer transmission.
Losing the sensing coverage and dividing the network happen, finally influencing the functioning of the network. In the literature [20], it has been shown that when sensors get arranged consistently in the area of concern, they leave around 90% of the sensors' total energy not used until the first Node is dead. The inevitability of the ununiform decrease in energy among the entire sensors in WSNs was confirmed in [21,22] as the many-to-one transmission model. To get a maximum lifetime of the network, energy consumption must be balanced amid all network nodes. Many research studies have been done to fix the unequal energy and simulate the energy deficit issue for clustered WSNs. Schemes like using node mobility, mobile sink, hierarchical deployment, non-uniform clustering, data compression, traffic aggregation, node distribution etc., were suggested to fix the energy deficit issue.
The surrounding information is taken into account as the clustering parameter to improve the network's life span. The proposed method, ECSAC, self-controls the energy usage by the nodes in the network for equal distribution and un-equal delivery. Besides, extra attention is given to energy consumption in the communication process by applying a timeslot-based backtracking algorithm for increasing the network's lifetime. Ultimately, the suggested algorithms minimize the transceiver's energy expenditure consumption by fixing the issues mentioned above. Our methodology reduces the clustering overhead and node communication consumption to extend the network's lifetime. The output of our suggested method is analyzed against the classical techniques under various performance metrics.

Literature Review
Zhu et al. [23] put forth a tree-cluster-based information collecting algorithm with a mobile sink. The tree is designed for every sensor node by considering the mean leftover energy, location concerning the sink, and nodes count in the location. Djenouri et al. [24] suggested a trustworthy estimator algorithm for enhancing the Packet Reception Ratio (PRR) of the link relaying Node vi to node vj. The PRR specifies the probable positive delivery over the link. Badia et al. [25] have chosen the joint link scheduling and routing algorithm for delivering the packets under the time limit with actual intrusions amid nodes. On the contrary, the genetic algorithm increases throughput, fine-tunes transmission power, channel assignment and route path selection in Jia et al. [26]. The algorithms, as mentioned earlier, are not taking into account the sensor node energy and the network lifetime enhancement.
A low-complexity distributed clustering scheme was proposed by [27] for Machine-to-Machine (M2M) interactions in Long Term Evolution (LTE) networks for increasing the battery life of nodes. The location of the BS is crucial in optimizing the network. Therefore, [28] analyzed the chances for several BSs and locations of BSs, which could increase the life of WSNs. Here, the sensor nodes probably minimize energy consumption. Likewise, low-complexity solutions for enhancing network performance are suggested by [29], taking into account the available information during routing, planning, and frequency band allotments link. The density of Node influences the shelf life of the network. A cross-layer mathematical model was created by [30] to find the best node density for maintaining correct energy usage for every bit transmission. Augmentation of network life is possible by saving the source node's position and ignoring the hot-spot Node. A routing algorithm created by [31] has various routes overlooking hot spot regions by attaining network life increment and generating repeated distracting routes in non-hotspot places with excess energy.
The Energy-Driven Unequal Clustering protocol (EDUC) methods [32] for a scattered nonuniform Clustering Algorithm (CA) and a dynamic adaptive CH alternation technique. Here, CH alternation's energy utilization is reduced by permitting a node to be CH once in the network's lifetime. Therefore, when the energy spent in CH alternation is minimized, energy efficacy is attained. Nevertheless, there is a restriction here, which is beneficial for SH networks only. In the technique named Unequally Clustered Multi-hop Routing protocol (UCMR) proposed by [33], every cluster comes in various dimensions according to the radii and Dijkstra's shortest path algorithm that aides in the communication of within and outside the cluster. UCMR is quite different from others as it depends on accurate place information. The disparity in energy issues through energy-and proximity-based unequal CA (EPUC) is discussed in [34]. Excess energy and closeness to BS determine the selection of CHs. Attention is more on the zone close to BS to tackle the disparity in energy as the region requires more energy due to relaying activity.
HEED and EEDC, a couple of energy-efficient distributed CAs, were put forth in [35] and [36]. In this algorithm, sensor nodes are chosen as CHs. Yet, both of them do not consider the "energy hole" issue. As a solution to this issue, Soro et al. [37] suggested an unequal CA where the network zone is separated into cirques. Clusters in one cirque have similar dimensions, whereas unlike clusters in several cirques have, unlike aspects. High energy nodes usage for handling the CH role, thereby controlling the process of network, assures that the energy consumption of these CHs is controlled. This, in turn, enhances the lifetime of the network. Nevertheless, this requires specific high-energy nodes as CHs he placement of CHs is to be ascertained in advance. EEUC [38] is yet another distributed unequal CA. It chooses CHs according to the Node's unwanted energy. There is a possibility for every Node to develop into a CH with a probability T. These probable CHs utilize uneven competition ranges for building unequal dimensions. Distance from the BS determines the cluster size. Closer is smaller than the ones at a distance. This results in the energy-saving by the CHs, which is closer to BS for the data communication between clusters. This leads to the balancing of energy consumption amid CHs. T affects the efficiency of collected CHs; hence, the presence of "isolate points" in EEUC. [39] proposed Enhanced Hybrid Multipath Routing (EHMR) to ensure energy efficiency and enhance fast failure recovery. Reliability is ensured in terms of maximum data rate and the minimum end-to-end delay.

Network Model
The network used in this model has 'N d ' no. of SNs arranged haphazardly in an S × S sensor field. Once the arrangement is made, the nodes and the stations turn immobile-the Node's different energy ranges, i.e., the nodes used with various primary energy. The BS is placed at a distance from the sensor field, and its position is taken to aware of every Node. The nodes use power regulation for adjusting the power required for transmitting based on the distance. The views are not known to the nodes, but the nodes capable of calculating the space between two nodes are formed on the signal's strength; the links are considered symmetric. The CHs are capable of transmitting their information straight away to the BS. The data (D Msg ) and control (C Msg ) are sent via wireless links.
Moreover, we presume that the information detected by the nodes is strongly related. Once the cluster has been formed, DG gives the election of Cluster Head in WSN = (S n , E d ). Here, Sn means that 'N' wireless SNs are along with the CH. Not including the Node acting as sink S ns ., every SN Sni regularly produces size k. In Ed, (S ni, S nj ) is the pair of guided edges, where S ni ,S nj as the child and the parent node. The edge's direction S ni →S nj indicates that in which way the information is being forwarded. The edges represent the information that performs the transmission of a spanning tree with the Sink Node (SN) as an origin. It assumes that backing of various radio frequencies for simultaneous interactions sans intrusion is performed by manufacturing, technical, health care band, etc. Allotting RF channels for a bunch of synchronous communications is NP-Hard. Therefore, the suggested method presumes that the network is present with the highest S RF channels. The following Fig. 1 indicates a routing graph of an SN with 25 SNs.

Energy Model
The transmitter used energy to run and transmit the radio electronics circuit, but the energy of the recipient was in the component of the radio electronics alone. Furthermore, the free space φ fs and the multipath fading φ mp model channels are used depending on the propagation's significant degree. The open space model is used or the multi-route model used if the travel time is less than the limit. The transmitter spends energy based on Eq. (1) during transmission of the n-bit data to the range k.
The transmitter then spends energy for receiving n-bit of data based on the following Eq. (2)

Time Slot Information
In this suggested methodology, the TDMA method categories into a group of small timeslots of uniform distance end to end. Every cluster node is allotted a timeslot that regularly forwards a combined data packet to the CH in the allocated time.
As per Fig. 2, the same timeslot is employed for the forwarding node for the T rx process when utilized for the Rex functioning in the respective gathering (parent) Node. With a channel alteration time, the timeslot starts, and for forwarding, it is kept as the minimum time to swap the channel to a different channel assigned. Meantime, a device cannot transmit or receive any packet. Apart from this, T rx operation consists of synchronization margin time (Sync), Carrier Sensing Time (CST), T rx data interval (the time needed for the huge data packet to be received), and R x Ack interval (requirement of time for obtaining back from the parent, an acceptance packet).

Data-Appending Forwarding
Researchers have detailed the accumulation methodologies for a couple of strong cases of compressing without the information (raw-data forwarding) in addition to compressing complete data (aggregated forwarding). They are compressing without information forwards data packets created by every Node separately. On the other hand, in the other type, the data obtained from every Node of the sub-tree is combined into a uniform size packet by the root node. Later, just a combined packet from the sub-tree's root node is transmitted. Once a robust geological correlation is obtained by the data, the combined forwarding is used or gathering brief data like the highest, lowest or mean is the aim. In our research work, we suggest a novel combination method in which the root node of every sub-tree joins the sensing information obtained from every Node in the sub-tree with its data.

Figure 2: Allotment of timeframe into time slots
In our methodology, the parent node is assigned by a routing protocol to the extent that the following limitation is fulfilled. Let every Node make a 'l' sized sensing data, and 'hd' be the header's size. Next, Eq. (3) calculates the combination of the gathered packet's data size for any node 'sn'.
info Trx sn =(hd+l)+ ∀node∈subtree(sn) l As per Eq. (4), the aggregated packet's dimension must not go beyond the largest packet maxl that could be conveyed in the Trx information of one timeslot gap.

Cluster Formation Using Energy-Conscious Scattered Asymmetric Clustering (ECSAC)
The nodes' distance from BS is first calculated once they are placed. To accomplish this, an indication is transmitted by BS, and the entire nodes could hear it. Every Node consolidates the distance of sits with BStn by the obtained indicator's power. Every round contains a cluster establishment stage and a firm-state stage, where data diffusion happens. To have a clustering topology, the establishment stage is categorized into three sub-stages: fellow node spec gathering phase, CH selection phase and cluster creation stage. In the information forwarding stage, cluster members gather information within the surroundings and transmit the collected information to the CHs that receive and combine the data from their fellow clusters and then forward the combined information to the next-hop nodes according to the routing tree designed in this model.  The data transmission, which is a firm-state phase, must be longer than the establishment phase for preserving the algorithm's overhead and extending the network lifetime. The state message of every Node is mentioned in Tab. 1. Many control messages are required, and the explanation of these messages is shown in Tab. 2.

Cluster Establishment Stage 4.2.1 In the NETWORK Deployment Stage
The BS transmits a signal at a particular power range. Every Node can work out its position corresponding to the BS according to the strength of the signal received. There are three substages in cluster setup phases: fellow node spec gathering stage, where duration is T 1 ; CH choosing stage, where the period is T 2 ; cluster formation stage, where the period is T 3 .
In the Fellow node spec gathering stage, every Node transmits Node information within radio r with the below mentioned two values: the node id and its remaining energy Rnrg. Simultaneously, it gets the Node_ information's from the nearby nodes, based on which every Node determines the avg. and the remaining energy of its nearby nodes Rnrg avg using the following Eq. (5): where n id denotes one of the adjacent nodes, n id × Rnrg means the RE of n id and k is the No. of neighbour nodes. For every node, the below Eq. (6) is used for calculating its waiting time T w for propagating Head-information message: where Rnrg is the RE of the Node, R i is a real integer arbitrarily arranged between [0.9, 1] that is brought in to decrease the possibility of two nodes sending Head_ information simultaneously.
Once T1 expires, it starts the CH selection phase.
For any node n id here, it gets no Head_ information when T c expires, and it transmits the Head_ information within radio range RRi to showcase that it will be a CH. Or else, it retires from the competition. To not create such equal clusters, every Node has to compute its CRRR. The formula of RR in Li et al. [38] is given in Eq. (7): where maxd and minds are the max and min space between the nodes in the network and the BS, d(n id , BS) is the distance from node n id to the BS, ω is a weighted factor whose value is in [0,1] and R 0 r is the max value of CR. The ECSAC system is according to the improved EADUC methodology, but contrary to the EASAC scheme, for producing unequal clusters, it uses a different CR rule. Only the distance between nodes and BS are taken into account in the original EADUC protocol for the expression of CR and the RE of nodes. Therefore, the suggested scheme addresses, apart from the latter two considerations, the amount of neighbors and calculates the radii rivalry to compensate the costs involved in the aggregation. The strategic range is the distance from the BS, CH's remaining strength, and adjacent nodes' count. The suggested scheme nodes with comparatively more remaining power, a total distance of nodes from the BS, few neighbouring nodes, etc., should have a more comprehensive broader range of competition and the formula given in Eq. (8) is used to accomplish this.
In heterogeneous networks, nodes have different initial energy. Here, every Node has equal energy consumption, and the nodes with minimal initial energy fall off early, thereby decreasing the lifetime of the network. To have the full benefits of the high-energy nodes, the high-energy nodes must accept more tasks. Hence, taking into account the gap amid nodes, the BS and the RE of nodes, we derive the formula of R r : where d (n id , BS) is the space between the Node n id and the BS ω and δ are the weighted factors in [0,1], Rnrg is the RE of the Node n id and RM Rnrg is the highest value of CR. With the help of this formula, we observe that the rivalry radius of the Node is ascertained by d (n id , BS) and Rnrg. Significant d (n id , BS) and Rnrg produce ca large R r , indicating that CHs with more RE and distantly placed from the BS will regulate more significant cluster areas. In one way, CHs near to BS can preserve energy for information transmission, and in another way, CHs with less RE control smaller clusters for ignoring their early expiry and extend the lifetime of the network.

(i) Cluster Construction Phase.
It is the last sub-phase of the cluster association phase. Every non-cluster-head Node selects the closest CH and transmits the Join_ information with the id and leftover energy. According to the received Join, every CH generates a node plan list and sends it to the fellow members by transmitting Schedule Msg.
(ii) Data Transmission Phase. The stage during which information is transmitted has numerous significant slots. Each primary slot has many rounds, a CH alternation and an alteration route. Two stages create them: (a) intra-clustered forwarding of information and (b) inter-clustered forwarding of information

(a) Intra-cluster forwarding of information
In the intra-cluster communication process, all the nodes present within the cluster sense their local environment and collect it. Each Node then forwards the gathered information to their corresponding CHs. The CH sums up the received message and transmits the packet to the SN with the help of inter-cluster communication

(b) Inter-cluster forwarding of information
The CHs aggregate the data that had been obtained from its nodes. The aggregated data are then forwarded to the SN. The management of inter-cluster communication is essential as it alone utilizes the central part of any sensor network's aggregate RE level.
In this model, a backtrack-based channel allocation is employed to ensure better energy management among the CHs. The scheduling algorithm presented here discovers maximum possible ways with the help of backtracking-the algorithm CATUB receives an allocation solution with less energy consumption. A pseudo-code CATUB is depicted by Algorithm 1. The algorithm inputs are G = (V, E), the directed routing graph and S, the maximum No. of channels available. For each sensor node, the algorithms produce a communication Allocate [T] [C]. Here, the Node assigned with an ith timeslot and the jth channel is represented by the values in Allocate [i] [j]. To gather the sensing information from entire nodes at the sink (root) node atone time, Child node timeslots should be allocated before their origin node timeslot. Therefore, the algorithms begin by assigning the schedule in a bottom-up style from the leaf nodes towards the SN.

Channel and Timeslot Allocation using Backtracking (CATUB)
CATUB Nr Trx n + Nr Rex n + Nr Idl n (9) The values Nr Trx n Rex n In Eq. (9), the energy is spent by node n in broadcast, response and idle mode, respectively, in a timeframe.
In every resolution, the algorithm gets a schedule and channel provision to the entire nodes before the algorithm attained the SN. It is done when the current answer has a small cost metric compared to the former top solution (Nrsolu < Nrmin) and the algorithm stores both cost Nrsolu and scheduling outcome PrsnSolu [

Input:
1. A directed graph, D g = (S n , E d ), where S n is the vertices that represent the representing SN and E d represent the edges of the directed graph.
2. Set of maximum available channels C max .
3. The least found energy solution available recently, Nr min.

A 2D array Allocate [T]
[C] that could store the results. The Allocate[t][c] represents that a node is allotted a timeslot t to transmit the aggregated data through the given channel c.

5.
Nr solu , the current energy consumption level.  , correspondingly. It explains that the present clarification offers a minimum consumption compared to former schemes (Nr solu < Nr min ). CATUB at first lines up every branching node into the (s ∈S|s.children== 0) into queue ReadyQ that accumulates the nodes, which are ready for getting planned with the setting: (1) the leaf nodes (without child nodes) and (2) priorly scheduled nodes with child nodes. By inviting the Recursive function (RF) from the timeslot 0, the CATUB algorithm begins. RF's input has two queues: ReadyQ and IdleQ. At first, IdleQ begins as a queue without any nodes. As the branch node is without children, they start quickly in their broadcasting schedule. In every timeslot, the algorithm looks into every possible subset of nodes fulfilling the application limitations. C gives a large-sized subset. In the timeslot, for every queued subset, the algorithm recurrently performs the other nodes that are not in the queue for the following timeslots. Finally, the algorithm comes back to the minimum energy schedule Allocate [T] [C].
As a sample, in the network of Fig. 1, the enqueuing of the leaf nodes S n5 , S n18 , S n1 , S n6 , S n7 , S n10 , S n3 , S n20 , S n21 and S n9 to ReadyQ is commenced by CATUB for timeslot T 0 to get ready. There is an emptiness in IdleQ, the queue for idle nodes. CATUB finds all likely, probable subsection of nodes, which fulfil the highest channel constraint C = 4 in timeslot T 0 . Such subsections are (S n3 , S n9 , S n6 , S n7 ), (S n6 , S n7 , S n5 , S n18 ). The algorithm computes the cost for every subsection and performs with the recent criteria, the recursive job ALLOCATE_SLOT for timeslot T 1 . The algorithm adds up scheduled Node's parents to the queue Ready If subsection (S n3 , S n9 , S n6 , S n7 ) for timeslot T 0 is chosen.
Nodes S n5 , S n18 , S n1 , S n23 , S n11 , S n10 , S n17 , S n20 , S n21 and S n22 are the latest queue ReadyQ. To queue IdleQ, the parents of the scheduled nodes, S n17 , S n22 , S n23 , S n11 , are too restructured. When the latest consumption is greater than the former least consumption (1 is the initial minimum cost) value in the T1 timeslot, CATUB performs backtracking to timeslot T 0 , and the remaining subsets are discovered. When lesser is the latest cost than the legal best cost, the execution of CATUB in the timeslot T 1 is done in a similar manner to the one in the timeslot T 0 . The other timeslots also once again go through a similar process. Tab. 1 details the individual Node's energy consumption and the duration of a single timeslot. 79.52 mJ is the energy spent on CATUB.

Simulation Scenarios
Three conditions were selected for imitations: Scenario 1: 100 nodes are consistently placed around an area of 300 × 300 m 2 as exposed in Fig. 3a.
Scenario 2: 100 nodes are inconsistently placed with more SNs collated together in the area on the right side of the sensor field, i.e., near the BS, around an area of 300 × 300 m 2 as depicted in Fig. 3b. Scenario 3: 100 nodes are inconsistently placed with more SNs and are assembled on the left side of the sensor field, i.e., off from BS, about an area of 300 × 300 m 2 , as shown in Fig. 3c. Scenario 4: 100 nodes are inconsistently placed with more SNs brought together in the region in the middle of the sensor field, i.e., little away from BS, around an area of 300×300 m 2 as proved in Fig. 3d.
In the methodology put forth in our study, the count of alive nodes, the avg. of network energy and network stability, First Node Death (FND), Half Node Death (HND), destruction of 10% and 20% of nodes (PND) and Last Node Death (LND) in the entire imitation duration were all assessed. The reproduction was performed in 50 periods.
Few are explained below: • Network Life Span: The period that is the beginning of the network functions to the last node death.
• Network Stability: The period from the beginning of the network functions to first node death. • Throughput: The No. of data packets. A network transmitted it to the BS. Efficiency enhancement directly links with improved network stability and the network lifetime. • Load Balancing: Traffic load distribution. Its gain being the load is well-disseminated across the nodes, leading to a balanced consumption of energy. Also, nodes' unexpected downfall because of their over-usage is avoided, resulting in an enhanced network's enhanced lifetime.

Simulation Parameters
The factors responsible for replication are shown in Tab. 3. The best No. of some of the parameters (for x.:RLmax) was calculated from different replication outcomes.
The simulations are repeated many times for finding round No. in a significant slot and many slots in the data transmission stage. Replication factors, like the nodes' positions, are seen as the same for every Node so that the outcomes are reliable and trustworthy. This simulation has got a significant part to play in the suggested method. Here, the simulation could be done more accurately by reducing round count, leading to increased overhead, energy consumption and reduced network lifetime. The project's critical aim is to raise the life span of the network by removing almost all of the regulation messages and decreasing the overhead, thereby resulting in reduced energy consumption of nodes. As per the simulation results, it is observed that every information forwarding stage has seven parts of the vital slot that has six rounds, one cluster head rotation, and one adjustment route. In general, in the information forwarding stage, information was forwarded in 42 rounds, and our objective was to eliminate most of the network overhead.
One of the essential parameters in clustering is finding the radius. Thus, in Eq. (10), the primary level is equal to 1, in the 2nd and 3rd levels is 1.25, and in the 4th level is 1.75. Therefore, the clusters placed near the BS are smaller, and the cluster head can get additional energy for transmitting and routing other Cluster Head packets to the BS.
For finding the RM Rnrg parameter in Eq. (10), many practice tests are done using various RM Rnrg values for getting the correct value for the RM Rnrg setting. Among the various vital factors, wireless nodes, the No. of CH and the cluster dimensions rely on Node's radio. The outcome of the simulated runs for multiple situations is presented below.

CH Distribution Evaluation
In this proposed model, the right CH count is calculated to be equivalent to 5% of the network's entire nodes. Every Node has a distance that has to be such that the No. of clubs in the network must be appropriate. In this case, the parameter's value RM Rnrg was estimated to be equivalent to 100 m, Which implies that CH is around 5. Fig. 4 indicates in every case the mean No. of CHs. The CHs are allocated, and there is also power over the No. of CHs. The below figure shows the EASAC protocol that generates a stable No. 2. This is because of the presence of just one CH in every competition by the competitive radius. For scenarios 1 and 4, i.e., containing standardized dispersed sensors and clustered sensors, 4-5 cluster head Nos. are produced and possibly during each protocol round. Six clusters No. heads are more probable in scenario 3, whereas 4 CHs are more common in scenario 2. The nodes close to BS are allocated smaller competitive radii during the protocol process. As in scenario 2, additional nodes are positioned near BS; more CHs than in scenario 3 are likely to be created in the region near BS.

Estimation of Energy Utilization
The ECSAC, EADUC and HUCL protocol's mean energy consumption is calculated for the four situations included here. Fig. 5 depicts the mean energy consumed in each round in the network when each protocol is functioning until it dies for the 3 types of situations. Energy spent in a round consists of the energy utilized in clustering topography creation and forwarding of information. The low energy consumed in the HUCL process is lower than the EADUC process and is weaker when it comes to the ECSAC process. Moreover, we notice the mean energy consumption of the network in the scenario. Three is just more than scenario 2; like in scenario 3, the area near the BS vicinity is scarcely organized. Therefore, there is more possibility of a long-distance between the last transmit Node and BS than scenario 2. It is thickly arranged.

Network Stability and Network Lifetime
To increase the quality and throughput, additional information to the BS has to be transmitted, and here, it is essential to avoid the Node's downfall. Hence, efficiency and performance can be enhanced by raising the steadiness of the network. In Tabs. 4 to 7, the output of the stability period and the network lifetime consisting of FND (100 Nodes), 10% PND (90 Nodes), 20% PND (80 Nodes), HND (50 Nodes) and LND (0 Node) of the methodologies were calculated for the primary and secondary situations, where the suggested method performed better than the HUCL and EADUC algorithms. The recommended protocol showed better output with more excellent stability in a range of spaces. ECSAC receives aide from data obtained from the nearby nodes for grouping and uses inter-cluster and intra-cluster as along with MH forwarding correctly. In Tabs. 4 to 7, the outcomes are shown, which explains that the suggested methodology can enhance certain factors and transmit extra packets when there is an incidence of parameters.   It was stressed that these nodes without perfect energy levels could not be a CH as they require much energy. Hence, it leads to the division of energy consumption uniformly amid the nodes at simulation time. The protocol put forth assistance in bringing down the energy spent in the network by removing abnormal regulating information and minimizing overhead; hence, it leads to a stretched network lifetime.

No. of Living Nodes
Tab. 8 shows the mean no. of live nodes. We can ascertain from this that the mean no. of live nodes went across 38% of all node counts, confirming the sustained network stability suggested by our algorithm. As per our results, ECSAC showcased good results than the rest of the procedures and also raised live nodes to count in simulation. It is all because of the stability amid the energy consumption in various nodes as suggested by preventing node expiry.

Energy Utilization Throughout the Transmission Stage
Post the completion of the forwarding of the collected information packet and every SN changes to the eternity sleep mode until the expected information collection duration. The energy spent in sleep mode is insignificant and not taken into account. The outcome shows that the CATUB algorithm employed in the ECSAC model spends minimum energy. The energy consumption raises proportionately with the network size. The results of the competing models and the proposed model's energy consumption during the transmission phase are indicated in the following Fig. 6a to 6d.
When it comes to our methodology, the rate at which energy is spent is polynomial. The outcomes also show that the energy spent by CATUB is the least compared to other algorithms as it finds the best method amid various probable methodologies with effective backtracking. Meantime, the job done by HUCL is at par with CATUB considering tiny networks; CATUB outdoes for the more extensive networks, resulting in the prevention of loss of energy and its conservation around 24% in a data collection period. As per the outcomes, we agree that in the suggested methodology, the energy consumption was minimized by minimizing the network overhead.

Conclusion
WSNs come with certain restrictions like energy sources for energy consumption as they are directly connected to the transmission. Fine-tuning energy consumption in routing protocols is an essential process for increasing the lifetime of the network. This work has been expanded to improve the life of the WSN by EADUC. This research also used the non-uniform approach to clustering. Based on unequal competitive ranges, the shaped clusters are of uneven scale. There are smaller clusters nearer to the BS compared to the ones away from the BS. By using several factors, the nodes are assigned an uneven radius of competitiveness. It increases energy spent within the CH nodes. The outcome indicates that ECSAC can efficiently augment the network's steadiness and lifetime compared to ECDC, HUCL and EADUC.