Cluster Nodes Research Articles

Linear Clustering Process on Networks

We propose a linear clustering process on a network consisting of two opposite forces: attraction and repulsion between adjacent nodes. Each node is mapped to a position on a one-dimensional line. The attraction and repulsion forces move the nodal position on the line, depending on how similar or different the neighbourhoods of two adjacent nodes are. Based on each node position, the number of clusters in a network and each node's cluster membership is estimated. The performance of the proposed linear clustering process is benchmarked on synthetic networks against widely accepted clustering algorithms such as modularity, Leiden method, Louvain method and the non-back tracking matrix. The proposed linear clustering process outperforms the most popular modularity-based methods, such as the Louvain method, on synthetic and real-world networks, while possessing a comparable computational complexity.

USING SLURM WORKLOAD MANAGER FOR MANAGING SUPERCOMPUTERS AND LINUX CLUSTERS

The article is dedicated to the use of the Slurm Workload Manager for managing supercomputers and Linux clusters and highlighting the importance and advantages of using the Slurm Workload Manager in resource management on multi-user systems. Within the research, existing workload management systems and their limitations were analyzed. Based on this analysis, it was found that Slurm is one of the most widely used and efficient solutions in the field of resource management on multi-user systems. The article provides a detailed examination of the functionality of Slurm, including its core functions such as resource scheduling, task distribution, and system monitoring. Slurm allows users to efficiently utilize computational resources, distribute tasks among cluster nodes, ensure optimal CPU time usage, and control the system load. These features enable high productivity and efficiency in resource utilization. The advantages of Slurm compared to other resource management systems are presented in the article. Slurm is noted for its flexibility and the ability to configure various types of resources, as well as support for different scheduling algorithms. Limitations and challenges associated with using Slurm are also mentioned, providing readers with a comprehensive understanding of its capabilities and potential considerations for implementation. This article will provide readers with a detailed overview of the Slurm Workload Manager, its core functions, advantages, and limitations. With the comprehensive analysis and description of Slurm's core functions, the article will serve as an invaluable source of information for professionals working with large-scale computing clusters and supercomputers. It will also be beneficial for those interested in exploring best practices in resource management on multi-user systems and learning effective strategies for utilizing the Slurm Workload Manager.

Community Discovery Algorithm Based on Multi-Relationship Embedding

Complex systems in the real world often can be modeled as network structures, and community discovery algorithms for complex networks enable researchers to understand the internal structure and implicit information of networks. Existing community discovery algorithms are usually designed for single-layer networks or single-interaction relationships and do not consider the attribute information of nodes. However, many real-world networks consist of multiple types of nodes and edges, and there may be rich semantic information on nodes and edges. The methods for single-layer networks cannot effectively tackle multi-layer information, multi-relationship information, and attribute information. This paper proposes a community discovery algorithm based on multi-relationship embedding. The proposed algorithm first models the nodes in the network to obtain the embedding matrix for each node relationship type and generates the node embedding matrix for each specific relationship type in the network by node encoder. The node embedding matrix is provided as input for aggregating the node embedding matrix of each specific relationship type using a Graph Convolutional Network (GCN) to obtain the final node embedding matrix. This strategy allows capturing of rich structural and attributes information in multi-relational networks. Experiments were conducted on different datasets with baselines, and the results show that the proposed algorithm obtains significant performance improvement in community discovery, node clustering, and similarity search tasks, and compared to the baseline with the best performance, the proposed algorithm achieves an average improvement of 3.1% on Macro-F1 and 4.7% on Micro-F1, which proves the effectiveness of the proposed algorithm.

Stability Conditions for Cluster Synchronization in Directed Networks of Diffusively Coupled Nonlinear Systems

