Improving the performance of wireless sensor network using multi-hopping clustering partition

Clustering sensor nodes into groups is an efficient topology control approach for achieving long-term operation of Wireless Sensor Networks (WSNs). The performance of clustering is greatly influenced by the selection of Cluster Heads (CHs), which are in charge of creating clusters and controlling member nodes. Finding the optimal set of CHs is known to be non-deterministic polynomial (NP)-hard problem for a WSN. Evolutionary computation approaches can be applied to find fast and efficient solutions to such problems. In this paper, the problem of CHs election is formulated as a single-objective optimization problem, aiming to obtain clusters that maximize the network energy efficiency and link quality. The formulated problem has been solved using three Evolutionary approaches: Genetic Algorithms (GA), Differential Evolution (DE) and Particle Swarm Optimization (PSO). Their performance has been compared in terms of the achieved fitness value. In addition, the performance of the proposed protocol is evaluated and compared to well-known cluster-based sensor network protocols.

With the advantages of convenient communication and low cost, wireless sensor network (WSN) is widely used in many areas for information collection, and LEACH protocol is one of the routing protocol used in WSN. Therefore, optimizing LEACH protocol can improve the performance of WSN, including the speed, lifecycle and coverage. The optimization of LEACH protocol mainly focuses on improving network energy efficiency, reducing node energy consumption, improving ways to select cluster head nodes, and extending network lifetime. On the basis of extending the network lifetime, this paper optimized the energy allocation and choosing cluster heads. With our method, the new energy threshold is established, and the nodes whose energy is lower than the threshold is not eligible to compete for cluster heads. The amount of cluster heads that can minimize the total energy consumption of the network is found, as well as the optimal P- value is confirmed. The threshold formula for selecting cluster heads is optimized. The final results of simulation show the optimized node death time is significantly later than that before optimization, which can prolong the network lifecycle of LEACH protocol.

Wireless sensor networks (WSN) play a key role in enabling wireless communication technology among several nodes to remotely communicate and exchange information. WSN consists of tiny sensor nodes equipped with battery, scattered in an area to gather information around an environment and send to data collection node known as sink or base station (BS). WSN have been widely used in various applications like agriculture, fire detection, health care and military and has become imperative necessity for future revolutionary area like UAV (unmanned aerial vehicles), IoT (Internet of things) and smart cities which employs large scale sensor nodes. However sensor nodes are limited to battery, memory, low computational power, resource and bandwidth. Continues sensing of events, makes node to drain its battery faster and goes dead fast. For resource constrained WSN, hierarchical cluster based approaches are considered as energy efficient and improves network performance for large scale WSN. Minimizing energy consumption and extending network lifetime are major challenging issues of WSN, clustering methods with optimized routing have offered solution to optimize energy utilization. To balance energy consumption and improve network lifetime many existing hierarchical clustering approaches have been proposed, however existing method does not consider rotation of cluster head (CH) and considers cluster head selection based on residual energy and distance parameter. In this paper we propose an improved energy efficient cluster tree (IEECT) based routing to improve energy efficiency of hierarchical cluster. IEECT considers modification of existing LEACH (Low energy adaptive clustering hierarchy) protocol to improved energy efficient LEACH by considering energy parameters like residual node energy and average network energy. IEECT accounts optimal number of cluster head (CH) and selection of CH is done using threshold value among sensor nodes. Proposed IEECT combines tree based routing and data aggregation scheme to maintain desirable quality of service. Simulation experiments are carried out by using network simulator. Performance of IEECT is evaluated in terms of PDR, delay, energy consumption, network lifetime and overhead.

