Wireless Sensor Network Scenario Research Articles

An Improved and Secured 3-Factor Authentication Scheme for WSN in IoT Based Applications

Wireless Sensor Networks (WSN) has top-notch capacity for numerous domains of utility due to the potential to sense and apprehend unattended environments. IoT is playing an increasingly more essential position in clever healthcare, smart transportation and elegant grid using WSN. Therefore, challenges like privacy and data security associated with IoT wireless sensor networks because of sensor node being captured easily, consume less computing energy and low storage. Designing a secure authentication scheme will enable secure communication in WSN. Here, we proposed a improved three-factor authentication scheme for WSN utilizing biometric, password and smart card withstand against security attacks. Subsequently, by comparing the security, functional and performance parameters of our proposed scheme to the other schemes, our scheme provides better and efficient one. Therefore, our scheme is fairly workout in real time IoT applications involved in WSN scenario.

Evidential reasoning rule with dynamic reliability for performance assessment of wireless sensor network

The performance of wireless sensor network (WSN) continues to change over time, and it is required to track the WSN performance accurately. In this paper, a new assessment model known as the evidential reasoning rule with dynamic reliability (ERr-DR) is proposed. In the ERr-DR, the evidence reliability evolves from the traditional static value to a dynamic value, which can reveal the impact of external noise on network performance reasonably. As an effective extension of traditional ER rule, the ERr-DR has excellent modeling ability. Furthermore, by analysing the physical meanings of model parameters in detail, an optimization objective with targeted constraints is established. Compared with the existing optimization strategies, this not only improves the output accuracy of ERr-DR, but also maintains the interpretability of assessment results. Finally, A case study of a simulated WSN scenario validates the effectiveness of the proposed model.

A Novel Method for Energy Efficient Clustering in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) play a crucial role in various applications, including environmental monitoring, industrial automation, and healthcare. However, optimizing WSNs for efficient resource utilization, energy conservation, and reliable data transmission remains a challenging task due to the dynamic nature of the network environment and resource-constrained sensor nodes. In this study, we propose a Hybrid Firefly Genetic Algorithm (HFGA) for optimizing WSN performance. The HFGA combines the strengths of the firefly algorithm's global search capabilities and the genetic algorithm's local search and optimization efficiency. By integrating these two evolutionary algorithms, the HFGA aims to achieve superior performance in terms of energy efficiency, network coverage, and convergence speed. We evaluate the effectiveness of the proposed HFGA through extensive simulation experiments in various WSN scenarios. The results demonstrate that the HFGA outperforms traditional optimization approaches and baseline algorithms in optimizing WSN performance metrics. Furthermore, we discuss the practical implications and future research directions for deploying the HFGA in real-world WSN applications. Overall, this study contributes to advancing WSN optimization techniques and enhancing the reliability and efficiency of WSN deployments. Keywords: Clustering, Genetic algorithm, Firefly algorithm, FAG algorithm.

Latency and Residual Energy Analysis of MIMO Heterogeneous Wireless Sensor Networks

Energy-constrained Wireless Sensor Networks (WSNs) have garnered significant research interest in recent years. Multiple-Input Multiple-Output (MIMO), or Cooperative MIMO, represents a specialized application of MIMO technology within WSNs. This approach operates effectively, especially in challenging and resource-constrained environments. By facilitating collaboration among sensor nodes, Cooperative MIMO enhances reliability, coverage, and energy efficiency in WSN deployments. Consequently, MIMO finds application in diverse WSN scenarios, spanning environmental monitoring, industrial automation, and healthcare applications. This research paper presents a comparative performance analysis of MIMO wireless sensor networks and traditional wireless sensor networks without MIMO using Network Simulator NS2.35 for analysis of End to End Delay for packet transmission and Residual energy of nodes. The research work shows application of MIMO in Wireless Sensor Networks with considerable improvements in Quality of Service parameters which is achieved through Spatial Multiplexing and Diversity Gain. MIMO enables multiple spatial streams, allowing several data streams to be transmitted simultaneously on the same channel. This increases the overall throughput as multiple sensors can transmit their data concurrently without interference. MIMO systems also provide diversity gain by transmitting multiple copies of the same data over different antennas which helps in mitigating the effects of fading and interference, resulting in a more reliable and higher-throughput communication link as compared to a SISO channel. Another advantage of employing MIMO in WSN is reduction in End-to-End delays in data transmission. Last but not the least, MIMO can be configured to optimize the power consumption of individual sensors by adjusting the number of antennas used and transmission power levels based on channel conditions. Hence, MIMO can help to extend the network's lifetime by conserving energy in resource-constrained sensor nodes by preservation of Residual Energy.

