Strategies For Wireless Sensor Networks Research Articles

Fuzzy inference logic assisted rendezvous points based effective routing strategy in wireless sensor networks

SummaryIn this proposed strategy, an effective routing strategy is introduced for routing based on Rendezvous Points assisted fuzzy inference logics. First, sensor nodes in the cluster are created using the mean‐shift clustering mechanism (MS‐ClusT). A cluster head is selected for the clusters to gather aggregated data from the nodes of clusters. The cluster head selection is done using the Manta Ray optimization‐assisted modified network‐based fuzzy inference logic (MMFiL) approach. Rendezvous points are then selected for routing to minimize the delay and energy consumption for visiting all cluster heads. The rendezvous points are used to define the shortest route for routing. The shortest path from clusters to the base station by selecting rendezvous points is implemented using an integrated neural network with an Archer‐Fish optimization algorithm (InnAFo). In the end, the performance attained by the model is compared with the results of the classical strategy and returns a 0.976563 packet delivery rate and 0.029297 loss rate in 500 nodes. Furthermore, the throughput attained by the proposed model is 0.992874 Mbps, and the delay is 67.30 ms at 500 nodes. The analysis of the proposed model will result in less time needed for cluster head selection.

Wireless Sensor Placement Optimization for Bridge Health Monitoring: A Critical Review

In recent years, wireless sensors have progressively supplanted conventional limited sensors owing to their attributes of small size, low cost, and high accuracy. Consequently, there has been a growing interest in leveraging wireless sensor networks for bridge structural health monitoring applications. By employing wireless sensor nodes to gather data from various segments of the bridge, information is relayed to a signal-receiving base station. Subsequently, the health status of the bridge is inferred through specific data processing and analysis, aiding monitoring personnel in making informed decisions. Nonetheless, there are limitations in this research, particularly pertaining to power consumption and efficiency issues in data acquisition and transmission, as well as in determining the appropriate wireless sensor types and deployment locations for different bridge configurations. This study aims to comprehensively examine research on the utilization of wireless sensor networks in the realm of bridge structural health monitoring. Employing a systematic evaluation methodology, more than one hundred relevant papers were assessed, leading to the identification of prevalent sensing techniques, data methodologies, and modal evaluation protocols in current use within the field. The findings indicate a heightened focus among contemporary scholars on challenges arising during the data acquisition and transmission processes, along with the development of optimal deployment strategies for wireless sensor networks. In continuing, the corresponding technical challenges are provided to address these concerns.

An energy consumption optimization strategy for Wireless sensor networks via multi-objective algorithm

Deploying relay nodes is a significant mechanism to prolong the network lifetime of wireless sensor networks (WSNs). However, most existing studies overlook the energy consumption of relay nodes, leading to imperfections in the optimization process. Additionally, there is also a lack of analysis of conflicts between different optimization objectives. In this regard, a multi-objective antlion with fuzzy clustering algorithm (MOALO-FCM) is designed to obtain a better trade-off between different optimization objectives. And an adaptive membership function revision strategy is introduced to improve the energy balance of relay nodes. To verify the performance of the proposed algorithm, simulation experiments are set in 2-dimensional and 3-dimensional scenes with correlative algorithms, respectively. The main evaluation indexes include performance of Pareto optimal solution sets, the life cycle of network, the energy consumption of sensor nodes, the energy consumption of relay nodes, the number of living nodes, and the running time of algorithms. The results indicate that the proposed algorithm has better performance in various indexes.

Cryptographic image-based data security strategies in wireless sensor networks

There is need to develop and create new data protection mechanisms aimed at the compensating for the lack of security of WSNs. This paper introduces new cryptographic image-based techniques aimed at improving data security in WSNs. The solution also integrates imaging processing techniques with advanced cryptographic principles to merge a two-layered security architecture. This work provides a new WSN-specific encryption algorithm that delivers low energy consumption and smaller computational burden. Likewise, this is connected to an image-based authentication approach which employs steganographic methods in the information hiding technique. Intensive simulations allow the approach that supports methodology, naming increased security metrics obtained without decreasing in network performance. This study seeks to fill the gap in current practice in WSN security and provides a foundation for future research on image-based techniques integrated with cryptographic algorithms aiming at more secure data protection under limited resources.

Two-way differential strategy for wireless sensor networks

