Communication In Wireless Sensor Networks Research Articles

Dynamic Wireless Sensor Network-Based Structural Health Monitoring System for Retractable Roof Structure

Retractable roof structure (RRS) works optimally under varying weather, but is prone to damage due to its complexity, requiring monitoring. Given RRS's large scale, wireless sensor networks (WSNs) are preferred, with dynamic WSNs better adapted to its motion than static ones. A tree-type network topology was designed for dynamic WSN, enabling fast self-routing. It is divided into subnets, each with a relay node as the parent and subordinate relay and sensor nodes as children. Network address reassignment method was proposed to sustain WSN communication during motion. This method involves operations of subnet affiliation change and relay node replacement, the former adjusts the hierarchy between relay nodes across different subnets while preserving parent-child relation within each subnet, and the latter swaps the roles of relay and sensor nodes within one subnet to form a new subnet. Basic communication module with processing, communication, and power management units was used to connect nodes. Dynamic WSN-based structural health monitoring (SHM) system with 372 sensors was developed for the Textile City Sports Centre Gymnasium. Mean errors between simulated and measured results were 10.4% for displacement, 13.6% for stress during construction, and 13.3% for tension during service, indicating good agreement. This suggests that the SHM system operated well in both phases. Maximal stress and displacement after unloading were 215.9 MPa and 549 mm, below allowable limits. Monitoring results revealed temperature field non-uniformity with a 9°C maximal difference, and strong temperature-stress correlation, with Pearson coefficients of 0.971, 0.973, and 0.955 for tie rod, chord, and web. RRS movement significantly impacted midspan tie rods in long main trusses, with a mean tension change exceeding 1000 kN. The research methods and conclusions offer valuable references for developing and applying RRS's SHM system.

A Provably Secure and Lightweight Two-Factor Authentication Protocol for Wireless Sensor Network

Wireless Sensor Networks (WSNs) are rapidly being integrated into various fields, significantly impacting and facilitating many aspects of human life. However, the increasingly prominent security issues associated with WSNs have become a significant challenge. This paper provides an in-depth analysis of the security challenges faced by WSNs in resource constrained and open communication environments. As a key component of the Internet of Things (IoT), a WSN can perceive, collect and transmit physical environmental data in real-time, and is widely used in military, medical, agricultural and other fields. However, the insecurity of communication channels and unauthorized user access pose severe threats to network security and data integrity. To address these challenges, this paper proposes a provably secure two-factor authentication protocol. This protocol utilizes a Chebyshev chaotic map and a two-factor authentication mechanism, which not only enhances security in WSNs but also improves authentication efficiency. The protocol is validated through security proof and performance experiments, demonstrating excellent security, functionality and efficiency. This provides strong support for secure and efficient communication in WSNs across various application scenarios.

Design of Routing Algorithm for Communication of Power Wireless Sensor Networks Based on Improved Harmony Search

In this paper, a routing algorithm for the communication of power wireless sensor networks based on improved harmony search is proposed to reduce the communication routing delay and energy consumption of power wireless sensor networks. Firstly, according to the composition of communication routing delay and energy consumption of power wireless sensor networks, the delay model and energy consumption model are constructed respectively, and the objective function is constructed by assigning different weights. Then, artificial bee colony algorithm and Levy flight mechanism improved harmony search algorithm are adopted for solving the objective function. Experiment results reveal that the algorithm can meet different users’ different demands on delay and energy consumption. If the user needs low delay, set the low delay weight to 1 and the power consumption weight to 0, then the average delay is 7s, and the average power consumption is 3203J. When user demand is low energy consumption, set the delay weight to 0 and the energy consumption weight to 1, so that the average energy consumption is 2667J and the average delay is 15s, which can meet the needs of users.

Energy-saving clustering routing algorithm for heterogeneous wireless sensor networks based on energy iteration model and bee colony optimization

Aiming at the problems of large number of data transmission node deaths and large transmission energy consumption output in energy-saving clustering routing communication of wireless sensor networks, an energy-saving clustering routing algorithm for heterogeneous wireless sensor networks based on energy iteration model and bee colony optimization is proposed. Firstly, a network communication energy consumption model is constructed, and the network node distribution is optimized in time with the goal of reducing energy consumption combined with differential bee colony algorithm; then, based on the network node distribution optimization results, an energy-saving clustering method for heterogeneous wireless sensor networks is formulated, and the cluster head is determined by using the energy iteration cluster selection method, and the cluster head radius is obtained to complete the energy-saving clustering of communication nodes in heterogeneous wireless sensor networks; finally, the distance between the communication cluster head node and the base station is set, the routing level of the node communication is determined, and the energy-saving routing communication of the heterogeneous wireless sensor network is realized by combining the multi-hop routing communication mode. The experimental results show that when the method is used for network energy-saving clustering routing communication, the number of data transmission nodes that die is at most 22, and the maximum energy consumption of node transmission is 21 nJ/bit , indicating that the node communication energy-saving effect of this method is good.

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.