Security threat detection performance analysis of a distributed architecture WSN

IoT technologies are becoming more and more common in our daily activities because the networks they create are capable of collecting information, monitoring and controlling remotely. However, these devices are not exempt from security attacks, as they become vulnerable entry points to data networks. The use of traditional methods to secure networks (e.g., Next Generation Firewalls (NGFW), encryption, etc.) is not recommended because the devices used in this type of network are limited in terms of computing power and storage availability (e.g., nodeMCU). In this paper, we propose to design two intrusion detection systems in embedded systems using machine learning (ML) algorithms, Artificial Neural Networks and K-means. In a distributed architecture Wireless Sensor Network scenario (WSN), we evaluate their performance in terms of connection and response times, detection accuracy and intruder detection time. Simulation results show that both models are able to find irregularities in network traffic within milliseconds.

An Energy Efficient Cluster Head Selection in WSN Based on Enhanced Chicken Swarm Optimization

Clustering of data are ab effective energy saving method for wireless sensor networks (WSN). However, they incur additional costs in data collections from sensor nodes and sending them to base station (BS) after aggregations. Cluster heads (CHs) in hierarchical cluster-based WSNs use more energy. Therefore, choosing a suitable CHs is essential to conserve energy for sensor nodes and prolong the life of the WSN. Provide energy-saving cluster head selection techniques in this work. where enhanced fuzzy means clustering is used to perform the first cluster construction. Enhanced Chick Swarm optimization (ECSO) selects CHs which is evaluated strictly for varying WSN scenarios and counts of CHs and nodes for values of remaining energies of sensor nodes, sink distances, and distances within clusters. To demonstrate that the proposed technique is superior, the results are compared with those of several other currently used algorithms.

Energy-aware and Context-aware Fault Detection Framework for Wireless Sensor Networks

Wireless sensor networks (WSNs) consist of many sensor nodes that are densely deployed throughout a randomized geographical area to monitor, detect, and analyze various physical phenomena. The primary obstacle encountered in WSNs pertains to the significant reliance of sensor nodes on finite battery power for wireless data transfer. Sensors as a crucial element inside Cyber-Physical Systems (CPS) renders them vulnerable to failures arising from intricate surroundings, substandard manufacturing, and the passage of time. Various anomalies can appear within WSNs, mostly attributed to defects such as hardware and software malfunctions and anomalies and assaults initiated by unauthorized individuals. These anomalies significantly impact the overall integrity and completeness of the data gathered by the networks. Therefore, it is imperative to provide a critical mechanism for the early detection of faults, even in the presence of constraints imposed by the sensor nodes. Machine Learning (ML) techniques encompass a range of approaches that may be employed to identify and diagnose sensor node faults inside a network. This paper presents a novel Energy-aware and Context-aware fault detection framework (ECFDF) that utilizes the Extra-Trees algorithm (ETA) for fault detection in WSNs. To assess the effectiveness of the suggested methodology for identifying context-aware faults (CAF), a simulated WSN scenario is created. This scenario consists of data from humidity and temperature sensors and is designed to emulate severe low-intensity problems. This study examines six often-seen categories of sensor fault, including drift, hard-over/bias, spike, erratic/precision, stuck, and data loss. The ECFDF approach utilizes an Energy-Efficient Fuzzy Logic Adaptive Clustering Hierarchy (EE-FLACH) algorithm to select a Super Cluster Head (SCH) within WSNs. The SCH is responsible for achieving optimal energy consumption within the network, and this selection process facilitates the early detection of faults. The results of the simulation indicate that the ECFDF technique has superior performance in terms of Fault Detection Accuracy (FDA), False-Positive Rate (FPR), and Mean Residual Energy (MRE) when compared to other detection and classification methods.

