Wireless Sensor Network Scenario Research Articles

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.

Fast-converging chain-cluster-based routing protocols using the Red-Deer Algorithm in Wireless Sensor Networks

PurposeThe performance of Wireless Sensor Networks (WSNs) applications is bounded by the limited resources of battery-enabled Sensor Nodes (SNs), which include energy and computational power; the combination of which existing research seldom focuses on. Although bio-inspired algorithms provide a way to control energy usage by finding optimal routing paths, those which converge slower require even more computational power, which altogether degrades the overall lifetime of SNs.Design/methodology/approachHence, two novel routing protocols are proposed using the Red-Deer Algorithm (RDA) in a WSN scenario, namely Horizontal PEG-RDA Equal Clustering and Horizontal PEG-RDA Unequal Clustering, to address the limited computational power of SNs. Clustering, data aggregation and multi-hop transmission are also integrated to improve energy usage. Unequal clustering is applied in the second protocol to mitigate the hotspot problem in Horizontal PEG-RDA Equal Clustering.FindingsComparisons with the well-founded Ant Colony Optimisation (ACO) algorithm reveal that RDA converges faster by 85 and 80% on average when the network size and node density are varied, respectively. Furthermore, 33% fewer packets are lost using the unequal clustering approach which also makes the network resilient to node failures. Improvements in terms of residual energy and overall network lifetime are also observed.Originality/valueProposal of a bio-inspired algorithm, namely the RDA to find optimal routing paths in WSN and to enhance convergence rate and execution time against the well-established ACO algorithm. Creation of a novel chain cluster-based routing protocol using RDA, named Horizontal PEG-RDA Equal Clustering. Design of an unequal clustering equivalent of the proposed Horizontal PEG-RDA Equal Clustering protocol to tackle the hotspot problem, which enhances residual energy and overall network lifetime, as well as minimises packet loss.

An energy‐efficient technique for mobile‐wireless‐sensor‐network‐based IoT

Wireless sensor networks (WSNs) are one of the basic building blocks of Internet of Things (IoT) systems. However, the wireless sensing nodes in WSNs suffer from energy constraint issues because the replacement/recharging of the batteries of the nodes tends to be difficult. Furthermore, a number of realistic IoT scenarios, such as habitat and battlefield monitoring, contain mobile sensing elements, which makes the energy issues more critical. This research paper focuses on realistic WSN scenarios that involve mobile sensing elements with the aim of mitigating the attendant energy constraint issues using the concept of radio-frequency (RF) energy extraction. The proposed technique incorporates a cluster head election workflow for WSNs that includes mobile sensing elements capable of RF energy harvesting. The extensive simulation analysis demonstrated the higher efficacy of the proposed technique compared with the existing techniques in terms of residual energy, number of functional nodes, and network lifetime, with approximately 50% of the nodes found to be functional at the 4000th, 5000th, and 6000th rounds for the proposed technique with initial energies of 0.25, 0.5 and 1 J, respectively.

A Hybrid Routing Protocol Based on Naïve Bayes and Improved Particle Swarm Optimization Algorithms

Clustering of sensor nodes is a prominent method applied to wireless sensor networks (WSNs). In a cluster-based WSN scenario, the sensor nodes are assembled to generate clusters. The sensor nodes also have limited battery power. Therefore, energy efficiency in WSNs is crucial. The load on the sensor node and its distance from the base station (BS) are the significant factors of energy consumption. Therefore, load balancing according to the transmission distance is necessary for WSNs. In this paper, we propose a hybrid routing algorithm based on Naïve Bayes and improved particle swarm optimization algorithms (HRA-NP). The cluster heads (CHs) are selected according to the CH conditional probability, which is estimated by the Naïve Bayes classifier. After the selection of the CHs, the multi-hop routing algorithm is applied to the CHs. The best routing path from each CH to the BS is obtained from an improved particle swarm optimization (PSO) algorithm. Simulations were conducted on evaluation factors such as energy consumption, active sensor nodes per round, the sustainability of the network, and the standard deviation of a load on the sensor node. It was observed that HRA-NP outperforms comparable algorithms, namely DUCF, ECRRS, and FC-RBAT, based on the evaluation factors.