This paper investigates the stability issue of cluster synchronization manifold in networks of diffusively-coupled nonlinear system with directed topology. It is assumed that each cluster subdigraph is strongly connected and contains only cooperative interactions, but there may exist competitions among nodes of different clusters. In the case that the clusters meet the cluster-input-equivalence condition and each nonlinear system has a forward invariant set over which the system possesses a bounded Jacobian, some local stability conditions of cluster synchronization are derived. These conditions are expressed as an inequality of the matrix measure of the system’s Jacobian matrix, the matrix measure of a reduced-order matrix about the digraph among the clusters, the coupling strength, and some eigenvalue conditions of the subdigraphs. Finally, the theoretical findings are validated by two numerical examples about coupled Lorenz-like system and coupled Hopfield neural network, respectively.

An Improved Lifetime and Energy Consumption with Enhanced Clustering in WSNs

A wireless sensor network (WSN) is made up of sensor nodes that communicate via radio waves in order to conduct sensing functions. In WSN, the location of the base station is critical. Although base stations are fixed, they may move in response to data received from sensor nodes under specific conditions. Clustering is a highly efficient approach of minimising energy use. The issues of extending the life of WSNs and optimising their energy consumption have been addressed in this paper. It has been established that integrating mobile sinks into wireless sensor networks extends their longevity. Thus, this research proposes an optimal clustering and routing technique for optimising the energy usage and lifetime of WSNs. To minimise energy consumption, this research employs movable and stationary sink nodes. The K-Medoid clustering model is used to generate the initial number of nodes in the various clusters. After that, the cluster head is chosen using a hybrid Interval Type-2 Fuzzy technique that takes three aspects into account: residual energy, node centrality, and neighbourhood. A highly efficient backup cluster head (CH) collecting system can provide in significant energy savings while also prolonging the system’s life. Finally, better Reinforcement learning combined with a Genetic algorithm routing protocol is used to ensure effective data delivery. The suggested approach’s efficacy is evaluated in comparison to earlier approaches utilising residual node energy, delay or average delay, packet delivery ratio, throughput, network longevity, average energy consumption, and multiple alive nodes. In experiments, the proposed strategy outperforms existing strategies.

An optimized framework for VANET routing: A multi-objective hybrid model for data synchronization with digital twin

The utilization of Digital Twin technology allows for the simulation of network behavior, anticipating traffic surges, and implementing efficient traffic routing strategies to prevent congestion. This enhances network efficiency and improves overall speed. However, VANETs (Vehicular Ad-Hoc Networks) pose unique challenges due to their dynamic nature and frequent network disconnects. Developing and implementing effective VANET routing protocols becomes complex considering these factors. To address these challenges, a novel hybrid optimization model is proposed in this research. The model comprises optimal Cluster Head (CH) selection for data transmission. The clustering of mobile nodes is initially performed, but ensuring consistency in fast-paced environments remains a significant challenge. Therefore, the selection of the most suitable node as the CH is crucial. This research introduces a novel route selection mechanism that focuses on optimal CH selection. Multiple objectives such as mean routing load, packet delivery ratio, throughput, End-to-End Delay, and Control packet overhead are considered in the CH selection process. To determine the ideal CH from a pool of potential candidates, a new hybrid optimization model called Hunger's Foraging Behavior Customized Honey Badger Optimization (HFCHBO) is introduced. The HFCHBO combines the standard Honey Badger Algorithm (HBA) with Hunger Games Search (HGS). This hybrid model effectively formulates successful routing paths for data transmission between vehicles and the CH to the Base Station (BS). By combining these two approaches, the HFCHBO model aims to overcome the limitations of traditional clustering algorithms in ensuring consistent performance in dynamic environments. The proposed route selection mechanism incorporates multiple objectives to evaluate the performance of potential CHs, including mean routing load, packet delivery ratio, throughput, End-to-End Delay, and Control packet overhead. To facilitate data transmission between vehicles and the CH to the Base Station (BS), the HFCHBO model formulates successful routing paths. By utilizing the simulation capabilities of the Digital Twin technology, the model analyzes the network behavior, predicts traffic patterns, and makes informed decisions on routing strategies.

Acceleration of Bi-Objective Optimization of Data-Parallel Applications for Performance and Energy on Heterogeneous Hybrid Platforms