In Industrial Wireless Sensor Networks (IWSNs), Sybil attacks compromise network topology and reduce data reliability by forging virtual nodes, leading to degraded network performance and significantly diminished monitoring accuracy. To address these issues, this study aims to propose a high-accuracy and highly robust Sybil attack detection method to overcome the limitations of traditional detection approaches, such as low precision and difficulty in handling ambiguous probability boundaries. The research designs a collaborative detection mechanism that integrates a CNN-BiLSTM-Attention (CBSA) deep learning module with the K-means clustering algorithm. By combining "multidimensional feature extraction via deep learning + clustering-based classification boundary optimization," an end-to-end Sybil attack detection model (CBSA-Kmeans) is constructed.The specific implementation includes four parts: 1. A Convolutional Neural Network (CNN) processes the raw sensor data matrix to extract spatial local patterns and capture abnormal correlation features among nodes. 2. A Bidirectional Long Short-Term Memory network (BiLSTM) processes the feature sequences output by the CNN. The forward LSTM learns the "past-present" temporal dependencies to identify the cumulative effects of attacks, while the backward LSTM models the "present-past" temporal correlations to trace attack origins. 3. An Attention mechanism is introduced to dynamically focus on key time steps corresponding to critical attack features, generating a weighted context vector and outputting attack probability predictions. 4. The K-means clustering algorithm is employed to perform secondary partitioning on the prediction probability space output by the CBSA module. By measuring Euclidean distances, high-density attack clusters and normal data clusters are constructed to form decision regions, thereby optimizing classification boundaries.Through a progressive approach of "spatial feature extraction → temporal dependency modeling and key feature enhancement → probability space clustering optimization," the model achieves attack detection: CNN first performs preliminary spatial feature screening, BiLSTM and Attention collaboratively mine temporal attack features and highlight critical information, and finally, K-means clusters the prediction probabilities to clarify the boundaries between attack and normal data. Experimental results demonstrate that the CBSA-Kmeans model excels in IWSN Sybil attack detection tasks: it achieves a detection accuracy of 98.2% and a recall rate of 96.7%, representing an improvement of over 12% compared to traditional detection methods. Additionally, the model has minimal negative impact on network performance, increasing IWSN network throughput by 23.5% and reducing data transmission latency by 31.8%, while effectively addressing the ambiguous probability boundary issue present in traditional methods. In conclusion, the CBSA-Kmeans model achieves high-precision and highly robust detection of Sybil attacks in IWSNs through the synergistic integration of deep learning and clustering algorithms, validating the effectiveness and superiority of this collaborative detection mechanism. This method provides a practical technical solution for IWSN security protection, ensuring network topology integrity and data transmission reliability while enhancing operational efficiency and monitoring accuracy. It holds significant practical application value for ensuring the secure and stable operation of wireless sensor networks in industrial settings.

The increasing in the demand for Wireless Sensor Networks (WSNs) has intensified studies which are dedicated to obtain more energy-efficient solutions, since the energy storage limitation is critical in those systems. Additionally, there are other aspects which usually must be ensured in order to get an acceptable performance of WSNs, such as area coverage and network connectivity. This paper proposes a procedure for enhancing the performance of WSNs: a multiobjective hybrid optimization algorithm is employed for solving the Dynamic Coverage and Connectivity Problem (DCCP) in flat WSNs subjected to node failures. This method combines a multiobjective global on-demand algorithm (MGoDA), which improves the current DCCP solution using a Genetic Algorithm, with a local on line algorithm (LoA), which is intended to restore the network coverage soon after any failure. The proposed approach is compared with an Integer Linear Programming (ILP)-based approach and a similar mono-objective approach with regard to coverage, network lifetime and required running time for achieving the optimal solution provided by each method. Results achieved for a test instance show that the hybrid approach presented can improve the performance of the WSN obtaining good solutions with a considerably smaller computational time than ILP. The multiobjective approach still provides a feasible method for extending WSNs lifetime with slight decreasing in the network mean coverage.