Optimization of Head Cluster Selection in WSN by Human-Based Optimization Techniques

Wireless sensor networks (WSNs) are characterized by their ability to monitor physical or chemical phenomena in a static or dynamic location by collecting data, and transmit it in a collaborative manner to one or more processing centers wirelessly using a routing protocol. Energy dissipation is one of the most challenging issues due to the limited power supply at the sensor node. All routing protocols are large consumers of energy, as they represent the main source of energy cost through data exchange operation. Cluster-based hierarchical routing algorithms are known for their good performance in energy conservation during active data exchange in WSNs. The most common of this type of protocol is the Low-Energy Adaptive Clustering Hierarchy (LEACH), which suffers from the problem of the pseudo-random selection of cluster head resulting in large power dissipation. This critical issue can be addressed by using an optimization algorithm to improve the LEACH cluster heads selection process, thus increasing the network lifespan. This paper proposes the LEACH-CHIO, a centralized cluster-based energy-aware protocol based on the Coronavirus Herd Immunity Optimizer (CHIO) algorithm. CHIO is a newly emerging human-based optimization algorithm that is expected to achieve significant improvement in the LEACH cluster heads selection process. LEACH-CHIO is implemented and its performance is verified by simulating different wireless sensor network scenarios, which consist of a variable number of nodes ranging from 20 to 100. To evaluate the algorithm performances, three evaluation indicators have been examined, namely, power consumption, number of live nodes, and number of incoming packets. The simulation results demonstrated the superiority of the proposed protocol over basic LEACH protocol for the three indicators.

A secure localization scheme based on trust assessment for WSNs using blockchain technology

Wireless Sensor Network (WSN) is one of the integral part of the present ubiquitous and pervasive computing. The smartness of the applications is incomplete without WSNs. Almost all the scenarios of WSNs require efficient and accurate localization process. However, the main disadvantage of the existing frameworks and algorithms is that they are not so much significant with the trust of the beacon nodes which are integral part of WSNs. This must be ensured for localization. In our present solution, we consider this issue.It is obvious to have the malicious nodes in the hostile environment of WSN operations. Our proposed solution, therefore, address this challenge and provides a trust-based framework for secure localization. It focus on the trust assessment algorithm and blockchain generation. In the localization process, trust values of each beacon node are computed based on different trust metrics and the corresponding weights are dynamically adjusted. Subsequently, for the mining process, higher trusty beacon nodes are only selected. This two-step approach ensures an updated blockchain with reliability and consistent trust values of all beacon nodes. We perform a set of simulations to validate the performance and effectiveness of the proposed algorithm. The results are comparatively analyzed based on localization accuracy, detection of malicious activities, False Positive Rate (FPR), and False Negative Rate (FNR). In all the aspects our solution outperforms the other algorithms.

Performance Analysis of the IEEE 802.15.4 Protocol for Smart Environments under Jamming Attacks.

Jamming attacks in wireless sensor networks (WSNs) scenarios are detrimental to the performance of these networks and affect the security and stability of the service perceived by users. Therefore, the evaluation of the effectiveness of smart environment platforms based on WSNs has to consider the system performance when data collection is executed under jamming attacks. In this work, we propose an experimental testbed to analyze the performance of a WSN using the IEEE 802.15.4 CSMA/CA unslotted mode under jamming attacks in terms of goodput, packet receive rate (PRR), and energy consumption to assess the risk for users and the network in the smart scenario. The experimental results show that constant and reactive jamming strategies severely impact the evaluated performance metrics and the variance’ of the received signal strength (RSS) for some signal-to-interference-plus-noise ratio (SINR) ranges. The measurements obtained using the experimental testbed were correlated with analytical models. The results show that in the presence of one interferer, for SINR values higher than dB, the PRR is almost , and the goodput Kbps, but the system performance is significantly degraded when the amount of interferers increases. Additionally, the energy efficiency associated with reactive strategies is superior to the constant attack strategy. Finally, based on the evaluated metrics and with the proposed experimental testbed, our findings offer a better understanding of jamming attacks on the sensor devices in real smart scenarios.

