1 Introduction

The prime aim of the sensor node in WSN is to gather data from common climate as several electronic factories are developing minimum power with small size advanced sensor nodes for observing environmental changes like pressure and temperature [1]. The sensor nodes gather the data and deliver into the specific recipient, the sensor nodes are randomly deployed in the communication area for measuring the environmental data as the self-organized monitoring system into huge geographical regions such as industry, vehicle monitoring [2]. Every sensor node is constructed through several components like memory, processing, sensing, energy management. Every sensor node has the restricted energy level and the battery replacement is very hard in several applications so the effective energy consumption is very much required in WSNs [3].

The sensor node requires more energy for delivering the data into the base station, so the cluster related routing methodology is required for effective energy utilization while the improved approach is required to the sensor nodes for delivering the data into the base station [4]. The clustering functionality is required for distributing the nodes into the clusters as every cluster contains members and cluster heads. Additionally, every member delivers the data packets to the particular cluster head, the data aggregation for the delivered data packets to the base station. The cluster heads need high energy for evaluating the operations with effective energy utilization [5].

Every round of routing process consumes unwanted energy consumption and it could be optimized through the centralized approach. The energy of each cluster members diminish due to the transmission to the recipient and maintains the low energy level, after the specific amount of rounds, the energy metric maintains minimum values then other metrics of cluster head selection and produces ineffective utilization of energy; hence the enhanced cluster head selection procedure is required [6]. The ineffective inter-cluster transmission routing requires large amount of energy so the multi-hop transmission is not useful in huge area networks. The relay nodes are transmitted through the base station for active routing to produce the energy dissipation that identifies the ineffective routing [7].

The effective utilization of energy is having the fitness function for every cluster which has to be selected through energy consumption and the distributed routing is used to save the energy [8]. The clustering process is implemented in every round by base station with the enhanced optimization procedure in an effective manner and the base station operation requires the data about the location [9]. Hence, the sensor nodes deliver the control packet into the base station that involves unwanted energy utilization. The clustering process could be implemented in small rounds and the enhanced approach for observing residual energy of the rotation cluster head identification approach [10].

Every cluster head consumes the energy through the specific functions as the fitness function that needs the node’s residual energy. The inter-cluster transmission has the cluster heads nearer to the base station died suddenly as the extra data packets are received from another cluster heads for distance from the base station. The balanced energy utilization has been confirmed through the node distance from the base station. Cluster members and cluster heads consume huge energy through unbalanced approach according to the ineffective routing and it reaches the reduced network lifetime. The improved packet routing approach for effective utilization of energy through effective cluster head for saving energy of the cluster heads. The main contribution of the paper is.

  • The cluster head selection process contains the distance-based cluster members with the modified fitness function.

  • The cluster head collects and performs data aggregation operation of the data packets from one cluster head to another cluster head.

  • The packet routing methodology has the energy consumption strategy for cluster head selection through the base station.

  • The optimum value is used to measure the distance with the performance metrics like network lifetime and energy consumption.

2 Related Works

The clustering techniques have the important role in enhancing the network lifetime as the LEACH protocol [11] has been used to minimize the global transmissions within the WSN using the nodes grouping into tiny sized clusters. The random selection of cluster heads needs enhanced functionalities to reduce the energy consumption. The enhanced technique HEED [12] has been used to identify the high residual energy nodes as the cluster heads with the level of the battery. Another technique of FLEC [13] has been implemented for increasing the energy efficiency through the high energy nodes which have been selected as the cluster head and maintains the data in cluster features and deliver it to the base station.

The improved LEACH approach [14] has been used to reduce the computational time and identifying the cluster head whenever it has some issues, an enhanced approach is used to assign every cluster through cluster head. The elaborated LEACH approach called as LEACH-F [15] has been maintained through a fixed amount of clusters in a centralized framework. The main drawback of this approach is no flexibility for cluster update whenever the clusters are constructed, the nodes should not modify the details while the damage of nodes also. Additionally, the clustering approach with energy balancing [16] has the reliability of the residual energy and distance parameters that enhances the identification of cluster head. The K-LEACH [17] approach has been used to select the cluster head randomly. The fuzzy decision making technique (MADM) [18] has been implemented for selecting cluster heads through the metrics of adjacent nodes, distance and residual energy.

