Localization Algorithm For Wireless Sensor Networks Research Articles

Secure Wireless Sensor Networks: A Weighted K-NN and RNN-based Approach for Attack Detection and Localization

In the realm of wireless sensor networks (WSNs), precise localization of sensor nodes and attack detection has emerged as a significant challenge. Accurate localization of sensor nodes and detection of attacks is crucial for enhancing the network lifetime and preventing the data from unauthorized access. However, prior research has encountered various obstacles, such as high localization error, more time consumption, and poor detection performance. To overcome these difficulties, this research proposes a novel Recurrent Crossover-based Dynamic Differential (RC-DD) algorithm for effective localization and attack detection in WSN. The proposed model utilizes a weighted K-Nearest Neighbor (KNN) with Mahalanobis distance for accurately localizing the position of the sensor nodes within the network. Moreover, the Recurrent Neural Network (RNN) is employed for effectively detect multiple attacks, and Dynamic Differential Annealed Optimization (DDAO) with crossover strategy is implemented for fine-tuning the RNN’s hyperparameter, thereby enhancing the attack detection accuracy. The experimental outcome shows that the proposed RC-DD framework effectively localizes the sensor nodes and detects the attacks with a higher accuracy of 98.9% compared to existing methodologies. Additionally, the proposed framework minimizes localization error and energy consumption, underscoring its potential to enhance the security and lifetime of the network.

Distance correction range-free localization algorithm for WSNs

Accurate location information is essential for the effective deployment of Wireless Sensor Networks (WSNs) applications. Recently, researchers have developed numerous localization algorithms, with multi-hop methods being particularly attractive due to their cost-effectiveness and robustness, but their accuracy is still unsatisfactory. For better localization accuracy, this paper presented a distance correction range-free localization algorithm (DCRA). Firstly, the proposed algorithm estimates the distance between neighboring nodes based on neighbor connectivity to improve the accuracy of single-hop distance estimation. Secondly, during the multi-hop distance estimation phase, path similarity metrics are employed to ascertain the optimal path correction coefficients, thereby minimizing multi-hop distance estimation errors. Finally, based on the estimated distances, the node localization is converted into an optimization problem, which is then solved using an enhanced particle swarm algorithm to obtain the node coordinates. Simulation results show that the distance estimation accuracy of the DCRA algorithm in different node density scenarios is improved by more than 31 % and 12 % compared to the DV-Hop and DV-RND algorithms, respectively; and in terms of localization accuracy the DCRA algorithm is improved by more than 58 % and 35 % compared to the DV-Hop and DV-RND algorithms, respectively.

A Quantum Annealing Bat Algorithm for Node Localization in Wireless Sensor Networks.

Node localization in two-dimensional (2D) and three-dimensional (3D) space for wireless sensor networks (WSNs) remains a hot research topic. To improve the localization accuracy and applicability, we first propose a quantum annealing bat algorithm (QABA) for node localization in WSNs. QABA incorporates quantum evolution and annealing strategy into the framework of the bat algorithm to improve local and global search capabilities, achieve search balance with the aid of tournament and natural selection, and finally converge to the best optimized value. Additionally, we use trilateral localization and geometric feature principles to design 2D (QABA-2D) and 3D (QABA-3D) node localization algorithms optimized with QABA, respectively. Simulation results show that, compared with other heuristic algorithms, the convergence speed and solution accuracy of QABA are greatly improved, with the highest average error of QABA-2D reduced by 90.35% and the lowest by 17.22%, and the highest average error of QABA-3D reduced by 75.26% and the lowest by 7.79%.

Mobile Anchor and Kalman Filter Boosted Bounding Box for Localization in Wireless Sensor Networks

Event detection is usually the primary purpose of wireless sensor networks (WSNs). Therefore, it is crucial to determine where and when an event occurs in order to map the event to its spatio-temporal domain. In WSN localization, a few anchor nodes are those aware of their locations via the Global Positioning System (GPS), which is energy-consuming. Non-anchor nodes self-localize by gathering information from anchor nodes to estimate their positions using a localization technique. Traditional algorithms use at least three static anchors for the localization process. Recently, researchers opted to replace multiple static anchors by a single mobile anchor during the localization process. This paper proposes a Kalman filter based on bounding box localization algorithm (KF-BBLA) in WSNs with mobile anchor node. We present a new mobile anchor localization strategy to minimize energy, hardware costs, and computation complexity, while improving accuracy and cost-effectiveness. Network connectivity measurement and the bounding box localization method are used in order to identify the bounded possible localization zone. The Kalman filter is then used to minimize the uncertainty produced by the connectivity process. We aim also to minimize the localization inaccuracies generated by the bounding box algorithm. Simulation results show that our proposed approach significantly reduces the localization error compared to other localization algorithms chosen from the recent literature by up to 20%. We use the cumulative distribution function (CDF) as an indicator to assess the accuracy of our proposed algorithm.