Competitive swarm optimization based unequal clustering and routing algorithms (CSO-UCRA) for wireless sensor networks

Cluster based routing approaches have been researched extensively for saving energy of wireless sensor networks (WSNs). In a cluster based routing mechanism, cluster heads (CHs) cooperate mutually to forward their data to the base station (BS) through multi-hop fashion. Due to this process, CHs near to the BS loaded with huge relay traffic and tend to die quickly, which causes partition of the network is popularly known as a hot-spot problem. To tackle the hot-spot problem, in this paper, competitive swarm optimization (CSO) based algorithms have been proposed, jointly call these algorithms as CSO-UCRA (CSO based Unequal Clustering and Routing Algorithms). First, the CH selection algorithm has been presented which is based on CSO based technique, next assign the non-CH sensors to CHs based on the derived CHproficiency function. Finally, a CSO based routing algorithm has been presented. Efficient particle encoding schemes and novel fitness functions have been developed for these algorithms. The CSO-UCRA is simulated extensively with varying number of sensor nodes and CHs for various WSN scenarios, and the obtained results are compared with some recent devised algorithms and standard meta-heuristic based algorithm called PSO-UCRA to show the efficiancy in terms of various performance metrics. CSO-UCRA shows decreased energy consumption of 28.48%, 22.55%, 12.92%, and 3.81%, increased network lifetime of 56.92%, 46.02%, 26.2%, and 8.04% and increased data packets received 73%, 52.5%, 20.8%, and 6.18% over EBUC, EAUCF, EPUC and PSO-UCRA respectively.

Energy efficient fuzzy clustering and routing using BAT algorithm

Clustering of sensor nodes is one of the prominent methods applied to Wireless Sensor Networks (WSN). In the cluster-based WSN scenario, the sensor nodes are assembled to generate clusters. The sensor nodes are composed of limited battery power. Therefore, energy efficiency in WSN is crucial. A load of sensor node and its distance from base station (BS) are the significant factors of energy consumption. Therefore, load balancing according to the transmission distance is necessary for WSN. In this paper, we propose a load-balanced clustering algorithm using Fuzzy C means (FCM) algorithm and an energy-efficient routing approach using BAT-algorithm (FC-RBAT). The cluster heads (CHs) are selected according to the score of the sensor node from each cluster. After selection of the CHs, the BAT-inspired routing algorithm is applied on the CHs. The best routing path from each CH to the BS is obtained from the proposed approach. The simulations are conducted on evaluation factors such as energy consumption, active sensor nodes per round, the sustainability of the network and the standard deviation of a load of the sensor node. It is observed that FC-RBAT outperforms compared algorithms, namely EAUCF, DUCF and SGA, under the evaluation factors.

AODV routing protocol performance assessment for wireless sensor network scenarios

Emerging WSN applications include a wide selection of traditional situations with many nodes. The messages are propagated through intermediate nodes, in order to ensure correct contact between the network nodes with the base station, so that a path has many connexions. Generally speaking, the nodes on the sensor network are distinguished by their minimal resources, so protocols must be used that not only guarantee connectivity but also conserve the most energy while maintaining scalability. Different protocols for routing wireless sensor networks have been suggested, however, reactive routing algorithms have been shown to be energy efficient and adaptable to wireless sensor networks. In this paper, under the OMNeT + + simulation platform, the performance of the reactive protocol will be tested, evaluating different scripts. In contrast to the supplementary responsive protocols stated in literature, the AODV protocol has been selected for supremacy in performance. The following parameters have been evaluated: the transmission rate of packets, average delays, overhead routing and energy usage. The findings show that AODV decreases its efficiency with the growth in the number of nodes. As a result, its usability limits the network scalability and the outcomes demonstration that the spatial distribution of nodes affects protocol performance. The standardised delivery shows the best outcomes for our particular works.