Energy efficiency is critical in Wireless Sensor Networks (WSNs), pivotal for Internet of Things (IoT) applications like environmental monitoring and smart cities. Clustering protocols like Low-Energy Adaptive Clustering Hierarchy (LEACH) extend network lifetime through Cluster Head (CH) rotation, but random CH selection often leads to suboptimal energy use. This study evaluates eight hybrid Particle Swarm Optimization-based LEACH (PSO-LEACH) variants to optimize CH selection and clustering: FA-PSO-LEACH (Firefly Algorithm), CSA-PSO-LEACH (Crow Search Algorithm), PSO-LEACH with CBTEERA, Adaptive PSO-LEACH, ABC-PSO-LEACH (Artificial Bee Colony), ACO-PSO-LEACH (Ant Colony Optimization), WOA-PSO-LEACH (Whale Optimization Algorithm), and Hybrid GA-PSO-LEACH (Genetic Algorithm). The primary research objective is to compare these variants in terms of energy efficiency, network lifetime, and clustering quality to identify the most effective strategies for prolonging WSN operation in IoT environments. Specifically, this paper addresses the research question: Which hybrid PSO-LEACH variant provides the optimal balance between early-stage stability and long-term energy conservation in a simulated WSN with 50 nodes? Each variant uses a unique metaheuristic for CH selection based on residual energy and distance, with PSO refining clustering. A Python simulation modelled a 100m × 100m WSN with 50 nodes, assessing network lifetime (First Node Died, FND; Half Nodes Died, HND; Last Node Died, LND), energy consumption, and clustering quality. Results show ABC-PSO-LEACH leading with FND at 57 rounds and LND at 462 rounds, followed by WOA-PSO-LEACH (HND 148, LND 406), surpassing others (e.g., PSO-LEACH with CBTEERA: FND 10, LND 280). WOA-PSO-LEACH’s balanced energy distribution excels in mid-to-late stages, despite computational overhead. These bio-inspired hybrids outperform traditional LEACH, with ABC-PSO-LEACH and WOA-PSO-LEACH ideal for prolonged WSN operation. Future work aims to enhance early-stage performance and explore dynamic topologies.

Aim: This research aims to explore and evaluate various strategies for improving energy efficiency within wireless sensor networks (WSNs). Specifically, the study focuses on the critical challenge of extending network lifespan through energy conservation by establishing balanced clusters within the WSN architecture. Background: In wireless sensor networks (WSNs), ensuring prolonged network operation while conserving energy resources is a significant concern. One promising approach to address this challenge is the implementation of equalized clusters, which requires an effective selection of cluster heads (CHs). However, this task presents considerable complexity and demands innovative solutions to overcome. Objective: The primary objective of this study is to develop and assess a novel methodology for selecting precise cluster heads (CHs) within WSNs. This methodology is based on the utilization of Bluetooth low energy (BLE) sensors deployed in a randomly distributed manner across the study area. By employing an enhanced artificial neural network and greedy approach (EANN-GA), the proposed technique seeks to identify CHs with optimal proximity to the cluster center and substantial remaining energy reserves. Methods: The proposed methodology involves the deployment of BLE sensors distributed randomly throughout the study region, which are then organized into clusters. Using the enhanced artificial neural network and greedy approach (EANN-GA), the sensor node nearest to the cluster center with the highest remaining energy is selected as the cluster head (CH). Additionally, a mobile sink (MS) is introduced to harness the power of CHs, and the number of paths utilized by the MS is estimated through a genetic approach. Based on this path information, the MS enters each cluster to initiate the data-gathering process. Results: Performance analysis of the presented methodology demonstrates significant improvements in energy efficiency and the extension of network lifetime. By employing the proposed EANN-GA technique for CH selection and optimizing MS path utilization, the study showcases enhanced operational effectiveness within WSNs. Conclusion: The findings of this research underscore the effectiveness of the proposed methodology in enhancing energy efficiency and prolonging the lifespan of wireless sensor networks. Through the innovative integration of BLE sensors, EANN-GA CH selection, and genetic-based MS path estimation, the study contributes valuable insights toward addressing the critical challenges of energy conservation in WSNs.