An adaptive learning grey wolf optimizer for coverage optimization in WSNs

Wireless sensor networks (WSNs) are widely used emerging technologies, but they also face many challenges in practical applications. One of the most critical challenges is the coverage problem. The size of the sensor nodes’ coverage determines the service quality of WSNs. Therefore, an adaptive learning grey wolf optimizer (ALGWO) is proposed to optimize the coverage problem for 2D and more complex 3D regions. In ALGWO, a dynamic opposite learning strategy with dynamic, asymmetric search is employed to prevent premature convergence and improve the exploration capability. Adaptive dimensional learning provides information on the neighborhood dimension for individuals to overcome the dependence on the first three wolves, thus improving the diversity of the population. Meanwhile, the dimensional learning of each individual adaptively performs exploration and exploitation. The performance of ALGWO is evaluated in 2D and 3D WSNs scenarios through simulations. Compared with GWO and its advanced variants, the simulation results show that the ALGWO algorithm has better coverage. In 2D scenes, ALGWO achieved the average coverage of 95.5% and the maximum coverage of 96.93%. In 3D scenes, ALGWO achieved the average coverage of 94.32% and the maximum coverage of 95.13%.

Formula omitted]CA-GAM-ID: Coupling of probabilistic principal components analysis with generalised additive model to predict the [formula omitted]barriers for intrusion detection

Drastic advancement in computing technology and the dramatic increase in the usage of explainable machine learning algorithms provide a promising platform for developing robust intrusion detection algorithms. However, the development of these algorithms is constrained by their applicability over specific scenarios of Wireless Sensor Networks (WSNs). We introduced a hybrid framework by combining Probabilistic Principal Component Analysis (P2CA) and Generalised Additive Model (GAM), which is performing well for all the scenarios of WSNs. To demonstrate our framework’s broad applicability, we evaluated its performance over three publicly available intrusion detection datasets (i.e., LT-FS-ID, AutoML-ID, and FF-ANN-ID), each from different scenarios. Our findings highlight that the presented framework can accurately predict the number of k−barriers for all three datasets. Furthermore, we conducted a comprehensive performance comparison between our proposed framework and benchmark algorithms, which revealed that our approach outperforms all of them. Additionally, we evaluated the framework’s versatility by testing its performance on datasets unrelated to intrusion detection, specifically ALE datasets. Notably, our approach accurately predicted the response variable in these datasets and exceeded the performance of its primary algorithm, further demonstrating its robustness and adaptability.The implications of this research are substantial. By developing a robust intrusion detection framework that performs well across diverse WSN scenarios, we address a critical need for reliable network security in various domains, including industrial IoT, smart cities, and environmental monitoring. Our findings not only enhance the understanding of intrusion detection in WSNs but also pave the way for developing more sophisticated and adaptable systems to safeguard sensitive data and critical infrastructure.

Kalman filter based sensor fault detection in wireless sensor network for smart irrigation

Ensuring the reliability of data obtained from Wireless Sensor Networks (WSNs) deployed in farmland to monitor soil parameters is crucial for optimizing smart irrigation. These distributed sensor nodes encounter various challenges and are vulnerable to sensor faults that can significantly degrade the network's service quality. In this article, we present an innovative approach for detecting sensor faults within WSNs for smart irrigation by combining an autoregressive model with a Kalman filter. Integrating the Kalman filter and the autoregressive model combines their strengths in a synergistic manner. The algorithm is developed with consideration for the resource constraints of the sensor nodes and addresses the challenge of lacking ground truth information for the monitored area. The primary advantage of this proposed technique lies in its simplicity of implementation, requiring minimal computational complexity while enhancing the application's reliability. Through experimentation and validation, we demonstrate the effectiveness of this combined approach in detecting sensor fault detection in real-world WSNs scenarios.

Novel DV-hop algorithm-based machines learning technics for node localization in rang-free wireless sensor networks