Accelerating the bi-objective optimization of applications for performance and energy is crucial to achieving energy efficiency objectives and meeting quality-of-service requirements in modern high-performance computing platforms and cloud computing infrastructures. In this work, we highlight the crucial challenges to accelerate model-based methods proposed for the bi-objective optimization of data-parallel applications for performance and energy that employ workload distribution between the executing processors as the decision variable. The methods solve unconstrained bi-objective optimization problems and take input, the processors’ performance and energy profiles in the form of discrete functions of workload size, and output Pareto-optimal solutions (workload distributions), minimizing the execution time and the total energy consumption of computations during the parallel execution of the application. One of the challenges is the fast computation of Pareto-optimal solutions. We then formulate the bi-objective optimization problem of data-parallel applications for performance and energy through workload distribution on a cluster of p identical hybrid nodes, each containing h heterogeneous processors. The state-of-the-art algorithm for solving the problem is sequential and takes exorbitant execution times to find Pareto-optimal solutions for even moderate numbers of processors. We propose two algorithms that address this shortcoming. The first algorithm is an exact sequential algorithm that is more efficient and amenable to parallelization and achieves a complexity reduction of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i> (m × h) over the state-of-the-art sequential algorithm where m is the cardinality of the input discrete execution time and dynamic energy functions. The second algorithm is a parallel algorithm executed by q identical parallel processes that reduces the complexity of our proposed sequential algorithm by <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i> (q) and therefore achieves a complexity reduction of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i> (m×h×q) over the state-of-the-art sequential algorithm. Finally, we experimentally analyze the practical efficacy of our proposed algorithms for two data-parallel applications, matrix multiplication and fast Fourier transform, on a heterogeneous hybrid node containing an Intel Haswell multicore CPU, an Nvidia k40c GPU, and an Nvidia P100 GPU and simulations of clusters of such hybrid nodes. The experiments demonstrate that our proposed algorithms provide tremendous speedups over state-of-the-art solutions.

Particle Swarm–Grey Wolf Cooperation Algorithm Based on Microservice Container Scheduling Problem

In recent years, microservices have been very widely used as a new application development technology in edge computing, IoT, and cloud computing. Application containerization technology is one of its core technologies, which allows multiple containers to be deployed within the same physical node. Then a single physical node could provide different services to user. How to rationally deploy containers on a cluster of physical nodes is one of the main research directions nowadays. Although a number of researchers have modeled the microservice container scheduling problem and proposed effective solutions, there are still shortcomings, for example, the slow speed of finding the optimal solution and the tendency of the algorithm to fall into local optimality. This paper propose a Particle Swarm - Grey Wolf Cooperation Algorithm based on Microservice Container Scheduling Problem (PS-GWCA) by using particle swarm optimization algorithm (PSO) and grey wolf algorithm (GWO) in a multi-core parallel way, which enables the two algorithms to complement each other in the whole search process through the information exchange between populations. In the early of the search stage, the GWO can use its global search capability to guide the PSO to jump out of the local optimum to avoid premature convergence, and in the late of the search stage, the PSO can enhance the search capability of the GWO on the pareto optimal frontier. The experimental results show that compared with the other three algorithms, the algorithm optimizes 18.07% in network transmission cost, 14.67% in local load balancing, 20.66% in global load balancing, and 7.5% in search speed, and 5.69% in service reliability.

An Improved Multi-Objective Particle Swarm Optimization Routing on MANET