In this paper, a novel optimal two-way amplify and forward (AF) differential beamforming method for wireless sensor network is proposed. The proposed method is an advanced signal processing technique used to enhance the performance and reliability of the communication link by exploiting the diversity provided by multiple antennas. Unlike current state-of-the-art methods which require the knowledge of channel state information (CSI) at both transmitting and receiving antennas or at least at the receiving antennas, the suggested method does not need CSI at any transmitting or receiving antenna. Moreover, the proposed method enjoys high error performance with high diversity and coding gain and has a very low encoding and decoding complexity. Through our simulations, the proposed method is proved to outperform the best known non-coherent multi-antenna methods.

Providing an effective key management scheme to increase transaction security of homogeneous mobile wireless sensor networks

Network security is one of the key concerns with wireless sensor networks. Because sensor nodes employ radio channel frequencies, which are riskier than traditional networks, the attacker may be able to force the node to compromise, disrupt data integrity, eavesdrop, or insert false data into the network, wasting network resources. Creating dependable sensor networks that offer the highest level of security while using the fewest resources is thus one of the problems. The designers of wireless sensor networks can take into account providing an efficient key management system that can enhance any efficiency features such as communication overhead, calculation rate, memory demand, and energy consumption rate. The energy level of nodes is determined in this article using a novel approach based on fuzzy systems and simple to implement in both hardware and software. In this study, the memory needed to carry out the plan was decreased, and the search performance was raised by integrating elliptic curve cryptography with an AVL search tree and a LEACH model. Also, the frequency range of radio channels in this study is 2.4 GHz. Based on the theoretical analysis as well as the outcomes of the experiments, the suggested key management strategy for wireless sensor networks improves security while also reducing computational overhead by 23%, energy consumption by 14%, and memory consumption parameters by 14% . 18% of people have used the network. Additionally, it was demonstrated that the suggested approach is scalable and extendable. Because of this, the suggested technique has a wide range of applications in massive wireless sensor networks.

Maximize Lifetime of Wireless Rechargeable Sensor Networks with Mobile Energy-Limited Charging Device.

Mobile charging devices (MCDs) have been regarded as a promising way to solve the energy shortage of wireless sensor networks. Due to ignoring some important factors, such as redundant sensor nodes, there is still room to improve network lifetimes. We propose a charging strategy for wireless sensor networks with one energy-limited MCD. To give the best support for sensor nodes which need charging the most, an algorithm is proposed to find the minimum sensor nodes which keep the coverage and connectivity of the network and have the least energy requirements. Then, the goal of maximizing network lifetime is changed into how to utilize the limited energy of the MCD to guarantee the minimum sensor nodes work as long as possible. If the MCD has enough energy for all sensor nodes, the charging algorithm is designed to minimize the outage time of the network and maximize charging efficiency. Otherwise, if the energy capacity is larger than the least energy requirement, the charging target minimizes the outage time of the minimum sensor node; otherwise the charging problem becomes maximizing the lifetime of minimum sensor nodes, which has lower complexity. The results of simulation experiments confirm that our scheme prolongs network lifetime and improves charging efficiency.

Clustering Algorithms and Optimization Strategies in WSNs: A State-of-the-Art Review

Wireless Sensor Networks (WSNs) have emerged as a groundbreaking technology for collecting data on various physical phenomena, offering the potential to revolutionize infrastructure systems. The paper provides an exhaustive exploration of the existing literature on clustering algorithms within WSNs and the diverse optimization techniques proposed for cluster head selection. A comprehensive analysis of various routing protocols, mobility-based solutions, and energy conservation strategies is presented, shedding light on their respective strengths and limitations. The examination encompasses a wide spectrum of approaches, including hierarchical cluster-based routing, mobile sensor integration, and energy-efficient techniques inspired by industry standards like ZigBee. The paper further explores ecological monitoring applications, redundancy reduction mechanisms, and power- efficient hierarchical routing protocols, offering valuable insights into their contributions to the field. This review paper aims to consolidate and synthesize the wealth of knowledge in the domain of clustering algorithms and optimization techniques for WSNs. By assessing the strengths and weaknesses of these methodologies, it seeks to provide a comprehensive resource for researchers and practitioners in the field, ultimately contributing to the advancement of energy-efficient and reliable wireless sensor networks. Keywords— APTEEN, EARP, ECCP, GPS, HEED, LEACH, PEGASIS, TEEN, WSN.

An energy fault and consumption optimization strategy in wireless sensor networks with edge computing