Localization is a critical concern in many wireless sensor network (WSN) applications. Furthermore, correct information regarding the geographic placements of nodes (sensors) is critical for making the collected data valuable and relevant. Because of their benefits, such as simplicity and acceptable accuracy, the based connectivity algorithms attempt to localize multi-hop WSN. However, due to environmental factors, the precision of localisation may be rather low. This publication describes an Extreme Learning Machine (ELM) technique for minimizing localization error in range-free WSN. In this paper, we propose a Cascade Extreme Learning Machine (Cascade-ELM) to increase localization accuracy in Range-Free WSNs. We tested the proposed approaches in a variety of multi-hop WSN scenarios. Our research focused on an isotropic and irregular environment. The simulation results show that the proposed Cascade-ELM algorithm considerably improves localization accuracy when compared to previous algorithms derived from smart computing approaches. When compared to previous work, isotropic environments show improved localization results.

A Technique for Cluster Head Selection in Wireless Sensor Networks Using African Vultures Optimization Algorithm

INTRODUCTION: Wireless Sensor Network (WSN) has caught the interest of researchers due to the rising popularity of Internet of things(IOT) based smart products and services. In challenging environmental conditions, WSN employs a large number of nodes with limited battery power to sense and transmit data to the base station(BS). Direct data transmission to the BS uses a lot of energy in these circumstances. Selecting the CH in a clustered WSN is considered to be an NP-hard problem. OBJECTIVES: The objective of this work to provide an effective cluster head selection method that minimize the overall network energy consumption, improved throughput with the main goal of enhanced network lifetime. METHODS: In this work, a meta heuristic based cluster head selection technique is proposed that has shown an edge over the other state of the art techniques. Cluster compactness, intra-cluster distance, and residual energy are taken into account while choosing CH using multi-objective function. Once the CHs have been identified, data transfer from the CHs to the base station begins. The residual energy of the nodes is finally updated during the data transmission begins. RESULTS: An analysis of the results has been performed based on average energy consumption, total energy consumption, network lifetime and throughput using two different WSN scenarios. Also, a comparison of the performance has been made other techniques namely Artificial Bee Colony (ABC), Ant Colony Optimization (ACO), Atom Search Optimization (ASO), Gorilla Troop Optimization (GTO), Harmony Search (HS), Wild Horse Optimization (WHO), Particle Swarm Optimization (PSO), Firefly Algorithm (FA) and Biogeography Based Optimization (BBO). The findings show that AVOA's first node dies at round 1391 in Scenario-1 and round 1342 in Scenario-2 which is due to lower energy consumption by the sensor nodes thus increasing lifespan of the WSN network. CONCLUSION: As per the findings, the proposed technique outperforms ABC, ACO, ASO, GTO, HS, WHO, PSO, FA, and BBO in terms of performance evaluation parameters and boosting the reliability of networks over the other state of art techniques.

Enhanced Security with Improved Defensive Routing Mechanism in Wireless Sensor Networks

In recent scenario of Wireless Sensor Networks (WSNs), there are many application developed for handling sensitive and private data such as military information, surveillance data, tracking, etc. Hence, the sensor nodes of WSNs are distributed in an intimidating region, which is non-rigid to attacks. The recent research domains of WSN deal with models to handle the WSN communications against malicious attacks and threats. In traditional models, the solution has been made for defending the networks, only to specific attacks. However, in real-time applications, the kind of attack that is launched by the adversary is not known. Additionally, on developing a security mechanism for WSN, the resource constraints of sensor nodes are also to be considered. With that note, this paper presents an Enhanced Security Model with Improved Defensive Routing Mechanism (IDRM) for defending the sensor network from various attacks. Moreover, for efficient model design, the work includes the part of feature evaluation of some general attacks of WSNs. The IDRM also includes determination of optimal secure paths and Node security for secure routing operations. The performance of the proposed model is evaluated with respect to several factors; it is found that the model has achieved better security levels and is efficient than other existing models in WSN communications. It is proven that the proposed IDRM produces 74% of PDR in average and a minimized packet drop of 38% when comparing with the existing works.

Near-Optimal Nonbinary Index Assignment for Equiprobable Lattice Quantizers