A cache-aware congestion control mechanism using deep reinforcement learning for wireless sensor networks

In Wireless Sensor Networks (WSN) communication protocols, rule-based approaches have been traditionally used for managing caching and congestion control. These approaches rely on explicitly defined, unchanging models. Recently, a trend has been toward incorporating adaptive methods that leverage machine learning (ML), including its subset deep learning (DL), during network congestion conditions. However, an adaptive cache-aware congestion control mechanism using Deep Reinforcement Learning (DRL) in WSN has not yet been explored. Therefore, this study developed a DRL-based adaptive cache-aware congestion control mechanism called DRL-CaCC to alleviate WSN during congestion scenarios. The DRL-CaCC uses intermediate caching parameters as its state space and adaptively moves the congestion window as its action space through the Rapid Start and DRL algorithms. The mechanism aims to find the optimal congestion window movement to avoid further network congestion while ensuring maximum cache utilization. Results show that DRL-CaCC achieved an average improvement gain between 20% and 40% compared to its baseline protocol, RT-CaCC. Finally, DRL-CaCC outperformed other caching-based and DRL-based congestion control protocols in terms of cache utilization, throughput, end-to-end delay, and packet loss metrics, with improvement gains between 10% and 30% in various congestion scenarios in WSN.

Achieving Reliability of Privacy-preserving Phantom Routing Protocols in Multi-hop Wireless Sensor Networks

Due to the open nature of wireless channels and sensor node resource constraints, it is challenging to secure the communication in wireless sensor networks (WSNs) while simultaneously protecting the privacy of node location data. Therefore, a significant amount of research focusing on source location privacy (SLP) protocols has been conducted. The amount of research on SLP reliability, meanwhile, is insignificant. This study explores the operational features of various privacy-preserving phantom routing protocols and simulates WSNs with varied network configurations to investigate how different routing strategies affect SLP reliability. Safety period and capture ratio metrics are used to compute SLP reliability. Simulation results show that integration of phantom routing with fake packet distribution mechanisms adversely impacts SLP reliability. SLP reliability decreases also as the number of fake packet sources increases. Research proves that a protocol with many fake packet sources achieves SLP reliability for a mission duration of 940 rounds, while a protocol with no fake packet sources achieves SLP reliability for 1658 rounds.

A key distribution technique for wireless sensor networks using spanning trees

Protocols for encrypting communications in wireless sensor networks have rarely been addressed from a classical network optimization perspective. An underlying procedure of such protocols, known as key distribution, involves assigning cryptographic keys to sensors, which are then used to encrypt and decrypt transmitted data. In context of maximizing communications security objectives, the combinatorial nature of assigning keys to sensors with limited memory capacities exhibits properties conducive to developing methods for finding optimal key distributions. This work focuses on the q-Composite key distribution/assignment protocol, which requires that two sensors share at least q common keys to securely exchange data. As a means of reducing the likelihood of large-scale information breaches if a small number of keys are compromised, a security objective of maximizing the number of non-redundant (unique) keys assigned to the sensors is considered. It is demonstrated that node (sensor) degrees in a spanning tree, along with their memory capacities, can be used to exactly determine the maximum possible number of non-redundant keys assigned. Leveraging on these properties, our method reduces the problem of assigning a maximum number of keys to that of finding a degree-bounded spanning tree in a network. A polynomial time solution algorithm along with a linear time algorithm for assigning a maximum number of unique keys is introduced. Broadly, the proposed method provides a novel approach for designing, analyzing, or identifying secure key distributions in large-scale networks by using properties of the underlying graphs.

Energy efficient data communication for WSN based resource constrained IoT devices