With the operation of wireless sensor networks (WSNs), energy-constrained sensor nodes and inadequate energy constraint methods are becoming obsolete, as they reduce the efficiency of data transmission. The appearance of edge computing (EC) and causality graph provide a new opportunity for energy fault analysis and assessment in WSNs. As a result, by selecting a reliable data transmission path and averaging the energy consumption, we present an energy fault and consumption optimization (EFCO) algorithm for solving the energy hole and consumption balance (EHCB) problem in wireless sensor networks with edge computing (ECWSNs). Specifically, we first build a novel four-layer network architecture by using edge computing technology and causality graph theory. Then, the energy fault cost (EFC) in ECWSNs is formulated as an optimization problem that is constrained by the energy allocation of relay nodes. Furthermore, we propose a causal reasoning algorithm to deduce the single-value fault status probability of relay nodes. Finally, we utilize version 2 of a network simulator (NS-2) to evaluate the fault derivation and energy allocation efficiency of the EFCO algorithm in ECWSNs.

A fuzzy based approach to enhance the lifespan of sensor network

The use of wireless sensor networks (WSNs) for data collection is widespread. The resource constraint is an important factor in WSN communications design. The issue arises naturally in WSNs as a result of uneven energy consumption caused by multi-hop routing and dynamic network models, which substantially affects network lifetime. The nodes are dispersed over distant sensing areas and are powered by finite or limited energy batteries that are difficult to replace. The energy of nodes is reduced as a result of changes in network topology or the network’s lifespan and the main intention of this research is to figure out how to make sensor networks last longer. The suggested study work focuses on a specific routing strategy for WSNs that employs the AO-star algorithm with a Fuzzy approach and link stability for extending the network lifetime. The technique chooses the optimum routing path by the sensing point to the receiving node based on how much energy is consumed, the smallest number of nodes with the shortest latency, and lower transmission loads with higher throughput. To compare the proposed strategy’s efficiency in energy consumption balancing and network lifespan enhancement, the proposed technique may achieve a 30% longer average network lifetime than the A-star algorithm.

A Non-Dominated Sorting Genetic Algorithm Based on Voronoi Diagram for Deployment of Wireless Sensor Networks on 3-D Terrains

The deployment strategy for wireless sensor networks (WSNs) affects the quality of service (QoS). Adopting a reasonable deployment strategy can improve the QoS of WSNs. In this paper, the problem regarding sensor node deployment for WSNs on three-dimensional (3D) terrain is modeled as a multi-objective optimization problem. The coverage rate of the WSNs, their unbalanced energy consumption, and the number of sensor nodes are used as fitness functions for the optimization problem. We propose a non-dominated sorting genetic algorithm based on a Voronoi diagram (VNSGA) for solving the wireless sensor network deployment issue and improving the QoS of WSNs on 3D terrain. The proposed algorithm applies the Voronoi diagram to obtain the node-sensing radius and communication radius, which are suitable for 3D terrain with respect to calculating the fitness function of the optimization problem. The Pareto optimal solution is obtained by retaining the solution close to the reference point. The experiments compare the proposed algorithm with the Multi-Objective Particle Swarm Algorithm (MOPSO) and the Non-Dominated Sorting Genetic Algorithm III (NSGA-III) on two terrains with different ranges. The experimental results show that the proposed algorithm outperforms the comparison algorithm on both terrains with different range sizes. The proposed algorithm can improve the coverage to 97.95% and reduce the imbalance in energy consumption to 9.13% on large range terrain.

Variable duty cycle aware energy efficient clustering strategy for wireless sensor networks

Variable duty cycle aware energy efficient clustering strategy for wireless sensor networks

An Energy Efficient and Reliable Multipath Transmission Strategy for Mobile Wireless Sensor Networks.

Multipath data transmission is a key problem that needs to be solved urgently in wireless sensor networks. In this paper, sensor node failure, link failure, energy exhaustion, and external interference affect the stability and reliability of network data transmission. A multipath transmission strategy for wireless sensor networks based on improved shuffled frog leaping algorithm is proposed. A mathematical model of multipath transmission in wireless sensor networks is established. In the shuffled frog leaping algorithm, combined with the transition probability in the particle swarm optimization algorithm, random individuals in the subgroup are introduced to assist the search when updating the frog individual position, which improves the algorithm's ability to jump out of the local optimum and improves the quality of the optimization algorithm solution. The model is applied to multipath transmission in wireless sensor networks. Then, the shuffled frog leaping algorithm is used to update, divide, and reorganize the sensor nodes to select the optimal node to establish the optimal transmission path and improve the stability and reliability of the network. Simulation experiments show that the algorithm in this paper can ensure the reliability of data transmission, reduce the network packet loss rate and network energy consumption, and reduce the average delay of data transmission.