Improved Wireless Sensor Network Localization Algorithm Based on Selective Opposition Class Topper Optimization (SOCTO)

One of the most important challenges in wireless sensor networks is the issue of localization. Furthermore, it is critical to monitor and evaluate the data gathered. With the aid of a collection of constructed nodes known as beacons, the localization technique can measure node location. For a variety of factors, such as upkeep, lifespan, and breakdown, the fixed density of these beacons may be increased or decreased. Because of its robustness, flexibility, and economic viability, a well-known technique for locating wireless sensor network nodes is the distance vector-hop (DV-Hop) algorithm. As a result, researchers continue to look for ways to develop it. Based on a proposed selective opposition class topper optimization (SOCTO), an enhanced DV-Hop localization algorithm is developed. It also focuses on an optimised formulation to compute the average hop-size with weight of beacon nodes in order to reduce the localization error within the estimated distance between the beacon and the dumb node, due to improved localization accuracy. The range-free localization algorithm in uniform multi-hop wireless sensor networks is the subject of a recent study. The results show that our proposed method outperforms the DV-Hop technique and related techniques in terms of average localization error (\(0.05\%\)) versus random beacon node deployment, average localization error (\(0.04\%\)) versus circular beacon node deployment, and average localization error (\(0.08\%\)) versus spiral beacon node deployment.

Cuboid-based Wireless Sensor Network Localization Algorithm

Localization is one of the key technologies in wireless sensor networks (WSNs), since it provides fundamental support for many location-aware protocols and applications. Constraints on cost and power consumption make it infeasible to equip each sensor node in the network with a global position system (GPS) unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use anchor nodes, which are equipped with GPS units among unknown nodes and broadcast their current locations to help nearby unknown nodes with localization. In this paper we can proposed a novel algorithm of cuboid localization with the help of central point precision method. Simulation shows that the results are far better then existing cuboid methods and gain accuracy of up to 83% with a localization error of 1.6m and standard deviation of 2.7.

Addressing the Directionality Challenge through RSSI-Based Multilateration Technique, to Localize Nodes in Underwater WSNs by Using Magneto-Inductive Communication

The deployment and efficient use of wireless sensor networks (WSNs) in underwater and underground environments persists to be a difficult task. In addition, the localization of a sensor Rx node in WSNs is an important aspect for the successful communication with the aforementioned environments. To overcome the limitations of electromagnetic, acoustic, and optical communication in underwater and underground wireless sensor networks (UWSNs), magneto-inductive (MI) communication technology emerged as a promising alternative for usage in UWSNs with a wide range of applications. To make the magneto-inductive underwater wireless sensor networks (MI-UWSNs) more efficient, recently, various research studies focused on the optimization of the physical layer, MAC layer, and routing layer, but none of them has taken into account the effect of directionality. Despite the directionality issue posed by the physical nature of a magnetic field, the unique qualities of MI communication open up a gateway for several applications. The directionality issue of MI sensors is a critical challenge that must be taken into account while developing any WSN protocol or localization algorithm. This paper highlights and discusses the severity and impact of the directionality issue in designing a localization algorithm for magneto-inductive wireless sensor networks (MI-WSNs). A received signal strength indicator (RSSI)-based multilateration localization algorithm is presented in this paper, where a minimum of 2 and maximum of 10 anchor Tx nodes are used to estimate the position of the sensor Rx nodes, which are deployed randomly in a 15 m × 15 m simulation environment. This RSSI-based multilateration technique is the most suitable option that can be used to quantify the impact of directionality on the localization of a sensor Rx node.

An Improved Sparrow Search Algorithm for Node Localization in WSN

