Algorithm For Wireless Sensor Networks Research Articles

A Review on Energy and Latency Efficient Routing Protocol Design for Wireless Sensor Networks

Wireless sensor networks (WSNs) have been utilized by various industries, such as disaster management, the chemical and heavy industries, marine research, and space exploration. One of the primary challenges faced by wireless sensor networks is their limited network lifetime. Several techniques have been devised to extend the duration of network operation. This proposed method introduces a threshold-based algorithm to minimize the amount of data that needs to be transferred. In this approach, the selection of cluster heads and their sizes is not fixed. Instead, they are dynamically determined at the beginning of each iteration. The design of routing algorithms for wireless sensor networks faces three main challenges: lowering the rate at which the average node energy declines, minimizing the number of dead nodes, and eventually prolonging the network's lifetime. This paper provides a thorough examination of efficient routing protocols for wireless sensor networks with the goal of improving network longevity. Keywords: Efficient Routing, WSN Clustering, Network Latency, Network Lifetime.

HBO-SROA: Honey Badger optimization based clustering with secured remora optimization based routing algorithm in wireless sensor networks

HBO-SROA: Honey Badger optimization based clustering with secured remora optimization based routing algorithm in wireless sensor networks

Retraction Note: Node fault diagnosis algorithm for wireless sensor networks based on BN and WSN

This article has been retracted. Please see the Retraction Notice for more detail: https://doi.org/10.1186/s13635-023-00149-w.

A DRL-based Partial Charging Algorithm for Wireless Rechargeable Sensor Networks

Breakthroughs in Wireless Energy Transfer (WET) technologies have revitalized Wireless Rechargeable Sensor Networks (WRSNs). However, how to schedule mobile chargers rationally has been quite a tricky problem. Most of the current work does not consider the variability of scenarios and how many mobile chargers should be scheduled as the most appropriate for each dispatch. At the same time, the focus of most work on the mobile charger scheduling problem has always been on reducing the number of dead nodes, and the most critical metric of network performance, packet arrival rate, is relatively neglected. In this paper, we develop a DRL-based Partial Charging (DPC) algorithm. Based on the number and urgency of charging requests, we classify charging requests into four scenarios. And for each scenario, we design a corresponding request allocation algorithm. Then, a Deep Reinforcement Learning (DRL) algorithm is employed to train a decision model using environmental information to select which request allocation algorithm is optimal for the current scenario. After the allocation of charging requests is confirmed, to improve the Quality of Service (QoS), i.e., the packet arrival rate of the entire network, a partial charging scheduling algorithm is designed to maximize the total charging duration of nodes in the ideal state while ensuring that all charging requests are completed. In addition, we analyze the traffic information of the nodes and use the Analytic Hierarchy Process (AHP) to determine the importance of the nodes to compensate for the inaccurate estimation of the node’s remaining lifetime in realistic scenarios. Simulation results show that our proposed algorithm outperforms the existing algorithms regarding the number of alive nodes and packet arrival rate.

Cluster-based wireless sensor network framework for denial-of-service attack detection based on variable selection ensemble machine learning algorithms

A Cluster-Based Wireless Sensor Network (CBWSN) is a system designed to remotely control and monitor specific events or phenomena in areas such as smart grids, intelligent healthcare, circular economies in smart cities, and underwater surveillance. The wide range of applications of technology in almost every field of human activity exposes it to various security threats from cybercriminals. One of the pressing concerns that requires immediate attention is the risk of security breaches, such as intrusions in wireless sensor network traffic. Poor detection of denial-of-service (DoS) attacks, such as Grayhole, Blackhole, Flooding, and Scheduling attacks, can deplete the energy of sensor nodes. This can cause certain sensor nodes to fail, leading to a degradation in network coverage or lifetime. The detection of such attacks has resulted in significant computational complexity in the related works. As new threats arise, security attacks get more sophisticated, focusing on the target system's vulnerabilities. This paper proposed the development of Cluster-Based Wireless Sensor Network and Variable Selection Ensemble Machine Learning Algorithms (CBWSN_VSEMLA) as a security threats detection system framework for DoS attack detection. The CBWSN model is designed using a Fuzzy C-Means (FCM) clustering technique, whereas VSEMLA is a detection system comprised of Principal Component Analysis (PCA) for feature selection and various ensemble machine learning algorithms (Bagging, LogitBoost, and RandomForest) for the detection of grayhole attacks, blackhole attacks, flooding attacks, and scheduling attacks. The experimental results of the model performance and complexity comparison for DoS attack evaluation using the WSN-DS dataset show that the PCA_RandomForest IDS model outperforms with 99.999 % accuracy, followed by the PCA_Bagging IDS model with 99.78 % accuracy and the PCA_LogitBoost model with 98.88 % accuracy. However, the PCA_RandomForest model has a high computational complexity, taking 231.64 s to train, followed by the PCA_LogitBoost model, which takes 57.44 s to train, and the PCA_Bagging model, which takes 0.91 s to train to be the best in terms of model computational complexity. Thus, the models surpassed all baseline models in terms of model detection accuracy on flooding, scheduling, grayhole, and blackhole attacks.