A High-Performance Energy-Balanced Forwarding Strategy for Wireless Sensor Networks

The wireless sensor network (WSN) is composed of several sensor nodes organized by multi-hop self-organization, which is a typical network for the industrial internet in industrial application. However, the energy using and processing capacity of each node are greatly limited. Therefore, it is of great significance to study energy-saving and efficient communication protocols for WSN. To prolong the lifetime of WSN and improve network throughput, a high throughput routing protocol with balanced energy consumption is proposed. The designed protocol first employs the K-means clustering algorithm to cluster the nodes, then calculates the weights based on the residual energy of and distance between the nodes, and finally selects the best node as the cluster head. Moreover, the optimal size of the package is determined by the parameters of the wireless transceiver and the channel conditions. In the data transmission stage, the Dijkstra algorithm is used to calculate the multi-objective weight function as the link cost. Experimental results demonstrate the superior performance of the proposed protocol over the CERP and TEEN routing protocols in terms of energy saving of network nodes, so as to improve the throughput and survival time of the entire system.

Congestion and Computer Program Control Algorithm Strategy for Wireless Sensor Networks Based on Cloud Model

Cloud model and sensor network are the research hotspots in recent years. This paper proposes a congestion and rate control strategy for wireless sensor networks based on cloud model. It adjusts the input rate of nodes based on cloud model through node congestion detection. Aiming at the problem of network congestion control, two congestion adjustment algorithms based on red are improved. Congestion threshold and congestion degree are used as the basis of packet transmission rate adjustment to realize network support plug control. In this paper, the congestion control strategy NP starts to alleviate congestion at about 40 s and controls the packet loss rate at about 116 packets/s, which is 45.3% lower than the multipath congestion control strategy and is more stable. However, when β = 0 , the packet loss rate of the double congestion threshold algorithm is 20% lower than that of the single congestion threshold algorithm. The reason is that the double congestion threshold algorithm allows a stronger source rate control mechanism earlier than the single congestion threshold algorithm a large number of packets are lost in a point, but this also makes the network performance relatively low.

Intrusion Detection Based on Generative Adversarial Network of Reinforcement Learning Strategy for Wireless Sensor Networks

Due to the wireless nature of wireless sensor networks (WSN), the network can be deployed in most of the unattended environment, which makes the networks more vulnerable for attackers who may listen to the traffic and inject their own nodes in the sensor network. In our work, we research on a novel machine learning algorithm on intrusion detection based on reinforcement learning (RL) strategy using generative adversarial network (GAN) for WSN which can automatically detect intrusion or malicious attacks into the network. We combine Actor-Critic Algorithm in RL with GAN in a simulated WSN. The GAN is employed as part of RL environment to generate fake data with possible attacks, which is similar to the real data generated by the sensor networks. Its main aim is to confuse the adversarial network into differentiating between the real and fake data with possible attacks. The results that is from the experiments are based on environment of GAN and Network Simulator 3 (NS3) illustrate that Actor-Critic&GAN algorithm enhances security of the simulated WSN by protecting the networks data against adversaries and improves on the accuracy of the detection.

A novel topology optimization of coverage-oriented strategy for wireless sensor networks

Aiming at the key optimization problems of wireless sensor networks in complex industrial application environments, such as the optimum coverage and the reliability of the network, a novel topology optimization of coverage-oriented strategy for wireless sensor networks based on the wolf pack algorithm is proposed. Combining the characteristics of topology structure of wireless sensor networks and the optimization idea of the wolf pack algorithm redefines the group’s wandering and surprise behavior. A novel head wolf mutation strategy is proposed, which increases the neighborhood search range of the optimal solution, enhances the uniformity of wolf pack distribution and the ergodicity ability of the wolf pack search, and greatly improves the calculation speed and the accuracy of the wolf pack algorithm. With the same probability, the cluster heads are randomly selected periodically, and the overall energy consumption of wireless sensor networks is evenly distributed to the sensor node to realize the balanced distribution of the data of the member nodes in the cluster and complete the design of the topology optimization of wireless sensor networks. Through algorithm simulation and result analysis, compared with the particle swarm optimization algorithm and artificial fish swarm algorithm, the wolf swarm algorithm shows its advantages in terms of the residual energy of the sensor node, the average transmission delay, the average packet delivery rate, and the coverage of the network. Among them, compared with the particle swarm optimization algorithm and artificial fish swarm algorithm, the remaining energy of nodes has increased by 9.5% and 15.5% and the average coverage of the network has increased by 10.5% and 5.6%, respectively.