In the Internet of Things (IoTs) and wireless sensor networks (WSNs), improving security and energy efficiency are key concerns. Clustering, which involves managing cluster heads, plays a pivotal role in extending network lifetime. The selection of a cluster head, responsible for data transfer between nodes, is a key aspect of network management. This paper proposes two variants of a novel algorithm designed for energy efficient communication in a resource constrained IoT environments. One variant considers remaining energy, distance, and node degree for cluster head selection, while the other focuses on remaining energy and distance only. Including node degree ensures cluster heads do not waste energy by remaining idle or performing unnecessary tasks such as the cluster head selection process in every round. The authors tested these variants against several well known algorithms using MATLAB simulation environment, evaluating factors such as operating nodes, number of clusters, transmission energy, and remaining energy. The proposed algorithm extends network lifetime by maintaining more operating nodes for longer, not changing clusters or cluster heads frequently, minimizing energy consumption for transmission, and conserving more remaining energy. Consequently, the proposed algorithm outperforms existing approaches by addressing issues like zero cluster head selection, compulsory cluster head selection in every round, avoiding cluster heads that connect to no nodes, and preventing network destabilization due to unnecessary re-elections.

Path optimization algorithm for mobile sink in wireless sensor network

In order to alleviate the limitation of mobile sink in Wireless Sensor Network (WSN) by environmental and power problems, this paper proposes a new signal collection method for network communication in wireless sensor network with the goal of shortening the path of the mobile sink, and then proposes the ACO-TU (Ant Colony Optimization-Team Up) algorithm based on ant colony algorithm by adding concepts such as node pheromone. The algorithm groups the mobile units of the ant colony algorithm and further optimizes the sink path in the wireless sensor network by specific mobile strategies. Experimental results show that the method of sink moving path optimization proposed has a significant improvement in reducing power consumption and distance shortening, which can further increase the service life of the mobile sink and improve the quality of signal transmission. The results of comparison with the most recent relevant algorithms show that the ACO-TU algorithm has the best optimization performance, which proves the effectiveness of the algorithm.

Tangent sine search optimization enabled energy prediction and SWIPT‐based power transfer for energy‐aware communication in WSN

SummaryWith the rapid increase in energy utilization and the tremendously growing number of connected devices in wireless sensor networks (WSNs), alternate power transfer methods have not only become significant for scholastic purposes but also the growth of WSNs and the reduction of operational costs. Simultaneous wireless information and power transfer (SWIPT) is an emerging technology that has the potential to boost the lifespan of WSNs. This work presents an innovative approach to improving the energy efficiency of WSNs. Here, a WSN is considered, and energy‐aware communication is established in six phases, such as setup, steady state, energy prediction, SWIPT‐based power transfer, communication/route discovery, and route maintenance. Further, a hybrid approach named tangent sine search optimization (TSSO) is created to identify the ideal node as cluster head (CH). Later, the age of the neighboring nodes is forecasted utilizing the deep long short‐term memory (DLSTM), whose trainable parameters are selected using the proposed TSSO algorithm. A SWIPT‐based power transfer is also performed for harvesting the energy to avoid node failures. The proposed TSSO‐DLSTM+SWIPT is investigated given various metrics, like delay, residual energy, throughput, and trust, and the values attained are 0.784 s, 0.790 J, 0.970 Mbps, and 0.997, respectively without any attacks. The proposed TSSO‐DLSTM+SWIPT obtained performance improvement of 11.08%, 10.07%, 7.99%, and 5.83% than the Iterative algorithm in terms of delay, residual energy, throughput, and trust.

Secure data communication in WSN using Prairie Indica optimization

PurposeSecurity is the major issue that motivates multiple scholars to discover security solutions apart from the advantages of wireless sensor networks (WSN) such as strong compatibility, flexible communication and low cost. However, there exist a few challenges, such as the complexity of choosing the expected cluster, communication overhead, routing selection and the energy level that affects the entire communication. The ultimate aim of the research is to secure data communication in WSN using prairie indica optimization.Design/methodology/approachInitially, the network simulator sets up clusters of sensor nodes. The simulator then selects the Cluster Head and optimizes routing using an advanced Prairie Indica Optimization algorithm to find the most efficient communication paths. Sensor nodes collect data, which is securely transmitted to the base station. By applying prairie indica optimization to WSNs, optimize key aspects of data communication, including secure routing and encryption, to protect sensitive information from potential threats.FindingsThe Prairie Indica Optimization, as proposed, achieves impressive results for networks comprising 50 nodes, with delay, energy and throughput values of 77.39 ms, 21.68 J and 22.59 bps. In the case of 100-node networks, the achieved values are 80.95 ms, 27.74 J and 22.03 bps, significantly surpassing the performance of current techniques. These outcomes underscore the substantial improvements brought about by the Prairie Indica Optimization in enhancing WSN data communication.Originality/valueIn this research, the Prairie Indica Optimization is designed to enhance the security of data communication within WSN.