Data fusion algorithm of wireless sensor network based on clustering and fuzzy logic

Data fusion algorithm of wireless sensor network based on clustering and fuzzy logic

Enhancement of Tiny Encryption Algorithm for Resource-Constrained WSNs Using Four Connected Additive Fibonacci Generators

The usage of wireless sensor networks (WSN) is widespread in industries where data security is crucial. Due to the energy and computational limits of WSN, the cryptographic protocols designed for it must be as computationally cheap as feasible. The components of these protocols, such as the random number generator, are subject to the same constraints. For such resource-constrained devices, several lightweight encryption techniques have been created. One of the most efficient lightweight ciphers is Tiny Encryption Algorithm (TEA). TEA uses a few lines of source code that are based on Feistel. It is however susceptible to attacks utilizing equivalent and related key attacks. In order to address TEA’s key vulnerabilities, a modification is suggested in this paper that focuses on key creation. Four connected Additive Fibonacci Generators (AFGs) make up the structure, which addresses the security vulnerability by using a unique key each round. Performance evaluation was assessed using three statistical tests: avalanche effect, randomness analysis, and completeness testing. Through experimental results, ATEA outperforms TEA by an average of 51.68 % to 47.51 % for the avalanche effect, and 51.95 % to 48.36 % for the completeness test, and satisfies all the NIST requirements. Results of advanced security measurements indicate that, ATEA can be used to secure WSN devices.

Research on adaptive particle swarm optimization particle filter target tracking algorithm in wireless sensor networks

AbstractWith regard to target tracking in wireless sensor networks, we are faced with problems like deficient occlusion handling and tracking failures during rapid movements due to complex and diverse circumstances. In order to effectively improve the accuracy of particle filter tracking caused by particle degradation, we propose an adaptive particle swarm optimization (APSO) particle filter algorithm. This algorithm uses particle filters to predict the target location in a particular area and introduces the particle swarm optimization (PSO) algorithm, of which both the evolutionary speed and the convergence accuracy are further improved by investigating the particle distribution through an entropy analysis, employing three different inertial weighting strategies and dynamic double mutation strategy, and exploiting the capabilities of the adaptive balancing algorithm in global and local searching. The simulation results show that the improved algorithm has a reduced root mean square error, shorter time consumption, faster speed, reduced target tracking error, and higher average success rate, so this algorithm exhibits sound real‐time performance and accuracy in terms of occlusion handling and tracking loss.

A comparative analysis on Relibale routing models in wireless sensor in smart applications