The cluster enabled energy optimization methodology (CEOMS) [19] has the energy density procedure for the sensor nodes initially and the maximum residual energy nodes are assigned as the cluster heads. The sink node has been framed for enhancing the probability of nodes is high for selected as the cluster head. The enhanced adjustment procedure has been used to enhance the adaptability for density of several active nodes in the network. The Grid head based cluster head formation in optimized way with energy efficiency (EOCGS) [20] has been implemented using dynamic approach that the fitness function utilizes the Euclidean distance and position of the grid based cluster heads. The centralized cluster head selection approach (C3HA) [21] has been determined to identify the cluster head that minimizes the energy consumption and enhance the network lifetime.

The network bandwidth has been increased with the enhanced clustering approach [22] that the transmission cost directly suffers the energy utilization for environmental monitoring of the WSNs. The enhanced clustering approach has been involved for achieving energy efficiency while data communication. The energy distribution functionality is used for conserving the residual energy and extending the network lifetime. The Differential Evolution functionality has been intended for solving the energy utilization problem while cluster head selection [23]. The energy related problem and the network lifetime are the common problems and the effective clustering process has the solution for these problems. The energy enabled minimum spanning tree approach (EEMST) [24] has been used to identify the optimized cluster head and active routing through graph theory. The weighted tree has been involved to find the optimal cluster head through the shortest path for data communication within the cluster head and the sensor nodes.

The data redundancy, scalability and end-to-end delay are the common problems of deploying WSNs, the effective cluster head election procedure (LEDCHE) [25] has been used to solve these problems. The dynamic re-clustering procedure and optimum cluster head head selection are the main functionalities with the random function in every node. The residual energy could minimize the dead nodes in the network while implementing the re-clustering procedure for addressing the black holes and end-to-end delay issues. The multi-objective genetic procedure [26] has been established to minimize the intra-cluster distance and diminishing the energy utilization of the cluster head while selecting the optimal cluster head, the optimum routing methodology is used to transmit the data packets within the sink node and the cluster head in efficient way. An artificial neural network technique [27] has been established for minimizing the energy consumption while the group of routes are identified through the sink node using the genetic algorithm. The data collection procedure for every cluster is initiated by the sink node to the clusters.

The non-uniform signals into the sensor nodes manage to extra battery utilization that reduces the network performance and this issue could be solved through the ant colony optimization methodology is utilized for identifying the optimal energy proficient route for improving the network lifetime [28]. The congestion control in WSN could produce the low throughput while the RACC technique improves the network lifetime and reduces the congestion control which increases the overall performance than the related techniques [29]. The 2-step Congestion control technique is used to increase the network performance and it solves the path loss issue to enhance the network throughput. The constant bit ratio in user datagram protocol for reducing the congestion [30]. The congestion control technique within the data communication, Congestion occurs while network resources are overloaded and leaded to packet loss, network delay, and minimized the overall performance. The congestion could be avoided through the efficient quality of Services, improved load balancing, buffer management, traffic management, and network optimization.

3 Proposed Framework

The proposed technique (CHRT) is constructed to enhance the network lifetime by balancing energy consumption with improved residual energy of the sensor nodes as the rotational cluster head discovery through base station. The centralized clustering concept in every round eliminates the unwanted energy consumption according to the transmissions within the base station and the sensor nodes. The total amount of clustering rounds is dynamically reduced by eliminating the unnecessary energy utilization. The fitness function is used to select the cluster heads through the residual energy of the cluster members as every cluster head’s energy has to be minimized according to the data exchange within the recipient and the entire routing process is demonstrated in Fig. 1.

Fig. 1
figure 1

Routing process of proposed technique

The network contains huge number of nodes which are randomly deployed in static and has the similar level of energy that every member delivers its data packets to the particular destination that every cluster head computes its functionality as gathering and data aggregation process on the data packets which are communicated through its cluster members and deliver it into the base station through multi-hop transmission. The cluster head maintains the data aggregation and data gathering functionality for other cluster heads due to enhanced routing strategy. The centralized clustering procedure utilizes the location data of the nodes for delivering into the specific clusters. The nodes need to deliver a data packet to the base station that involves the location data which performs the convergence centroid values for performing cluster construction which is demonstrated in Eq. (1).

$$Ce{n}_{xy}=\frac{1}{\sum_{z=1}^{c}\left(\frac{{dis}_{xy}^{2}}{{dis}_{yz}^{2}}\right)}$$
(1)

where \(Ce{n}_{xy}\) demonstrates the centroid value, x denotes the total amount of nodes in active routing, y illustrates the total clusters, c demonstrates the total amount of clusters and \({\text{dis}}_{ xy}\) denotes the distance within the centroid and the sensor node. The distance within the nodes is computed in Eq. (2).