A Mobile Ad hoc Network (MANET) is a group of low-power consumption of wireless mobile nodes that configure a wireless network without the assistance of any existing infrastructure/centralized organization. The primary aim of MANETs is to extend flexibility into the self-directed, mobile, and wireless domain, in which a cluster of autonomous nodes forms a MANET routing system. An Intrusion Detection System (IDS) is a tool that examines a network for malicious behavior/policy violations. A network monitoring system is often used to report/gather any suspicious attacks/violations. An IDS is a software program or hardware system that monitors network/security traffic for malicious attacks, sending out alerts whenever it detects malicious nodes. The impact of Dynamic Source Routing (DSR) in MANETs challenging blackhole attack is investigated in this research article. The Cluster Trust Adaptive Acknowledgement (CTAA) method is used to identify unauthorised and malfunctioning nodes in a MANET environment. MANET system is active and provides successful delivery of a data packet, which implements Kalman Filters (KF) to anticipate node trustworthiness. Furthermore, KF is used to eliminate synchronisation errors that arise during the sending and receiving data. In order to provide an energy-efficient solution and to minimize network traffic, route optimization in MANET by using Multi-Objective Particle Swarm Optimization (MOPSO) technique to determine the optimal number of clustered MANET along with energy dissipation in nodes. According to the research findings, the proposed CTAA-MPSO achieves a Packet Delivery Ratio (PDR) of 3.3%. In MANET, the PDR of CTAA-MPSO improves CTAA-PSO by 3.5% at 30% malware.

Realizing avalanche criticality in neuromorphic networks on a 2D hBN platform.

Networks and systems which exhibit brain-like behavior can analyze information from intrinsically noisy and unstructured data with very low power consumption. Such characteristics arise due to the critical nature and complex interconnectivity of the brain and its neuronal network. We demonstrate a system comprising of multilayer hexagonal boron nitride (hBN) films contacted with silver (Ag), which can uniquely host two different self-assembled networks, which are self-organized at criticality (SOC). This system shows bipolar resistive switching between the high resistance state (HRS) and the low resistance state (LRS). In the HRS, Ag clusters (nodes) intercalate in the van der Waals gaps of hBN forming a network of tunnel junctions, whereas the LRS contains a network of Ag filaments. The temporal avalanche dynamics in both these states exhibit power-law scaling, long-range temporal correlation, and SOC. These networks can be tuned from one to another with voltage as a control parameter. For the first time, two different neural networks are realized in a single CMOS compatible, 2D material platform.

Nonlinear Energy Optimization in the Wireless Sensor Network through NN‐LEACH

Researchers have developed a range of methods and strategies to decrease wireless sensor network energy consumption. Mote clustering is one of the competent topological control approaches to boost the networks’ energy efficiency, scalability, and performance. Energy is dissipated during the cluster creation, cluster head selection, routing from the head and base stations of the cluster, and data aggregation—clustering and routing emphasis on the stability and the longevity of the network. This research work provides the optimization technique for the wireless sensor network to optimize the energy through NN‐LEACH. The main goal is to extend network life and reduce power consumption by clustering and routing sensor nodes using the two‐step NN‐LEACH protocol, which is suggested. An additional goal might be to establish the appropriate course of action for the suggested approach for this network.

Data Representation via Attribute Selection- Propagation Neural Network

Graph Convolutional Networks (GCNs) have been commonly studied for attribute graph data representation. It is known that the core of Graph Convolution (GC) operation is to define a specific graph propagation operation for graph node's attributes. Existing GCs mainly perform propagation over node's all attributes. However, this ‘full’ propagation may be unreasonable on some practical learning tasks and also be vulnerable to the noisy attributes. To address this issue, in this paper, we propose a novel Attribute Selection-Propagation (ASP) mechanism for attribute graph data representation by incorporating attribute selection into GCs. The main aspect of the proposed ASP is that it can be formulated as a <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">regularization model</b> based on which we can derive a simple update rule to implement ASP in a <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">self-supervised</b> manner. ASP aims to adaptively propagate some optimal attributes of node to better serve message passing in GCs. Using ASP, we then present a novel graph neural network, named ASPNet for attribute graph representation and learning. Experiments on several graph learning tasks including node classification, clustering and link prediction demonstrate the effectiveness of the proposed ASPNet.

Metaheuristics Based Node Localization Approach for Real-Time Clustered Wireless Networks