Ensuring stability and extending network lifetime in Wireless Sensor Networks (WSNs) achieved through significantly reduced energy consumption is considered as a potential challenge. The selection of Cluster Head (CH) during the process of clustering is determined to be highly complicated in spite of its role in facilitating efficient and balanced energy consumption in the network. In this paper, Hybrid Stochastic Ranking and Opposite Differential Evolution enhanced Firefly Algorithm (HSRODE-FFA)-based clustering protocol is proposed for handling the issues of location-based CH selection approaches that select duplicate nodes with increased computation and poor selection accuracy. This HSRODE-FFA clustering scheme includes the process of sampling for selecting the CHs from among the sensor nodes that exist in the sample population and address the problems introduced by different locations of nodes and CHs. It is proposed as an attempt to improve stability and lifetime of WSNs based on the merits of Stochastic Firefly Ranking (SFR) that enhances the exploration capability of Firefly Algorithm (FFA). The hybridization of the enhanced FFA with Opposition Differential Evolution (ODE) aids in speeding and ensuring optimal exploitation in the selection of CHs. The proposed HSRODE-FFA thereby maintains a balance between the rate of exploitation and exploration for deriving mutual benefit of rapid and potential selection of CHs from the sampling population. The experimental results of the proposed HSRODE-FFA scheme confirm an enhanced stability period and network lifetime of 16.21% and 13.86% respectively in contrast to the benchmarked Harmony Search and Firefly Algorithm-based Cluster Head Selection (HSFFA-CHS), Krill Herd Optimization and Genetic Algorithm-based Cluster Head Selection (KHOGA-CHS), Particle Swarm Optimization with Energy Centers Searching-based Cluster Head Selection (PSO-ECS-CHS) and Spider Monkey Optimization-based Cluster Head Selection (SMO-CHS) schemes.

LEACH protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of lifetime and throughput related to the time length of each round are deduced. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.

Adaptive data aggregation scheme in clustered wireless sensor networks

Prolonged network lifetime, scalability and efficient load balancing are essential for optimal performance of a wireless sensor network. Clustering provides an effective way of extending the lifetime of a sensor network. Clustering is the process that divides sensor networks into smaller localized group (called clusters) of members with a cluster head. Clustering protocols need to elect optimal number of clusters in hierarchically structured wireless sensor networks. Any clustering scheme that elects clusters uniformly (irrespective of the distance from Base Station) incurs excessive energy usage on clusters proximal and distant to Base Station. In single hop networks a gradual increment in the energy depletion rate is observed as the distance from the cluster head increases[17]. This work focuses on the analysis of wasteful energy consumption within a uniform cluster head election model (EPEM) and provides an analytical solution to reduce the overall consumption of energy usage amongst the clusters elected in a wireless sensor network. A circular model of sensor network is considered, where the sensor nodes are deployed around a centrally located Base Station. The sensor network is divided into several concentric rings centred at the Base Station. A model, Unequal Probability Election Model (UEPEM), which elects cluster heads non-uniformly is proposed. The probability of cluster head election depends on the distance from the Base Station. UEPEM reduces the overall energy usage by about 21% over EPEM. The performance of UEPEM improves as the number of rings is increased.

SummaryThe arbitrary distribution of sensor nodes and irregularity of the routing path led to unordered data, which is complex to handle in a wireless sensor network (WSN). To increase WSN lifetime, data aggregation models are developed to minimize energy consumption or ease the computational burden of nodes. The compressive sensing (CS) provides a new technique for prolonging the WSN lifetime. A hybrid optimized model is devised for cluster head (CH) selection and CS‐based data aggregation in WSN. The method aids to balance the energy amidst different nodes and elevated the lifetime of the network. The hybrid golden circle inspired optimization (HGCIO) is considered for cluster head (CH) selection, which aids in selecting the CH. The CH selection is done based on fitness functions like distance, energy, link quality, and delay. The routing is implemented with HGCIO to transmit the data projections using the CH to sink and evenly disperse the energy amidst various nodes. After that, compressive sensing is implemented with the Bayesian linear model. The convolutional neural network‐long short term memory (CNN‐LSTM) is employed for the data aggregation process. The proposed HGCIO‐based CNN‐LSTM provided the finest efficiency with a delay of 0.156 s, an energy of 0.353 J, a prediction error of 0.044, and a packet delivery ratio (PDR) of 76.309%.