An Intelligent and Optimal Resource Allocation Approach in Sensor Networks for Smart Agri-IoT

A Wireless Sensor Network (WSN) is of paramount importance in facilitating smart Agricultural Internet of Things (Agri-IoT). It connects numerous sensor nodes or devices to develop a robust framework for efficient and seamless communication with improved throughput for intelligent networking. Such enhancement has to be facilitated by an adequate and smart machine learning-based resource allocation approach. With the ensuing surge in the volume of devices being deployed from the smart Agri-IoT, applications such as intelligent irrigation, smart crop monitoring and smart fishery would be largely benefited. However, the existing resource allocation techniques would be inefficient for such anticipated energy-efficient networking. To this end, we develop a distributed artificial intelligence approach that applies efficient multi-agent learning over the WSN scenario for intelligent resource allocation. The approach is based on dynamic clustering which coupled tightly with the Back-Propagation Neural Network and empowered by the Particle Swarm Optimization (BPNN-PSO). We implement the overall framework using a Bayesian Neural Network, where the outputs from BPNN-PSO are supplied as weights to the underlying neuron layer. We observe that the cost function and energy consumption demonstrate a substantial improvement in terms of cooperative networking and efficient resource allocation. The approach is validated with simulations under realistic assumptions.

Enhanced Particle Swarm Optimization for Effective Relay Nodes Deployment in Wireless Sensor Networks

One of the critical design problems in Wireless Sensor Networks (WSNs) is the Relay Node Placement (RNP) problem. Inefficient deployment of RNs would have adverse effects on the overall performance and energy efficiency of WSNs. The RNP problem is a typical example of an NP-hard optimization problem which can be addressed using metaheuristics with multi-objective formulation. In this paper, we aimed to provide an efficient optimization approach considering the unconstrained deployment of energy-harvesting RNs into a pre-established stationary WSN. The optimization was carried out for three different objectives: energy consumption, network coverage, and deployment cost. This was approached using a novel optimization approach based on the integration of the Particle Swarm Optimization (PSO) algorithm and a greedy technique. In the optimization process, the greedy algorithm is an essential component to provide effective guidance during PSO convergence. It supports the PSO algorithm with the required information to efficiently alleviate the complexity of the PSO search space and locate RNs in the spots of critical significance. The evaluation of the proposed greedy-based PSO algorithm was carried out with different WSN scenarios of varying complexity levels. A comparison was established with two PSO variants: the classical PSO and a PSO hybridized with the pattern search optimizer. The experimental results demonstrated the significance of the greedy algorithm in enhancing the optimization process for all the considered PSO variants. The results also showed how the solution quality and time efficiency were considerably improved by the proposed optimization approach. Such improvements were achieved using a simple integration technique without adding to the complexity of the system and introducing additional optimization stages. This was more evident in the RNP scenarios of considerably large search spaces, even with highly complex and challenging setups.

ENERGY EFFICIENT PIGEON INSPIRED OPTIMIZATION ALGORITHM BASED CLUSTERING AND ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

Owing to the advancement in recent technologies, Wireless Sensor Networks (WSNs) plays a vital role in today's real-world application. In WSN, energy efficiency is considered as the crucial process to conserve the energy and lengthen network lifetime. Most of the research has aroused in preserving energy with various enriched energy-efficient clustering and routing approaches. Therefore, the proper selection of cluster heads (CHs) and optimal route selection plays a vital role to achieve energy efficiency and prolong the network lifetime. In this work, we propose an optimistic approach for energy-efficient Pigeon Optimization Algorithm based Clustering and Dempster-Shafer (DS)for Routing called(PIOA-DS) Protocol for WSN. The PIOA-DS model involves two major phases namely PIO based clustering algorithm and DS evidence theory based Routing (DSET-R). The PIO algorithm derives a fitness function using residual energy, distance to base station (BS), and distance to neighbors. In addition to that, the non-cluster head nodes will join the respective CHs using the weight functions. Besides, the DSET-R algorithm finds an optimal set of routes based on three measures namely transmission power efficiency ratio, Idleness degree, and Energy density factor. The performance of the presented algorithm is tested extensively on various scenarios of WSNs. The observed results are compared with some existing algorithms to illustrate the superiority of the PIOA-DS work.