Wireless sensor networks (WSN) comprise a set of numerous cheap sensors placed in the target region. A primary function of the WSN is to avail the location details of the event occurrences or the node. A major challenge in WSN is node localization which plays an important role in data gathering applications. Since GPS is expensive and inaccurate in indoor regions, effective node localization techniques are needed. The major intention of localization is for determining the place of node in short period with minimum computation. To achieve this, bio-inspired algorithms are used and node localization is assumed as an optimization problem in a multidimensional space. This paper introduces a new Sparrow Search Algorithm with Doppler Effect (SSA-DE) for Node Localization in Wireless Networks. The SSA is generally stimulated by the group wisdom, foraging, and anti-predation behaviors of sparrows. Besides, the Doppler Effect is incorporated into the SSA to further improve the node localization performance. In addition, the SSA-DE model defines the position of node in an iterative manner using Euclidian distance as the fitness function. The presented SSA-DE model is implanted in MATLAB R2014. An extensive set of experimentation is carried out and the results are examined under a varying number of anchor nodes and ranging error. The attained experimental outcome ensured the superior efficiency of the SSA-DE technique over the existing techniques.

A Node Localization Algorithm for Wireless Sensor Networks Based on Virtual Partition and Distance Correction

The coordinates of nodes are very important in the application of wireless sensor networks (WSN). The range-free localization algorithm is the best method to obtain the coordinates of sensor nodes at present. Range-free localization algorithm can be divided into two stages: distance estimation and coordinate calculation. For reduce the error in the distance estimation stage, a node localization algorithm for WSN based on virtual partition and distance correction (VP-DC) is proposed in this paper. In the distance estimation stage, firstly, the distance of each hop on the shortest communication path between the unknown node and the beacon node is calculated with the employment of virtual partition algorithm; then, the length of the shortest communication path is obtained by summing the distance of each hop; finally, the unknown distance between nodes is obtained according to the optimal path search algorithm and the distance correction formula. This paper innovative proposes the virtual partition algorithm and the optimal path search algorithm, which effectively avoids the distance estimation error caused by hop number and hop distance, and improves the localization accuracy of unknown nodes.

Three-Dimensional Localization Algorithm Based on Improved A and DV-Hop Algorithms in Wireless Sensor Network.

In the traditional wireless sensor networks (WSNs) localization algorithm based on the Internet of Things (IoT), the distance vector hop (DV-Hop) localization algorithm has the disadvantages of large deviation and low accuracy in three-dimensional (3D) space. Based on the 3DDV-Hop algorithm and combined with the idea of A* algorithm, this paper proposes a wireless sensor network node location algorithm (MA*-3DDV-Hop) that integrates the improved A* algorithm and the 3DDV-Hop algorithm. In MA*-3DDV-Hop, firstly, the hop-count value of nodes is optimized and the error of average distance per hop is corrected. Then, the multi-objective optimization non dominated sorting genetic algorithm (NSGA-II) is adopted to optimize the coordinates locally. After selection, crossover, mutation, the Pareto optimal solution is obtained, which overcomes the problems of premature convergence and poor convergence of existing algorithms. Moreover, it reduces the error of coordinate calculation and raises the localization accuracy of wireless sensor network nodes. For three different multi-peak random scenes, simulation results show that MA*-3DDV-Hop algorithm has better robustness and higher localization accuracy than the 3DDV-Hop, PSO-3DDV-Hop, GA-3DDV-Hop, and N2-3DDV-Hop.

Research on Node localization Algorithm in WSN Based on TDOA

Many applications of wireless sensor networks (WSN) require nodes to know their location information. Monitoring data without node location information is meaningless in many situations. Since the node positioning efficiency of WSN directly affects the performance of the network, designing an efficient positioning algorithm is the focus of WSN research. Based on the principle of TDOA positioning in WSN, it studies two main positioning algorithms: Chan and Taylor algorithm. Meanwhile the least square (LS) method is used to provide the initial position for Taylor algorithm and the first calculation result for Chan algorithm. Simulation results under different conditions show that the Chan algorithm has a good positioning accuracy and less computation than that of Taylor algorithm in the line of sight (LOS) environment. However, under the actual channel, due to the influence of No Line of Sight (NLOS), the positioning accuracy of Taylor algorithm is better than that of Chan algorithm, but its computation is large.

A Survey on DV-Hop localization Techniques in Three- Dimensional Wireless Sensor Networks