Index assignment (IA) is a low-complexity joint source-channel coding technique that has the potential for use in low-latency and low-power applications, such as wireless sensor networks (WSNs). Though binary IA has been extensively studied for assigning binary indices to quantized codewords (or symbols) under the assumption of binary symmetric channels (BSCs), real-world scenarios often use M-ary modulations. Directly applying binary IAs designed for BSCs to M-ary modulations results in suboptimal performance. Studying the IA problem for M-ary transmission is both theoretically and practically interesting. In this paper, we propose the M-ary IA, which assigns M-ary labels to quantized codewords (or symbols). We focus on equiprobable lattice quantizers, derive a tight performance bound, and propose a two-step design to achieve near-optimal IA schemes. In addition, we propose closed-form IA constructions for practical modulation schemes including PAM, QAM, and PSK. Our proposed IA scheme is rigorously proven to be optimal for 3-PSK and QPSK, whereas for larger modulation orders, the proposed IA constructions approach the bounds within small gaps. Our simulations show that the constructed IA scheme can achieve significant energy savings compared to the conventional binary IA scheme. Specifically, in some WSN scenarios, the proposed IA for 16-QAM is shown to achieve significant reductions in energy consumption relative to the conventional binary counterpart.

Switched Beam Array Antenna Optimized for Microwave Powering of 3-D Distributed Nodes in Clustered Wireless Sensor Network

The IoT applications like smart warehouse, smart industry, and smart vertical farming will require microwave power transmission (MPT) to the densely deployed low-power sensor nodes in 3-D space. To address this issue, a switched beam array antenna (SBA) is synthesized as an MPT system to power the proposed 3-D clustered wireless sensor network (WSN). The 3-D space is divided into nine clusters; each illuminated individually with RF power using a dedicated patch antenna subarray. The subarrays can be switched ON or OFF based on the energy requirement of the WSN cluster nodes resulting in efficient power transmission. Moreover, the low complexity of switched beam design reduces the cost and processing overhead as compared to the exiting adaptive beamforming systems in a dense WSN scenario. The subarray size and excitation coefficients are optimized with a constraint over the harvested dc power ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$P_{dc}$ </tex-math></inline-formula> ) to enhance the 3-D coverage. In addition, the optimal location of the cluster head (CH) is evaluated to minimize the average power consumption of WSN cluster. The subarrays are designed and fabricated with the evaluated excitation coefficients, and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$P_{dc}$ </tex-math></inline-formula> measurements are carried out validating analytical results.

Energy-Saving Routing Protocols for Smart Cities

In recent decades, expansion in urban areas has faced issues such as management of public waste, noise, mobility, and air quality, among others. In this scenario, Internet of Things (IoT) and Wireless Sensor Network (WSN) scenarios are being considered for Smart Cities solutions based on the deployment of wireless remote sensor nodes to monitor large urban areas. However, as the number of nodes increases, the amount of data to be routed increases significantly as well, meaning that the choice of the data routing process has great importance in terms of the energy consumption and lifetime of the network. In this work, we describe and evaluate the energy consumption of routing protocols for WSN-based Smart Cities applications in LoRa-based mesh networks, then propose a novel energy-saving radio power adjustment (RPA) routing protocol. The Cupcarbon network simulator was used to evaluate the performance of different routing protocols in terms of their data package delivery rate, average end-to-end delay, average jitter, throughput, and load consumption of battery charge. Additionally, a novel tool for determining the range of nodes based on the Egli propagation model was designed and integrated into Cupcarbon. The routing protocols used in this work are Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Distance Vector Routing (DVR). Our simulation results show that AODV presents the best overall performance, DSR achieves the best results for power consumption, and DVR is the best protocol in terms of latency. Finally, the proposed RPA routing protocol presents power savings of 11.32% compared to the original DSR protocol.

A Voronoi Diagram-Based Grouping Test Localization Scheme in Wireless Sensor Networks