$${dis}_{\alpha \beta }=\sqrt{{\left({p}_{\alpha }-{p}_{\beta }\right)}^{2}+{\left({q}_{\alpha }-{q}_{\beta }\right)}^{2}}$$
(2)

where \({p}_{\alpha }, {q}_{\beta }\) is the node coordinates and the cluster centroid value is computed in Eqs. (3), (4) and (5).

$$c{c}_{{y}_{p}}=\frac{\sum_{x=1}^{{N}_{p}}{p}_{x} Ce{n}_{xy}^{m} }{\sum_{x=1}^{{N}_{p}} Ce{n}_{xy}^{m} }$$
(3)
$$c{c}_{{y}_{q}}=\frac{\sum_{x=1}^{{N}_{p}}{q}_{x} Ce{n}_{xy}^{m} }{\sum_{x=1}^{{N}_{p}} Ce{n}_{xy}^{m}}$$
(4)
$$c{c}_{y}=\left(c{c}_{{y}_{p}}, c{c}_{{y}_{q}}\right)$$
(5)

where \(c{c}_{{y}_{p}}and c{c}_{{y}_{q}}\) are the cluster centroid coordinates and m is the parameter value within the actual value of two has been used for completing the performance.

The enhanced routing technique for effective energy utilization according to the residual energy through cluster based centroid approach from the base station which enabled inter-cluster transmission. The distributed approach has several rounds as the cluster head selection and routing in every round with packet-based routing approach. The deployment procedure has been completed as the cluster procedure which begins every node transmits to the base station and consumes energy consumption. The cluster round is expressed in Eq. (6).