In recent times, real time wireless networks have found their applicability in several practical applications such as smart city, healthcare, surveillance, environmental monitoring, etc. At the same time, proper localization of nodes in real time wireless networks helps to improve the overall functioning of networks. This study presents an Improved Metaheuristics based Energy Efficient Clustering with Node Localization (IM-EECNL) approach for real-time wireless networks. The proposed IM-EECNL technique involves two major processes namely node localization and clustering. Firstly, Chaotic Water Strider Algorithm based Node Localization (CWSANL) technique to determine the unknown position of the nodes. Secondly, an Oppositional Archimedes Optimization Algorithm based Clustering (OAOAC) technique is applied to accomplish energy efficiency in the network. Besides, the OAOAC technique derives a fitness function comprising residual energy, distance to cluster heads (CHs), distance to base station (BS), and load. The performance validation of the IM-EECNL technique is carried out under several aspects such as localization and energy efficiency. A wide ranging comparative outcomes analysis highlighted the improved performance of the IM-EECNL approach on the recent approaches with the maximum packet delivery ratio (PDR) of 0.985.

Range and strength of mechanical interactions of force dipoles in elastic fiber networks.

Mechanical forces generated by myosin II molecular motors drive diverse cellular processes, most notably shape change, division and locomotion. These forces may be transmitted over long range through the cytoskeletal medium - a disordered, viscoelastic network of biopolymers. The resulting cell size scale force chains can in principle mediate mechanical interactions between distant actomyosin units, leading to self-organized structural order in the cell cytoskeleton. Inspired by such force transmission through elastic structures in the cytoskeleton, we consider a percolated fiber lattice network, where fibers are represented as linear elastic elements that can both bend and stretch, and the contractile activity of myosin motors is represented by force dipoles. Then, by using a variety of metrics, we show how two such contractile force dipoles interact with each other through their mutual mechanical deformations of the elastic fiber network. As a prelude to two-dipole interactions, we quantify how forces propagate through the network from a single anisotropic force dipole by analyzing clusters of nodes connected by highly strained bonds, as well as through the decay rate of strain energy with distance from a force dipole. We show that predominant fiber bending screens out force propagation, resulting in reduced and strongly network configuration-dependent dipole interactions. On the other hand, stretching-dominated networks support longer-ranged inter-dipole interactions that recapitulate the predictions of linear elasticity theory. By characterizing the differences between tensile and compressive force propagation in the fiber network, we show how inter-dipole interaction depends on the dipoles' mutual separation and orientation. The resulting elastic interaction energy may mediate a force between multiple distant dipoles, leading to their self-organization into ordered configurations. This provides a potential pathway for active mechanical force-driven structural order in elastic biopolymer networks.

Cluster analysis-based big data mining method of e-commerce consumer behaviour

In order to overcome the problems of low precision and long time of data mining in traditional big data mining methods of consumer behaviour, a clustering analysis method for big data mining of e-commerce consumer behaviour is proposed. In this paper, the K-means algorithm is used to calculate the similarity of behaviour clustering nodes of fee payers, determine the clustering process of consumer behaviour data and determine the mining weight of behaviour data. According to the FCM clustering algorithm, the target function for data mining of e-commerce consumer behaviour is constructed. According to Lagrange multiplication, the membership degree of consumer behaviour data is obtained, and the big data mining of consumer behaviour in e-commerce is realised. The experimental results show that with the method proposed in this paper, when the number of consumers is 500, the time for big data mining of consumer behaviour is 15.6s and the accuracy of behaviour big data mining is 95.34%.

Reinforcement Learning for Delay Tolerance and Energy Saving in Mobile Wireless Sensor Networks

Reinforcement Learning (RL) has emerged as a promising approach for improving the performance of Wireless Sensor Networks (WSNs). The Q-learning technique is one approach of RL in which the algorithm continuously learns by interacting with the environment, gathering information to take certain actions. It maximizes performance by determining the optimal result from that environment. In this paper, we propose a data gathering algorithm based on a Q-learning approach named Bounded Hop Count - Reinforcement Learning Algorithm (BHC-RLA). The proposed algorithm uses a reward function to select a set of Cluster Heads (CHs) to balance between the energy-saving and data-gathering latency of a mobile Base Station (BS). In particular, the proposed algorithm selects groups of CHs to receive sensing data of cluster nodes within a bounded hop count and forward the data to the mobile BS when it arrives. In addition, the CHs are selected to minimize the BS tour length. Extensive experiments by simulation were conducted to evaluate the performance of the proposed algorithm against another traditional heuristic algorithm. We demonstrate that the proposed algorithm outperforms the existing work in the mean of the length of a mobile BS tour and a network’s lifetime.