Energy-Efficient and Reliable Routing for Real-time Communication in Wireless Sensor Networks

Energy-Efficient and Reliable Routing for Real-time Communication in Wireless Sensor Networks

Energy efficient data dissemination in wireless sensor network enabled IoT using domain‐adaptive message passing graph neural network

SummaryIn the past few years, restricted wireless sensor networks (WSNs) enabled the Internet of Things (IoT) have attracted significant attention and expansion to enhance service delivery and resource efficiency. Dissemination is a service offered by WSN that uses radio transmission and over‐the‐air programming for updating the deployed sensor nodes through online. The centralized data dissemination methods are replaced by the distributed approaches because they affect the drawbacks of a single point of failure, no scalability, and insecurity. Therefore, an Energy Efficient Protocol for Data Dissemination in Wireless Sensor network‐enabled IoT using Domain‐Adaptive Message Passing Graph Neural Network (EEP‐WSN‐IoT‐DMPGNN) is proposed in this paper. The nodes are formed as clusters utilizing the Deep Fuzzy Curriculum Clustering (DFCC) technique that rewards nodes belonging to a given cluster. By using the Crayfish Optimization Algorithm (COA), the Cluster Head (CH) selection optimally chose the ideal CH and satisfies the multiple objective functions, such as energy, delay, traffic density, and distance. Afterward, domain‐adaptive Message Passing Graph Neural Network (DMPGNN) based routing protocol is developed, the input given to the routing protocol includes a sink, action history, future node, and maximum‐distance node, which attains enhanced data transfer in the chosen path. The proposed technique attains a lower no. of dead nodes, lower energy consumption, and higher Network Lifetime while analyzed with existing techniques, such as routing technique depending on deep learning for effectual data transmission in 5G WSN communication (DL‐RPDT‐WSN), Reinforcement‐Learning base energy effectual optimized routing protocol in WSN (RL‐EERP‐WSN), and Energy‐efficient intellectual routing method for IoT‐enabled WSN (EIR‐IoT‐WSN), respectively.

Enhancing security in wireless sensor networks: A fusion of deep learning and energy-efficient routing

The development of tiny sensing nodes efficient for wireless communication in Wireless Sensor Networks (WSNs) can be attributed to the rapid advancements in processors and radio technology. Data transmission occurs through multi-hop routing in WSN, which relies on nodes’ cooperation. The collaboration between nodes has rendered these networks susceptible to various attacks. It is imperative to employ a security scheme to evaluate the dependability of nodes in distinctive malicious nodes from non-malicious nodes. In recent years, there has been a growing significance placed on security-based routing protocols with energy constraints as valuable mechanisms for enhancing the security and performance of WSNs. A novel solution called the Deep Learning-based Hybrid Energy Efficient and Security System (DL-HE2S2) is introduced to address these challenges. The research workflow encompasses various essential stages, namely the deployment of nodes, the creation of clusters, the selection of cluster heads, the detection of malevolent nodes within each group, and the determination of optimal paths intra- and inter-clusters employing the routing algorithm for efficient packet transmission. The design of the algorithm is focused on achieving energy efficiency and enhancing network security while also taking into account various performance metrics, including a mean network lifetime of 187.244 hours, a throughput of 59.88 kilobits per second, an end-to-end latency of 11.939 milliseconds, a packet loss of 14.9%, a packet delivery ratio of 99.194%, network security at 92.026%, and energy usage of 19.424 J. This research examines the algorithm’s scalability and efficiency across various network sizes using a Network Simulator (NS-2). DL-HE2S2 offers valuable insights that can be applied to practical implementations in multiple applications.

Intelligent multi-agent model for energy-efficient communication in wireless sensor networks