Researchers are drawn to Wireless Sensor Networks (WSNs) due to its versatility and possible use cases in a variety of fields, including target tracking and identification environmental sensing, industrial process tracking, and tactical systems. Recently, there has been a lot of focus on the particular issues that arise from implementing routing in sensor networks as opposed to the more conventional data routing in wireless connections. Due to the importance of energy conservation in the design of WSNs, numerous protocols for routing, power management, and data transmission have been developed for these networks. When it comes to environmental monitoring, traffic monitoring, etc., routing in WSNs is crucial. The primary objective of this study is to analyse routing issues and to analyse routing-related optimization issues. Features pertaining to routing issues like energy consumption, security, speed, and dependability are explored later. Attention has been paid to the routing protocols, which might vary by use case and network design. In this study, a comprehensive review is performed on the cutting-edge approaches to routing in WSNs. A brief introduction to WSNs and a discussion of the obstacles that routing protocols must overcome throughout their creation before moving on to a thorough examination of the various routing approaches now in use is considered. The comparative analysis is performed different routing techniques like Energy-Aware Routing for Software-Defined Multihop Wireless Sensor Networks (EAR-SDMWSN), DORA: A Destination-Oriented Routing Algorithm for Energy-Balanced Wireless Sensor Networks (DORA) and Energy Proficient Load Balancing Routing Scheme for Wireless Sensor Networks (EP-LBR). The benefits and drawbacks of each routing method, with an emphasis on performance is also performed.

Data aggregation algorithm for wireless sensor networks with different initial energy of nodes.

Data aggregation plays a critical role in sensor networks for efficient data collection. However, the assumption of uniform initial energy levels among sensors in existing algorithms is unrealistic in practical production applications. This discrepancy in initial energy levels significantly impacts data aggregation in sensor networks. To address this issue, we propose Data Aggregation with Different Initial Energy (DADIE), a novel algorithm that aims to enhance energy-saving, privacy-preserving efficiency, and reduce node death rates in sensor networks with varying initial energy nodes. DADIE considers the transmission distance between nodes and their initial energy levels when forming the network topology, while also limiting the number of child nodes. Furthermore, DADIE reconstructs the aggregation tree before each round of data transmission. This allows nodes closer to the receiving end with higher initial energy to undertake more data aggregation and transmission tasks while limiting energy consumption. As a result, DADIE effectively reduces the node death rate and improves the efficiency of data transmission throughout the network. To enhance network security, DADIE establishes secure transmission channels between transmission nodes prior to data transmission, and it employs slice-and-mix technology within the network. Our experimental simulations demonstrate that the proposed DADIE algorithm effectively resolves the data aggregation challenges in sensor networks with varying initial energy nodes. It achieves 5-20% lower communication overhead and energy consumption, 10-20% higher security, and 10-30% lower node mortality than existing algorithms.

SECURE and energy-efficient routing protocol based on micro-segmentation and batch authentication

An effective technique in designing routing algorithms for Wireless Sensor Networks (WSNs) is named clustering nodes, which augments the network lifespan. More tasks are performed by the Cluster Heads (CHs) of the clustered WSNs, thereby consuming more energy. Hence, a secure energy-efficient Routing Protocol (RP) centered on micro-segmentation and batch authentication is proposed here. The proposed method begins by initializing the WSN nodes. After that, a random key is engendered for every node centered on their Node ID. The nodes undergo a Micro-segmentation process; in addition, they are securely grouped utilizing the Supremum Distance based K-Prototype (SD-KP) algorithm. Now, a fog layer with a number of fog nodes is initialized; also, every single micro-segmented group is assigned with an optimal fog node. Then, by using the Quasi Deterministic Sequence-Black Widow Optimization (QDS-BWO) algorithm, the optimal fog nodes are selected. By using the Root Squared- Diffie Hellman (R2-DH) technique, a key agreement is created for each group centered on their Node IDs. By using the Bitwise Cyclic Shift –BLAKE 512 (BCS-BLAKE-512) algorithm, the created keys are converted into hashcode. Now, for the purpose of performing batch authentication, the hashcode of each group is sent to the trusted authority. Subsequent to verification, data sensing occurs. Lastly, by using the Elliptic Curve Cryptography (ECC) algorithm, the data is securely encrypted and it is transmitted via the routes selected utilizing the Learned Gradient Weight Initialization-based Geography and Energy Aware Routing (LGWI-GEAR) algorithm. The proposed framework's efficacy is proved by the experimental outcomes.

Energy Efficient Spiking Deep Residual Network and Binary Horse Herd Optimization Espoused clustering Protocol for Wireless Sensor Networks