CAFD: Context-Aware Fault Diagnostic Scheme towards Sensor Faults Utilizing Machine Learning.

Sensors’ existence as a key component of Cyber-Physical Systems makes it susceptible to failures due to complex environments, low-quality production, and aging. When defective, sensors either stop communicating or convey incorrect information. These unsteady situations threaten the safety, economy, and reliability of a system. The objective of this study is to construct a lightweight machine learning-based fault detection and diagnostic system within the limited energy resources, memory, and computation of a Wireless Sensor Network (WSN). In this paper, a Context-Aware Fault Diagnostic (CAFD) scheme is proposed based on an ensemble learning algorithm called Extra-Trees. To evaluate the performance of the proposed scheme, a realistic WSN scenario composed of humidity and temperature sensor observations is replicated with extreme low-intensity faults. Six commonly occurring types of sensor fault are considered: drift, hard-over/bias, spike, erratic/precision degradation, stuck, and data-loss. The proposed CAFD scheme reveals the ability to accurately detect and diagnose low-intensity sensor faults in a timely manner. Moreover, the efficiency of the Extra-Trees algorithm in terms of diagnostic accuracy, F1-score, ROC-AUC, and training time is demonstrated by comparison with cutting-edge machine learning algorithms: a Support Vector Machine and a Neural Network.

A Robust Self-Organizing Tree-Based Routing Protocol for Wireless Sensor Networks

For a wireless sensor network (WSN), routing protocols not only affect the reliability and real-time data transmission but also affect the energy consumption of communication and the survival time of the entire network. In this paper, a routing protocol is proposed that combines virtual potential energy with local density of nodes and sleep-wake-up mechanism. The proposed routing protocol is self-organizing and robust. The routing protocol allows nodes to dynamically join or leave the network and enables nodes to automatically transmit information along the shortest path to reach a corresponding sink. The protocol can be applied in scenarios of single sink, multiple sinks, and three-dimensional WSNs. At the same time, the protocol takes a sleep-wake-up mechanism into account, makes a significant decrease in total network traffic, and achieves energy-saving as much as possible. Examples are given in detail to illustrate the effectiveness of the proposed routing protocol.

An energy-efficient cluster head selection in wireless sensor network using grey wolf optimization algorithm

Clustering is considered as one of the most prominent solutions to preserve theenergy in the wireless sensor networks. However, for optimal clustering, anenergy efficient cluster head selection is quite important. Improper selectionofcluster heads(CHs) consumes high energy compared to other sensor nodesdue to the transmission of data packets between the cluster members and thesink node. Thereby, it reduces the network lifetime and performance of thenetwork. In order to overcome the issues, we propose a novelcluster headselection approach usinggrey wolf optimization algorithm(GWO) namelyGWO-CH which considers the residual energy, intra-cluster and sink distance.In addition to that, we formulated an objective function and weight parametersfor anefficient cluster head selection and cluster formation. The proposedalgorithm is tested in different wireless sensor network scenarios by varyingthe number of sensor nodes and cluster heads. The observed results conveythat the proposed algorithm outperforms in terms of achieving better networkperformance compare to other algorithms.

Energy Aware Efficient Data Aggregation (EAEDAR) with Re-scheduling Mechanism Using Clustering Techniques in Wireless Sensor Networks

In present scenario of wireless sensor networks and communications, efficient sensed data transmission among nodes is being a great confrontation because of the impulsive and volatile nature of sensors in the network. For providing that and enhancing network lifetime, there are several approaches are developed, specifically using clustering techniques. Still, there are requirements for energy based efficient routing in WSN. With that note, this paper develops anEnergy Aware Efficient Data Aggregation (EAEDAR) and Data Re-Schedulingwith the incorporation of clustering techniques. Moreover, the model used energy based cluster formation and cluster head selection for increasing the network stability and data delivery rate. The model comprises four main phases, namely, Energy factor based cluster formation, Aggregator_SN (Sensor Node) Selection, Efficient Data Aggregation (EDA) and Data Re-Scheduling based on delay and processing time. Furthermore, the model is updated with respect to the status of the nodes and links, for providing consistent network with improved reliable data transmissions. The simulation results portrays the effectiveness of the proposed model over other compared works in terms of the performance factors such as, throughput, packet delivery ratio, network lifetime, transmission delay and packet drop.