Location information is prerequisite for wireless sensor networks (WSNs) monitoring and control applications, since there is no meaning without position information for collected data. Distance vector hop (DV-Hop) localization algorithm as the typical range-free algorithm that has been widely applied in various applications. Nowadays, the research on range-free localization for WSNs is mostly based on two-dimensional (2D) space. Hence, there are few surveys concentrated on range-free localization in three-dimensional (3D) WSNs. This motivated us to present an extensive overview of enhanced DV-Hop localization algorithms in 3D WSNs. This paper focused on critical challenge between 2D and 3D in localization model, representative range-free 3D localization technique surveys. Moreover, a comprehensive taxonomy of most essential enhanced methods applied in 3D DV-Hop is illustrated. A considerable comparison in term of localization error, computational complexity and node type is given. Future research directions dealing with localization under 3D DV-Hop is also discussed.

A Two-Stage Wireless Sensor Grey Wolf Optimization Node Location Algorithm Based on K-Value Collinearity

In the practical application of WSN (wireless sensor network), location information of the sensor nodes has become one of the essential information pieces in the whole network. At present, some localization algorithms use intelligent optimization algorithm to optimize the node group directly. Although the overall localization error is reduced, the location deviation of individual unknown nodes will be larger, and the large number of iterations will cause a large energy consumption of nodes. Aiming at the above problems, this paper comes up with a two-stage WSN localization algorithm based on the degree of K-value collinearity (DC-K) and improved grey wolf optimization. The first stage is aiming at the defects of the existing collinearity algorithm, putting forward the concept of DC-K, according to the K-value to carry out the initial location in the first stage. The second stage is using the improved grey wolf optimization algorithm to optimize the location results which were obtained in the first stage, so as to get more accurate location results. The experimental results display that this localization algorithm with a better localization accuracy has high robustness and has fewer iterations in the optimization process, which greatly reduces the energy consumption of nodes.

Lightweight localisation approach for WSNs: performance analysis and validation

Wireless sensor networks (WSNs) have become very popular in recent years due to their wide applications’ spectrum. One of the main issues arising while conceiving with WSNs functionality is the opportunity of developing a proper localisation algorithm that has to be tailored basing on hw/sw nodes limitations. This study proposes a localisation algorithm for WSNs based on received signal strength measurements whose results, although comparable with existing localisation algorithms, proves here to be of practical implementation on devices with very low computational capabilities as well as efficient in real-time usages. Extensive simulations and indoor/outdoor experimental measurements have been performed to verify the effectiveness of the proposed algorithm, taking also into account implementation issues on commercial sensor nodes.

Location of three-dimensional movement for a human using a wearable multi-node instrument implemented by wireless body area networks

A wireless human body local area network is a wireless network composed of lightweight, wearable or implantable sensor nodes that sense various physiological parameters of the human body. This paper introduces the key technologies and characteristics of wireless sensor networks and the research status of node localization, analyzes the wireless sensor network localization algorithms and their performance evaluation indicators, and conducts in-depth research on wearable 3D node localization algorithms. The 3D positioning algorithm uses static beacon nodes to achieve the 3D positioning of public nodes. The positioning accuracy and positioning rate depend on the number of beacon nodes, and the number of beacon nodes increases, which increases network costs and energy consumption. Aiming at the spatiotemporal correlation between motion data collected by multiple sensors in a wireless human local area network, an RSSI-based multi-node 3D motion monitoring auxiliary algorithm is used, including the planning of wearable device motion trajectories. Throughout the positioning process, the workflow belongs to the public node and involves the format of the relevant information packet. The 3D wearable multi-node positioning algorithm based on RSSI is a distance-dependent distributed positioning algorithm. The public node uses the RSSI ranging method to obtain the distance during the two-stage positioning process, and then uses the three-dimensional multilateral positioning method to perform its own calculation.

A Propagation Condition Identification and Non-Line of Sight Error Mitigation Algorithm in Wireless Sensor Network

Node localization is one of key technologies in wireless sensor networks (WSN). In practice, the occlusion of obstacles often leads to large non-line-of-sight (NLOS) error. Therefore, the misidentification of LOS (line-of-sight)/NLOS conditions can seriously reduce the accuracy of localization algorithms in WSN. In this paper, we propose a novel localization algorithm based on hypothesis testing method, which combines the NLOS condition identification algorithm and the extended Kalman filter method to mitigate the NLOS error. Moreover, we introduce the false alarm rate fa to fuse the estimated values in the LOS/NLOS condition to obtain more accurate results. The simulations demonstrate that the proposed algorithm can effectively reduce the influence of NLOS error and improve the localization accuracy.