Nowadays, Wireless Sensor Networks (WSNs) plays several important application fields, specially monitoring events without any human interference. The sensor nodes (SNs) have lesser life time in wireless sensor network owing to its continual sensing with battery drains very rapidly. As a result of the heavy traffic, sensors nearby quickly expire and energy hole issues start to appear. To overcome these issues, an Energy Efficient Spiking Deep Residual Network and Binary Horse Herd Optimization Espoused Clustering Protocol for Wireless Sensor Networks (EE-SDRN-BHHO-CP-WSN) is proposed in this manuscript for sustaining the energy efficiency in the wireless sensor network. One of the main issues in wireless sensor network assisted applications is making use of the available energy. An optimum path selection is a key process of saving energy from sensor nodes to the sink. Spiking Deep Residual Network (SDRN) and Binary Horse Herd Optimization (BHHO) optimize energy efficiency in WSN. The cluster head (CH) is designated by effectual fitness function generated by multi-objectives. It benefits in low power consuming and decreases a count of idle sensor nodes. After CH selection, Binary horse herd optimization algorithm is considered for optimal route selection and data transmission by sink node. The EE-SDRN-BHHO-CP-WSN method is implemented in MATLAB and the efficiency of the proposed method is analyzed with different metrics, like network lifetime, number of alive nodes, number of dead nodes, throughput, energy consumption, packet delivery ratio (PDR). The proposed EE-SDRN-BHHO-CP-WSN method attains 32.35 %, 42.34 %, 49.27 % higher network lifetime, 26.34 %, 31.94 % and 39.35 % higher number of alive nodes and 46.26 %, 38.64 % and 27.83 % lower number of dead nodes compared with other existing models, such as Multi-objective CH based Energy-aware Optimized Routing Algorithm in WSN (MCH-EOR-WSN), Energy efficient CH selection utilizing improved Sparrow Search Algorithm in WSN (EECH-ISSA-WSN), and New Energy Aware CH Selection Algorithm for WSN (NEA-CHSA-WSN respectively).

Multi-objective optimized multi-path and multi-hop routing based on hybrid optimization algorithm in wireless sensor networks

Multi-objective optimized multi-path and multi-hop routing based on hybrid optimization algorithm in wireless sensor networks

Research on WSN reliable ranging and positioning algorithm for forest environment

Wireless sensor network (WSN) location is a significant research area. In complex environments like forests, inaccurate signal intensity ranging is a major challenge. To address this issue, this paper presents a reliable WSN distance measurement-positioning algorithm for forest environments. The algorithm divides the positioning area into several sub-regions based on the discrete coefficient of the collected signal strength. Then, using the fitting method based on the signal intensity value of each sub-region, the algorithm derives the reference points of the logarithmic distance path loss model and path loss index. Finally, the algorithm locates target nodes using anchor nodes in different regions. Additionally, to enhance the positioning accuracy, weight values are assigned to the positioning result based on the discrete coefficient of the signal intensity in each sub-region. Experimental results demonstrate that the proposed WSN algorithm has high precision in forest environments.

Efficient key distribution for secure and energy-optimized communication in wireless sensor network using bioinspired algorithms

Wireless Sensor Networks (WSNs) play a major part in numerous applications such as smart agriculture, healthcare, and environmental monitoring. Safeguarding protected communication in this network is dominant. Securing data transmission in WSNs needs a strong key distribution device to defend against malicious attacks as well as illegal access. Traditional techniques like pre-shared or centralized key management are often unreasonable owing to resource limitations, particularly in large-scale sensor systems. To overcome this challenge, a lightweight key distribution technique is employed for safeguarding the security and privacy of data transmission streamlining processes decreasing computational overhead as well as energy consumption. By optimizing and simplifying key distribution devices, we propose to improve the complete efficacy and trustworthiness of WSNs that aid safe communication while preserving valuable energy resources. Therefore, this article designs an Efficient Key Distribution for Secure and Energy-Optimized Communication using Bioinspired Algorithms (EKD-SOCBA) for WSN. The purpose of the EKD-SOCBA technique is to accomplish security and energy efficiency in WSNs. Initially, the EKD-SOCBA technique applies a golden jackal optimization (GJO) based clustering approach to cluster the nodes and select cluster heads (CHs). Also, a lightweight Dynamic Step-wise Tiny Encryption Algorithm (DS-TEA) is applied to secure data transmission in the network. Finally, a lightweight key management phase is employed to protect the encryption key and decrease energy utilization and overhead costs. To exhibit the enhanced act of the EKD-SOCBA model, a comprehensive set of imitations was involved. Extensive results stated enhanced presentation of EKD-SOCBA methodology over other models on WSN.