The research addresses energy consumption, latency, and network reliability challenges in wireless sensor network communication, especially in military security applications. A multi-agent context-aware model employing the belief-desire-intention (BDI) reasoning mechanism is proposed. This model utilizes a semantic knowledge-based intelligent reasoning network to monitor suspicious activities within a prohibited zone, generating alerts. Additionally, a BDI intelligent multi-level data transmission routing algorithm is proposed to optimize energy consumption constraints and enhance energy-awareness among nodes. The energy optimization analysis involves the Energy Percent Dataset, showcasing the efficiency of four wireless sensor network techniques (E-FEERP, GTEB, HHO-UCRA, EEIMWSN) in maintaining high energy levels. E-FEERP consistently exhibits superior energy efficiency (93 to 98%), emphasizing its effectiveness. The Energy Consumption Dataset provides insights into the joule measurements of energy consumption for each technique, highlighting their diverse energy efficiency characteristics. Latency measurements are presented for four techniques within a fixed transmission range of 5000 m. E-FEERP demonstrates latency ranging from 3.0 to 4.0 s, while multi-hop latency values range from 2.7 to 2.9 s. These values provide valuable insights into the performance characteristics of each technique under specified conditions. The Packet Delivery Ratio (PDR) dataset reveals the consistent performance of the techniques in maintaining successful packet delivery within the specified transmission range. E-FEERP achieves PDR values between 89.5 and 92.3%, demonstrating its reliability. The Packet Received Data further illustrates the efficiency of each technique in receiving transmitted packets. Moreover the network lifetime results show E-FEERP consistently improving from 2550 s to round 925. GTEB and HHO-UCRA exhibit fluctuations around 3100 and 3600 s, indicating variable performance. In contrast, EEIMWSN consistently improves from round 1250 to 4500 s.

Energy harvesting‐enabled energy‐efficient routing using spotted hyena optimization in wireless sensor network

SummaryWith the continuous proliferation of sensing technology, it has become possible to utilize energy harvesting (EH)‐enabled sensor nodes for a variety of applications. However, conventional wireless sensor networks (WSNs), that is, those without EH‐enabled nodes, still have limited applicability due to their limited battery resources. Further, the utilization of EH‐enabled nodes in the network not only imposes a financial burden on the user but also limits its performance due to its dependence on environmental conditions. To address this concern, in this paper, we propose the EH‐enabled energy‐efficient routing (EHEER) technique for green communication in WSN. The predominant concern being addressed in this paper is the selection of cluster head (CH), which helps in gathering, aggregating and forwarding the data from the cluster‐based routing paradigm. We use the spotted hyena optimizer (SHO) algorithm for optimizing the fitness parameters for CH selection, namely, energy ratio, distance considerations, node density, load balancing and the network's average energy. We use EH‐enabled nodes in the network strategically so as to keep control over the costs incurred in the network. The simulation outcomes empirically prove the efficacy of the proposed work, as it effectively increases the network stability and operational period by a huge margin as compared to the existing techniques.

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.

Artificial Neural Network-Based Mechanism to Detect Security Threats in Wireless Sensor Networks.

Wireless sensor networks (WSNs) are essential in many areas, from healthcare to environmental monitoring. However, WSNs are vulnerable to routing attacks that might jeopardize network performance and data integrity due to their inherent vulnerabilities. This work suggests a unique method for enhancing WSN security through the detection of routing threats using feed-forward artificial neural networks (ANNs). The proposed solution makes use of ANNs' learning capabilities to model the network's dynamic behavior and recognize routing attacks like black-hole, gray-hole, and wormhole attacks. CICIDS2017 is a heterogeneous dataset that was used to train and test the proposed system in order to guarantee its robustness and adaptability. The system's ability to recognize both known and novel attack patterns enhances its efficacy in real-world deployment. Experimental assessments using an NS2 simulator show how well the proposed method works to improve routing protocol security. The proposed system's performance was assessed using a confusion matrix. The simulation and analysis demonstrated how much better the proposed system performs compared to the existing methods for routing attack detection. With an average detection rate of 99.21% and a high accuracy of 99.49%, the proposed system minimizes the rate of false positives. The study advances secure communication in WSNs and provides a reliable means of protecting sensitive data in resource-constrained settings.

Deep Reinforcement Learning-Based Energy Consumption Optimization for Peer-to-Peer (P2P) Communication in Wireless Sensor Networks.

The fast development of the sensors in the wireless sensor networks (WSN) brings a big challenge of low energy consumption requirements, and Peer-to-peer (P2P) communication becomes the important way to break this bottleneck. However, the interference caused by different sensors sharing the spectrum and the power limitations seriously constrains the improvement of WSN. Therefore, in this paper, we proposed a deep reinforcement learning-based energy consumption optimization for P2P communication in WSN. Specifically, P2P sensors (PUs) are considered agents to share the spectrum of authorized sensors (AUs). An authorized sensor has permission to access specific data or systems, while a P2P sensor directly communicates with other sensors without needing a central server. One involves permission, the other is direct communication between sensors. Each agent can control the power and select the resources to avoid interference. Moreover, we use a double deep Q network (DDQN) algorithm to help the agent learn more detailed features of the interference. Simulation results show that the proposed algorithm can obtain a higher performance than the deep Q network scheme and the traditional algorithm, which can effectively lower the energy consumption for P2P communication in WSN.