$$Clu_{R} = ~\left\{ {\begin{array}{*{20}l} {1,} \hfill & {~r_{d} = 1} \hfill \\ {1,} \hfill & {dead_{n} > 0} \hfill \\ {0,} \hfill & {Otherwise} \hfill \\ \end{array} } \right.$$
(6)

where \(Cl{u}_{R}\) demonstrates cluster round, \({r}_{d}\) is the particular round of simulation, the minimized amount of cluster round improves the network energy. The nodes are divided into 2 groups as the shortest distance and the long distance. The optimum value is used to discover the distance and it could be measured with the performance parameters of energy utilization and network lifetime. The smaller distance cluster needs to satisfy the expression in Eq. (7).

$$dis_{0} = \left\{ {\begin{array}{*{20}l} {dis_{{SN~~BS}}^{{th}} ,} \hfill & {dis_{{SN~~BS}}^{{th}} \le ~dis_{{th}} } \hfill \\ {dis_{{th}} ,} \hfill & {otherwise} \hfill \\ \end{array} } \right.$$
(7)

where \({dis}_{SN BS}^{th}\) is the distance from the sensor node to the base station as the maximum limit of threshold value, the optimum value for the distance cluster is described in Eq. (8).

$$Op{t}_{DC}=\frac{R}{{dis}_{CH}^{2}}$$
(8)

where R is the communication area, \(di{s}_{CH}\) demonstrates the distance to the cluster head and other clusters in the network has been used for generating the optimum values. Whenever the clustering process is completed, the base station transmits a control packet in the network that confirms every node to identify the position into the clusters with centroid. The enhancement of the cluster head procedure needs to discover the cluster head for every cluster of long distance and smallest distance with the fitness function that modifies the residual energy of the members. The cluster head directly transmits the message through the base station for active communication, the distance within the base station and the cluster member utilize the fitness function for cluster head selection through the residual energy. The fitness value is computed in Eq. (9).

$$F{V}_{CH}= \gamma {p}_{1}+\left(1-\gamma \right){p}_{2}$$
(9)

The value of \({p}_{1}\) is computed in Eq. (10).

$${p}_{1}=\frac{Energ{y}_{Res}}{Energ{y}_{i}}$$
(10)

where \({p}_{1}\) is the parameter for the residual energy to beginning energy of the cluster member, \({p}_{2}\) is expressed as the distance within the base station and the cluster member in Eq. (11).

$${p}_{2}=\frac{\left(di{s}_{th}-di{s}_{SN \to BS}\right)}{di{s}_{th}}$$
(11)

The energy for every member diminishes regularly due to the active transmission with cluster head so that the value of \(\gamma\) needs to be modified in every round according to the residual energy and the threshold energy of the specific cluster while selecting the cluster head. Every cluster head has huge number of members in smallest distance to the cluster centroid according to the proposed technique; hence the cluster head must be near to the centroid and maintains maximized residual energy. The fitness functions of the proposed technique despites distance metric for the cluster head selection in a largest distance cluster also modifies through residual energy and energy related operations. Every member maintains the fitness value and the highest valued member is discovered as the cluster head. The modified fitness function is computed in Eq. (12).

$$F{V}_{CH}^{mod}= \gamma {p}_{1}+\left(1-\gamma \right){p}_{3}$$
(12)

The value of \({p}_{3}\) is computed in Eq. (13).

$${p}_{3}=\frac{{(dis}_{max}^{LD} -di{s}_{SN \to CH})}{{dis}_{max}^{LD}}$$
(13)

The largest distance value is computed in Eq. (14).

$${dis}_{max}^{LD}=1+\text{max}\left\{di{s}_{SN \to Cen}\right\}$$
(14)

The mean distance within the centroid and the cluster member is computed in Eq. (15).

$$dis_{{mean}}^{{LD}} = mean\sum\limits_{{i = 1}}^{n} d is_{{SN_{i} \to Cen}}$$
(15)

The cluster head selection procedure has the selection of cluster members of smallest distance then the cluster heads of long distance has been selected with the modified fitness value. After successfully selecting the cluster heads, it delivers the acknowledgement message to all the members of long distance for providing active routing process. The response message has been delivered by the members to the cluster head for active transmission. The cluster heads with members deliver the data packets within the specified time periods. The inter-cluster transmission utilizes the cluster heads for delivering the data packets to the base station according to the proposed routing functionality which is demonstrated in Algorithm 1.

Algorithm 1
figure e

Cluster head selection with Effective Energy utilization

The packet routing methodology has the effective utilization of the network energy with the functionality of cluster head selection process within the base station and the cluster head. The intra-cluster transmission is the smallest distance cluster which is used for effective utilization of energy in cluster members according to the distance to the base station. Whenever the sensor node satisfies the condition, it broadcasts the data packets to the cluster head else it delivers to the base station and the destination is expressed in Eq. (16).

$$SN_{{dest}} = \left\{ {\begin{array}{*{20}l} {CH} \hfill & {dis_{{SN \to CH}} > dis_{{CH \to BS}} } \hfill \\ {BS} \hfill & {otherwise} \hfill \\ \end{array} } \right.$$
(16)

where the cluster head gathers and data aggregation of the data packets from the cluster head to other cluster heads of long distance delivers it to the base station which is used to avoid the unwanted communication from the sensor nodes to the base station. In every long distance clusters, every sensor node delivers the data packets to the specific cluster head and the cluster heads deliver the data packets through multi-hop routing with fitness value as the distance with the base station and cluster head. Every cluster head gathers the fitness value with residual energy and the centroid value is computed in Eq. (17).

$$F{V}_{Routing}= \delta {p}_{4}+ \left(1-\delta \right){p}_{5}$$
(17)

where \({p}_{4}\) is identified as the rate of residual energy for the cluster head and it is computed in Eq. (18).

$${p}_{4}=\frac{Energ{y}_{Res}^{CH}}{Energ{y}_{i}}$$
(18)

The value of \({p}_{5}\) is computed as the rate of distance for the cluster heads through the centroid in Eq. (19).

$${p}_{5}=\frac{{(dis}_{CH \to Cen}^{max}-{dis}_{CH \to Cen}) }{{dis}_{CH \to Cen}^{max}}$$
(19)

The value of \({dis}_{CH \to Cen}^{max}\) is computed in Eq. (20).

$$dis_{{CH \to Cen}}^{{max}} = 1 + \mathop {{\text{max}}}\limits_{{\text{i}}} \left\{ {dis_{{CH \to Cen_{i} }} } \right\}$$
(20)

The energy based dependency and the distance metric has been maintained by identifying the value of \(\delta , Cen{\prime}\) is the value of centroid to the cluster heads with highest value into the centroid values. The value of \({p}_{5}\) becomes zero despite \({(dis}_{CH \to Cen}^{max}={dis}_{CH \to Cen})\), so that the value of 1 should be included for avoiding 0. The cluster heads satisfy the condition of delivering the data packets through the active cluster head which directly transmits to the base station. Moreover, every sensor node of long-distance clusters delivers the packets to the cluster head through multi-hop transmission is illustrated in Algorithm 2.

Algorithm 2
figure f

Enhanced packet routing technique

4 Performance Analysis

The proposed technique is simulated using MATLAB through 2 environments through several performance metrics of network coverage, residual energy and network lifetime. The proposed CHRT methodology is compared with the related methodologies of CEOMS [19], EOCGS [20], C3HA [21], EEMST [24], and LEDCHE [25] through the performance metrics of energy consumption, active nodes, residual energy, and coverage rate for the 2 environments. The simulation metrics are illustrated in Table 1 that the base station is initially originated as \(\left(0m, 0m\right).\) The Coverage area in WSN is affected by the physical environment, signal refraction, interferences, antenna and environmental factors with constraints. The frequency band is involved to affect the coverage in Indoor environment which leads to tiny coverage range compared with outdoor environments that signals could travel with longer distances.

Table 1 Simulation metrics

The total amount of sensor node in the smallest distance cluster using the optimum value \(op{t}_{n}\) with the performance parameter of total amount of rounds for FND, HND and HEC. Figure 2 demonstrates the simulation of the different optimum values in the network and whenever the optimum value is 0.2, the total amount of rounds are increased and this value is identified as the optimum value of the proposed technique.

Fig. 2
figure 2

Different optimum values for the proposed technique

The initial energy utilization in each environment is demonstrated in Fig. 3 that the relevant methodologies have highest amount of energy consumption due to the centralized clustering approach in every round, but in the proposed methodology the enhanced clustering approach has been utilized to minimize the energy consumption.

Fig. 3
figure 3

Initial energy consumption

The alive nodes have been evaluated through the network environment 1 in Fig. 4 and environment 2 in Fig. 5 that the simulation result shows about the proposed technique is compared with other techniques which have produced the extended network lifetime due to the energy proficient cluster head selection and enhanced routing approach. The simulation results show that the network lifetime suddenly diminished after some rounds due to energy consumption.

Fig. 4
figure 4

Alive nodes (%) for environment–1

Fig. 5
figure 5

Alive nodes (%) for environment–2

The proposed technique has improved rounds than the relevant methodologies due to the base station and it is kept at the initial period through the sensing area which is higher in Environment–1 than Environment–2, the enhanced clustering through the improved rounds periodical extends the network lifetime as the proposed technique holds the unwanted energy utilization through the clustering procedure and the overall simulation results are better for the proposed technique which is demonstrated in Figs. 6 and  7.

Fig. 6
figure 6

FND and HND for environment–1

Fig. 7
figure 7

FND and HND for environment–2

The proposed technique is simulated to evaluate the residual energy of the network for Environment–1 in Fig. 8 and Environment–2 in Fig. 9 that the results have been compared with the relevant methodologies. The optimal energy utilization is identified for the proposed technique due to enhanced clustering and routing approach that minimizes the unwanted energy utilization into the initial procedure.

Fig. 8
figure 8

Residual energy for environment–1

Fig. 9
figure 9

Residual energy for environment–2

The coverage rate is the important performance metric for evaluating the network coverage that the rate of the amount of completed grids to the total amount of grids in the network. Basically the whole sensing area has been segregated into same sized squares while the completed squares are the smallest alive nodes. The proposed technique is simulated for computing the coverage rate in 2 Environments, the simulation results are compared with the related methodologies and (Figs. 10, 11) demonstrate that the proposed technique is having better result in network coverage.

Fig. 10
figure 10

Coverage rate for environment–1

Fig. 11
figure 11

Coverage rate for environment–2

Figures 12 and 13 demonstrate the performance analysis for the proposed technique with the relevant methodologies in terms of clustering metrics and the results proved that the proposed technique has the improved performances.

Fig. 12
figure 12

Performance analysis for environment–1

Fig. 13
figure 13

Performance analysis for environment–2

The increasing the packet size will affect the efficacy of data communication, network congestion, error rate, fragmentation, latency, jitter, buffer requirement, throughput. While increasing the packet size could enhance the efficiency and throughput in particular environments, it can also lead to enhance the congestion, latency, and retransmission costs in difference environments. The decision of enhancing the packet size should be executed according to the particular network constraints, balancing of the trade-offs for achieving the optimized network performance and the proposed technique is developed to overcome the above-mentioned issues.

5 Conclusion

In this paper, Effective Energy utilization for cluster head selection process and an enhanced packet routing technique has been proposed for enhancing the network lifetime. The proposed cluster procedure has been used for producing the optimized energy utilization that reduces the unwanted energy consumption. Every cluster head is selected with the fitness function that holds the residual energy and the modified fitness function have relayed the remaining cluster heads to save the energy in effective way. The Experimental results proved that the proposed technique has produced enhanced results such as residual energy, network lifetime and coverage rate than the related techniques. In Future, the analytical-enabled Optimization technique could be implemented to integrate the performance metrics of congestion, network Lifetime, coverage in dynamic environment of WSN. The congestion control technique will be tested in real-time integrated IoT applications like smart city and automation of Agriculture-enabled application.