The advantages of deploying mobile sinks (MSs) in wireless sensor networks (WSNs) have attracted tremendous attention recently, because mobility of a sink provides an efficient method to improve data gathering performance in WSNs. However, in such kind of WSN, the efficiency of data dissemination is obviously affected by the trajectory of the MS. Therefore, optimal moving schemes of the MS have been studied in many researches. Nevertheless, in many cases, the trajectory of the MS is not able to change ideally as previous studies assumed but depending on the environmental conditions. In this paper, we focus on the efficiency of data gathering in WSN with a MS whose trajectory cannot change ideally and propose a new data diffusion scheme - implementing a new Pre-Diffusion Algorithm (PDA) in a hierarchical WSN aimed at improving data gathering efficiency. This hierarchical WSN is composed of several clusters, and datatransmission is done by higher powered cluster head (CH) node. Our scheme predetermines the cluster area where the MS is going to arrive in most probability in next period of time. MS fulfills data converging in the cluster head (CH)whose distance to the MS may the smallest compared with other CHs when data gathering starts. Thus more data can be collected with less trajectory length of MS. Simulation results show that our proposed scheme improves data gathering efficiency as compared to conventional scheme.

To improve the performance of Wireless Sensor Networks (WSN), this study offers a novel energy-efficient clustering and routing technique based on the Coot Optimization Algorithm (COA). This addresses issues such as high energy consumption, communication delays, and security. To ensure energy savings and network reliability, the fitness function evaluates cluster heads and best routes based on constraints. COOT outperforms other Metaheuristics Algorithms like Butterfly Optimization Algorithm, Genetic Algorithm, Tunicate Swarm Gray Wolf Optimization Algorithm, and Bird Swarm Algorithm in simulation with performance measurements and enhancing network functionality and protection. Key methodology points include:•Proposed a multiple constraints clustering and routing technique using COAto solve the most crucial issues that arise in WSNs.•Integrated an advanced fitness function that determines cluster head selection, and the routing path based on residual energy, delay, security, trust, distance, and link quality so that energy load is evenly distributed and credible data flow is maintained across the network and made Innovative and Effective Solution.•Proven Results Demonstrated superior network performance, achieving the lowest delay, highest network lifetime (3571 rounds) and enhanced security (0.8) and trust (0.6) compared to existing algorithms with less energy consumption, making it the most suitable solution for WSN performance improvement.

Wireless sensor network routing protocols are basically used to provide the function of data routing towards the sink and are vulnerable to various attacks. LEACH is a one of the routing protocol used for clustered implementation of wireless sensor network with Received Signal Strength based dynamic selection of Cluster Heads. But, as with other routing protocols, the LEACH is also exposed to attacks when the malicious sensor node becomes the Cluster Head by launching Sybil attack. Cluster heads are vulnerable to various malicious attacks and this greatly affects the performance of the wireless sensor network. Cryptographic and non-cryptographic approaches to detect the presence of attack also exist but they lack efficiency in some way. Cryptographic approaches to prevent this attack are not so helpful though some non-cryptographic methods to detect the attack also exist but they are not too efficient as they result in large test packet overhead. In this paper, we propose SRSRP (Sybil Resistant Secure Routing Protocol) extension to LEACH protocol so as to protect the cluster head against Sybil attack. SRSRP is base on encryption using Armstrong number and decryption using AES algorithm to verify the identity of cluster head. The proposed technique is implemented in NS2, the experimental results clearly indicate the proposed technique has significant capability for the detection of Sybil attack launched for making the malicious node as the cluster head.