The wireless sensor network (WSN) provides us with a cost-effective way to remotely monitor a large number of objects, locations, and environmental parameters. Taking advantage of WSNs to applications can add new capabilities to existing products and bring out new services. We propose a novel range-free localization scheme, the Voronoi diagram-based grouping test localization (VTL) scheme, to estimate the location efficiently for WSNs. VTL divides the anchor nodes into multiple groups and uses the corresponding closest Voronoi cells to compute the estimated location. Apart from improving the accuracy of location estimation, it also largely simplifies the implementation. Simulation results show that the VTL scheme has better performance compared with other range-free localization schemes. When reaching a certain anchor node density, the VTL scheme will have higher localization accuracy and a larger percentage of localizable nodes. Hence, VTL is likely more appropriate for upcoming WSN scenarios with large ratios of anchor nodes being available.

Network Lifetime Enhancement by Elimination of Spatially and Temporally Correlated RFID Surveillance Data in WSNs

In wireless sensor networks (WSNs), radio frequency identification (RFID) plays an important role due to its data characteristics which are data simplicity, low cost, simple deployment, and less energy consumption. It consists of a series of tags and readers which collect a huge number of redundant data. It increases system overhead and decreases overall network lifetime. Existing solutions like Time-Distance Bloom Filter (TDBF) algorithm are inapplicable to the large-scale environment. Received Signal Strength (RSS) used in this algorithm is highly dependent on quality of tag and application environment. In this paper, we propose an approach for data redundancy minimization for RFID surveillance data which is a modified version of TDBF. The proposed algorithm is formulated by using the observed time and calculated distance of RFID tags. To overcome these problems, we design our approach to relevantly reduce the spatiotemporal data redundancy in the source level by adding the Received Signal Strength Indicator (RSSI) concept for energy-efficient RFID data communication in wireless sensor network scenario. We introduce in this paper the new improved idea of an existing algorithm which efficiently reduces the rate of data redundancy spatially and temporally. The implemented results overcome the limitations of existing algorithm for data redundancy reduction. Nevertheless, the performance evaluation shows the efficiency of proposed algorithm in terms of time and data accuracy. Furthermore, this algorithm supports multidimensional and large-scale environment suitable for sensor network nowadays.

3D Localization and Error Minimization in Underwater Sensor Networks

Wireless sensor networks (WSNs) consist of nodes distributed in the region of interest (ROI) that forward collected data to the sink. The node’s location plays a vital role in data forwarding to enhance network efficiency by reducing the packet drop rate and energy consumption. WSN scenarios, such as tracking, smart cities, and agriculture applications, require location details to accomplish the objective. Assuming a 3D application space, a combination of received signal strength (RSS) and time of arrival (TOA) can be helpful for reliable range estimation of nodes. Notably, the anchor node can minimize localization error for non-line-of-sight (NLOS) signals. We proposed an error minimization protocol for localization of the sensor node, assuming that the anchor node’s location is known prior and can limit the receiving signal in LOS, single, or twice reflection. We start to exploit the sensor node’s geometrical relationship and the anchor node for LOS and NLOS signals and address misclassification. We started initially from the erroneous node position, bound its volume in 3D space, and reduced volume with each iteration following the constraint. Our simulation result outperforms the traditional methods on many occasions, such as boundary volume and computational complexity.

Optimization on information freshness for multi‐access users with energy harvesting cognitive radio networks

AbstractFor the multi‐access channel wireless sensor network scenario with limited channel resources, the transmission of real‐time information needs to consider the channel environment, spectrum utilization and the freshness of information. First, we present a cognitive network model where secondary user (SU) shares the primary user (PU) spectrum through the underlay scheme. The sensor nodes with energy harvesting (EH) capabilities dynamically monitor changes in the surrounding environment and transmit status updates to the common secondary destination node. Considering the stability of the data queue in the SU as well as the working state and stable service interference constraints of PU, an optimization problem of minimizing the average AoI and average peak AoI (PAoI) of the EH node is proposed. Second, two policies are used to solve the above problems, including the decentralized probabilistic‐random‐access (PRA) policy and the drift plus penalty (DPP) policyin. In PRA policy, two SU nodes make independent transmission decisions based on corresponding probability distributions, and in DPP policy, the Lyapunov optimization framework is used to optimize scheduling decisions in the timeslots for optimizing the age of data packets. The simulation results show that the optimization of AoI under the DPP policy is more significant than the PRA policy, which can effectively improve the timeliness and freshness of data packets.