Experimental Evaluation of an RSSI-Based Localization Algorithm on IoT End-Devices

In recent years, wireless sensor networks (WSNs) have experienced a significant growth as a fundamental part of the Internet of Things (IoT). WSNs nodes constitute part of the end-devices present in the IoT, and in many cases location data of these devices is expected by IoT applications. For this reason, many localization algorithms for WSNs have been developed in the last years, although in most cases the results provided are obtained from simulations that do not consider the resource constraints of the end-devices. Therefore, in this work we present an experimental evaluation of a received signal strength indicator (RSSI)-based localization algorithm implemented on IoT end-devices, comparing its results with those obtained from simulations. We have implemented the fuzzy ring-overlapping range-free (FRORF) algorithm with some modifications to make its operation feasible on resource-constrained devices. Multiple tests have been carried out to obtain the localization accuracy data in three different scenarios, showing the difference between simulation and real results. While the overall behaviour is similar in simulations and in real tests, important differences can be observed attending to quantitative accuracy results. In addition, the execution time of the algorithm running in the nodes has been evaluated. It ranges from less than 10 ms to more than 300 ms depending on the fuzzification level, which demonstrates the importance of evaluating localization algorithms in real nodes to prevent the introduction of large overheads that may not be affordable by resource-constrained nodes.

H–V scan and diagonal trajectory: accurate and low power localization algorithms in WSNs

Obtaining the accurate location of the sensor nodes, which is known as the localization algorithm, is considered a significant issue in various applications of wireless sensor networks (WSNs). The present study introduced two anchor-based localization algorithms, namely, H–V scan and diagonal localization. These two algorithms are based on the received signal strength indicator (RSSI) and connectivity information, respectively. In addition, the diagonal algorithm relies on a diagonal trajectory in which the accuracy is improved while the consumed energy and localization time are decreased. Further, the H–V scan method benefits from collinearity and thus the location of the nodes is determined by the collinear position packets. Therefore, RWP, circle, LMAT, Z-curve, and H-curve methods, along with the proposed methods by Inet package of Omnetpp simulator were implemented for a fair comparison. The results indicated that in diagonal method accuracy improves about 1.2 times and consumed energy and localization time decrease about 65% compare to the best results of all the related studies. Furthermore, the results confirmed that the H–V scan which uses from collinearity concept, increases the accuracy about eight times.

A Node Localization Algorithm in Wireless Sensor Network

In order to solve the problems such as complex topology computation and low positioning accuracy induced by the random error factors in the localization process of Wireless Sensor Network(WSN), a new node localization algorithm for WSN is proposed. Firstly, the preliminary position estimation of positioned network node is finished based on the linear parameter evaluation mechanism and evaluates the received anchor node information to calculate the linear parameter value for searching the best anchor triangle, then the precise positioning of the node is done by using the weighted evaluation method and triangle positioning parameters of different anchor nodes to multiple weighted average for obtaining the accurate location information of nodes. Simulation results show that this algorithm has higher localization accuracy and lower error compared with DV-hop algorithm and DV-distance algorithm.

ANLoC: An Anomaly-Aware Node Localization Algorithm for WSNs in Complex Environments.

Accurate and sufficient node location information is crucial for Wireless Sensor Networks (WSNs) applications. However, the existing range-based localization methods often suffer from incomplete and detorted range measurements. To address this issue, some methods based on low-rank matrix recovery have been proposed, which usually assume noises follow single Gaussian distribution or/and single Laplacian distribution, and thus cannot handle the case with wider noise distributions beyond Gaussian and Laplacian ones. In this paper, a novel Anomaly-aware Node Localization (ANLoC) method is proposed to simultaneously impute missing range measurements and detect node anomaly in complex environments. Specifically, by utilizing inherent low-rank property of Euclidean Distance Matrix (EDM), we formulate range measurements imputation problem as a Robust -norm Regularized Matrix Decomposition (RRMD) model, where complex noise is fitted by Mixture of Gaussian (MoG) distribution, and node anomaly is sifted by -norm regularization. Meanwhile, an efficient optimization algorithm is designed to solve proposed RRMD model based on Expectation Maximization (EM) method. Furthermore, with the imputed EDM, all unknown nodes can be easily positioned by using Multi-Dimensional Scaling (MDS) method. Finally, some experiments are designed to evaluate performance of the proposed method, and experimental results demonstrate that our method outperforms three state-of-the-art node localization methods.