Optimization for connectivity and coverage issue in target‐based wireless sensor networks using an effective multiobjective hybrid tunicate and salp swarm optimizer

SummaryThe two main important issues in designing target‐based wireless sensor networks (WSNs) are coverage and connectivity maximization. In order to tackle the coverage and connectivity problems, we have proposed a hybrid optimization‐based model. Thereby, the target‐based WSNs can include the sensor nodes which are placed based on determining minimum number of selected potential positions. To do that, an optimization approach based on a hybrid tunicate swarm optimizer (TSO) and salp swarm optimizer (SSO) is proposed for coverage and connectivity problems in WSNs. Feature exploitation ability of SSO is improved by TSO operators, because these operators can act as local search operators. Basically, these hybrid algorithm operators are used to derive the fitness function followed with the solution representation step. Initially, the population is generated, and the hybrid tunicate swarm optimizer and salp swarm optimizer (HTSS) algorithm has updated the solutions in the next subsequent step. Ultimately, the nondominated solutions are determined in the final step. The two different scenarios of WSN are used for simulation of this scheme. Simulations have shown its outstanding performance in solving the coverage and connectivity problems in wireless networks.

A novel energy-efficient encryption algorithm for secure data in WSNs

Wireless sensor networks (WSNs) are typically deployed environments, often very hostile and without assistance. A certain level of security must be provided. However, the resource constraint is the most important characteristic of this network. Indeed, WSNs are limited in terms of calculation, CPU, battery, etc. Therefore, a solution that aims to conserve these resources is widely desired. In this paper, we focus on the problem of encryption algorithm complexity. Some of the existing encryption algorithms provide high calculation cost, require large memory and are not applicable for WSNs scenarios. Based on Feistel structure, we propose a novel ultra-lightweight encryption algorithm, named ULEA. Besides diffusion and confusion of data, ULEA assumes minor encryption rounds with simplified transformations and functions to complex the cipher. The security analysis and experimental results suggest that the ULEA algorithm is an appropriate, low storage space, energy-efficient encryption process with high security for WSNs.

Fault diagnosis based on extremely randomized trees in wireless sensor networks

Wireless Sensor Network (WSN) being highly diversified cyber–physical system makes it vulnerable to numerous failures, which can cause devastation towards safety, economy, and systems’ reliability. Precise detection and diagnosis of failures or faults in WSN is a challenging issue due to the diversity of deployment and the limitations in the sensors’ resources. In this paper, supervised machine learning-based technique is considered to scrutinize the behavior of sensors through their data for the detection and diagnosis of faults. Most of the faults that commonly occur in WSN are considered: hardover, drift, spike, erratic, data-loss, stuck, and random fault. A trusted dataset published online by the researchers at the University of North Carolina composed of temperature and humidity sensor measurements of multi-hop scenario was acquired and the aforementioned faults were simulated in non-faulty (normal) data. Events from fault occurrences were generated to replicate realistic scenarios of WSN. To detect and diagnose the faults in timely manner, we adopt an ensemble learning-based lightweight technique called Extremely Randomized Trees or Extra-Trees. The proposed Extra-Trees-based detection scheme has the ability of robustness towards signal noise and strong reduction of bias and variance error. The performances of the proposed scheme were compared with those of the state-of-the-art machine learning algorithms such as support vector machine, random forest, neural network, and decision tree. Performance evaluation shows the efficiency of the proposed scheme in terms of accuracy, precision, and F1-score. In addition, the proposed scheme has low training time compared to state-of-the-art approaches.