A NEURO-GAME MODEL OF STRATEGY ANALYSIS DURING THE DYNAMIC INTERACTION OF PHISHING ATTACK PARTICIPANTS

Cloud computing is a dynamically evolving computing paradigm. The demand for cloud applications and technologies has especially increased during the CoVID-19 pandemic and martial law in Ukraine. The main purpose of using cloud applications and technologies is to free users of cloud resources from managing hardware and software. One of the challenges in designing a private university cloud is estimating the required number of virtualization cluster nodes. These hosts host virtual machines (VMs) of users. These VMs can be used by students and teachers to complete academic assignments as well as scientific work. The second task is to optimize the placement of VMs in the computer network (CN) of the university, which makes it possible to reduce the number of CN nodes without affecting functionality. And this ultimately helps to reduce the cost of such a solution to deploy a private university cloud, which is not unimportant for Ukrainian universities under martial law. The article proposes a model for estimating the required number of virtualization cluster nodes for a private university cloud. The model is based on a combined approach that involves jointly solving the problem of optimal packing and finding, using a genetic algorithm, the configuration of server platforms of a private university cloud.

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 JSOUCP-MHP 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 JSOUCP-MHP technique over other models.

Energy-Efficient UAV Trajectory Planning based on Flexible Segment Clustering Algorithm

This paper plans the energy-efficient UAV trajectory when a UAV gathers data from massive IoT devices in a given area. The UAV trajectory design is addressed by two steps, i.e., IoT node clustering and UAV flight path planning for scanning the clusters, which are formulated as Cluster Minimization (CM) problem and Traveling Salesman Problem (TSP) in this work, respectively. The CM aims to contribute fewest clusters with minimal overlap to cover all the IoT devices and the per cluster size approaching the UAV communication coverage. On the other hand, the TSP seeks to design the shortest flight path to cover all the grouped clusters while minimizing energy consumption. Specifically, this work mainly focuses on the CM problem since the TSP issues have been well addressed in the past. In particular, we design a two-stage ILP optimization model to formulate the CM problem and propose two flexible clustering algorithms with low complexity, i.e., segment clustering (SC) and its variant, saying shifted SC (SSC). For the proposed ILP model and algorithms, we conduct extensive simulations under five different topologies and compare the performance results with existing methods. The simulation results indicate that the performance achieved by the proposed SSC algorithm is closest to the optimal results obtained from the ILP model. Moreover, it outperforms the existing methods under most topologies regarding cluster numbers, trajectory path length, and power consumption.

Energy-Efficient Routing Using Novel Optimization with Tabu Techniques for Wireless Sensor Network

Wireless Sensor Network (WSN) consists of a group of limited energy source sensors that are installed in a particular region to collect data from the environment. Designing the energy-efficient data collection methods in large-scale wireless sensor networks is considered to be a difficult area in the research. Sensor node clustering is a popular approach for WSN. Moreover, the sensor nodes are grouped to form clusters in a cluster-based WSN environment. The battery performance of the sensor nodes is likewise constrained. As a result, the energy efficiency of WSNs is critical. In specific, the energy usage is influenced by the loads on the sensor node as well as it ranges from the Base Station (BS). Therefore, energy efficiency and load balancing are very essential in WSN. In the proposed method, a novel Grey Wolf Improved Particle Swarm Optimization with Tabu Search Techniques (GW-IPSO-TS) was used. The selection of Cluster Heads (CHs) and routing path of every CH from the base station is enhanced by the proposed method. It provides the best routing path and increases the lifetime and energy efficiency of the network. End-to-end delay and packet loss rate have also been improved. The proposed GW-IPSO-TS method enhances the evaluation of alive nodes, dead nodes, network survival index, convergence rate, and standard deviation of sensor nodes. Compared to the existing algorithms, the proposed method outperforms better and improves the lifetime of the network.