C4O: chain-based cooperative clustering using coati optimization algorithm in WSN

In order to provide sensing services to low-powered IoT devices, wireless sensor networks (WSNs) organize specialized transducers into networks. Energy usage is one of the most important design concerns in WSN because it is very hard to replace or recharge the batteries in sensor nodes. For an energy-constrained network, the clustering technique is crucial in preserving battery life. By strategically selecting a cluster head (CH), a network's load can be balanced, resulting in decreased energy usage and extended system life. Although clustering has been predominantly used in the literature, the concept of chain-based clustering has not yet been explored. As a result, in this paper, we employ a chain-based clustering architecture for data dissemination in the network. Furthermore, for CH selection, we employ the coati optimisation algorithm, which was recently proposed and has demonstrated significant improvement over other optimization algorithms. In this method, the parameters considered for selecting the CH are energy, node density, distance, and the network’s average energy. The simulation results show tremendous improvement over the competitive cluster-based routing algorithms in the context of network lifetime, stability period (first node dead), transmission rate, and the network's power reserves.

Mathematical Modeling and Analysis of Energy Aware Probabilistic Distribution Based Cluster Head Selection Algorithm for Wireless Sensor Networks

From a mathematical perspective, Wireless Sensor Networks (WSNs) are increasingly recognized for their utility across multiple sectors such as environmental oversight, healthcare monitoring, and process automation within industries. A paramount obstacle within WSNs is the management of energy efficiency, given that the sensor nodes are typically powered by batteries with finite energy reserves. The criticality of developing efficient routing protocols cannot be overstated, as they are instrumental in extending the operational lifespan of the network and guaranteeing dependable data communication. This study is centered around the mathematical modelling and performance evaluation of an innovative routing methodology that integrates machine learning algorithms to augment energy efficiency within WSNs. The novel routing strategy dynamically adjusts its operations in response to the immediate environmental and network states, aiming to minimize energy expenditure and elevate the network's overall efficiency. Through comprehensive numerical simulations, this research scrutinizes the efficacy of the machine learning-enhanced routing protocol against conventional routing methodologies, accentuating its advantages in energy savings and reliability in data transmission. The simulation framework encompasses a variety of network configurations, traffic distributions, and environmental contexts, employing metrics such as energy utilization, network longevity, packet delivery ratio, and latency to offer an in-depth examination of the machine learning-based routing approach's performance. Findings from the simulations affirm the algorithm's enhanced energy efficiency, which contributes to prolonged operation of sensor nodes and steadfast data communication across dynamically changing network landscapes. The implications of this study highlight the transformative potential of machine learning in redefining routing protocol design and optimization within energy-restricted WSNs. By elevating both energy efficiency and network functionality, this research marks a significant stride towards realizing sustainable and dependable WSNs, paving the way for their broader application in essential services.

An Improved Upper-Bounded Capacity Algorithm For Wireless Sensor Network

An Improved Upper-Bounded Capacity Algorithm For Wireless Sensor Network

MEDIA-WSN: Multi-Objective Energy and Distance Integrated Algorithm in Wireless Sensor Network

MEDIA-WSN: Multi-Objective Energy and Distance Integrated Algorithm in Wireless Sensor Network

A Hybrid Approach for Energy Consumption and Improvement in Sensor Network Lifespan in Wireless Sensor Networks.

In this paper, we propose an improved clustering algorithm for wireless sensor networks (WSNs) that aims to increase network lifetime and efficiency. We introduce an enhanced fuzzy spider monkey optimization technique and a hidden Markov model-based clustering algorithm for selecting cluster heads. Our approach considers factors such as network cluster head energy, cluster head density, and cluster head position. We also enhance the energy-efficient routing strategy for connecting cluster heads to the base station. Additionally, we introduce a polling control method to improve network performance while maintaining energy efficiency during steady transmission periods. Simulation results demonstrate a 1.2% improvement in network performance using our proposed model.