Energy Harvesting Strategies for Wireless Sensor Networks and Mobile Devices: A Review

Wireless sensor network nodes and mobile devices are normally powered by batteries that, when depleted, must be recharged or replaced. This poses important problems, in particular for sensor nodes that are placed in inaccessible areas or biomedical sensors implanted in the human body where the battery replacement is very impractical. Moreover, the depleted battery must be properly disposed of in accordance with national and international regulations to prevent environmental pollution. A very interesting alternative to power mobile devices is energy harvesting where energy sources naturally present in the environment (such as sunlight, thermal gradients and vibrations) are scavenged to provide the power supply for sensor nodes and mobile systems. Since the presence of these energy sources is discontinuous in nature, electronic systems powered by energy harvesting must include a power management system and a storage device to store the scavenged energy. In this paper, the main strategies to design a wireless mobile sensor system powered by energy harvesting are reviewed and different sensor systems powered by such energy sources are presented.

Energy-Efficient Load Balancing Strategy for Wireless Sensor Networks using Quasi-oppositional based Jaya Optimization

The area of wireless sensor networks (WSNs) has gained significant attention from researchers due to its expansive range of applications, such as industrial regulation, human detection, and medical diagnosis. WSN is a vast number of geographically scattered devices that use sensor nodes to communicate and gather information from the target region. In clustered WSNs, the cluster head (CH) is deliberated as the relay node at a higher energy level than the non-CH nodes. The relay nodes perform more tasks related to the non-CHs, and these relay nodes are restricted by energy and communication capacity. Therefore, balancing the load of the relay node is a significant concern for improving the performance of the WSNs. Clustering is a well-known technique enforced to balance the load of the relay nodes. Often, densely loaded relay nodes dissolve their energy in less time and may cause changes in the topology of the network. In this study, we propose a Quasi-oppositional based Jaya load balancing strategy (QOJ-LBS) with a novel fitness function to address the issue of load balancing. The novel fitness function derived from the convex combination of the least lifespan of the relay node across the network and the entropy value of the lifespan of all relay nodes. The proposed QOJ-LBS justifies the network performance under two different WSN conditions called scenario-1 and scenario-2 with single-hop and multi-hop routing. The experimental analysis shows that improvement in network lifespan, total energy utilization, and the number of active sensor nodes of WSN is statistically significant in proposed QOJ-LBS compared to other state-of-the-art algorithms.

Self-organising map-based dynamic decision-making algorithm for heterogeneous wireless sensor network

ABSTRACT Wireless sensor networks (WSNs) are applicable in most of the domains of engineering. Presently, Heterogeneous WSN (HWSN) is gaining more importance than homogeneous WSN. One of the major challenges of a HWSN is efficient deployment which can provide good coverage. The deployment strategy in WSN can be static or dynamic. It is found that there is a need of dynamic deployment that intelligently places the sensor nodes in the deployment area. This intelligence is possible by one of the artificial neural networks concept like self-organizing map (SOM). This work presents a dynamic decision-making algorithm (DDMA) for deployment of sensors using SOM such that the nodes will adjust their locations to uncovered area by failed sensor node in the changing sensing environment. The DDMA is compared with LEA2C and ECBS which are variants of LEACH. The results show that proposed DDMA performs better than the existing algorithm in-terms of decreased node depletion rate by 35% and 25% more coverage. The experimental analysis also show that SOM-based DDMA performs better than the non-SOM-based DDMA deployment for HWSN in terms of 5% better energy conservation, 30% better network lifetime, 75% more coverage in the deployment area and 90% reduced node depletion rate. This work presents a dynamic decision-making algorithm (DDMA) for deployment of sensors using self-organising map (SOM) such that the nodes will adjust their locations to uncovered area by failed sensor node in the changing sensing environment. The DDMA is compared with variants of LEACH with existing LEA2C and ECBS. The results show that proposed DDMA performs better than the existing algorithm in-terms of decreased node depletion rate by 35% and 25% more coverage. The experimental analysis is performed between SOM-based and non-SOM-based DDMA algorithms. Results show that SOM-based DDMA performs better than the non-SOM-based DDMA deployment for heterogeneous WSN in terms of 5% better energy conservation, 30% better network lifetime, 75% more coverage in the deployment area and 90% reduced node depletion rate.