scholarly journals A Triple-Filter NLOS Localization Algorithm Based on Fuzzy C-means for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (5) ◽  
pp. 1215 ◽  
Author(s):  
Long Cheng ◽  
Yifan Li ◽  
Yan Wang ◽  
Yangyang Bi ◽  
Liang Feng ◽  
...  
Keyword(s):  
Kalman Filter ◽  
Unscented Kalman Filter ◽  
Rapid Development ◽  
Residual Analysis ◽  
Wireless Sensor ◽  
Identification Algorithm ◽  
Localization Algorithm ◽  
Mobile Nodes ◽  
Localization Accuracy ◽  
Fuzzy C Means

With the rapid development of communication technology in recent years, Wireless Sensor Network (WSN) has become a promising research project. WSN is widely applied in a number of fields such as military, environmental monitoring, space exploration and so on. The non-line-of-sight (NLOS) localization is one of the most essential techniques for WSN. However, the NLOS propagation of WSN is largely influenced by many factors. Hence, a triple filters mixed Kalman Filter (KF) and Unscented Kalman Filter (UKF) voting algorithm based on Fuzzy-C-Means (FCM) and residual analysis (TF-FCM) has been proposed to cope with this problem. Firstly, an NLOS identification algorithm based on residual analysis is used to identify NLOS errors. Then, an NLOS correction algorithm based on voting and NLOS errors classification algorithm based on FCM are used to process the NLOS measurements. Hard NLOS measurements and soft NLOS measurements are classified by FCM classification. Secondly, KF and UKF are applied to filter two categories of NLOS measurements. Thirdly, maximum likelihood localization (ML) is employed to estimate the position of mobile nodes. The simulation result confirms that the accuracy and robustness of TF-FCM are better than IMM, UKF and KF. Finally, an experiment is conducted to test and verify our algorithm which obtains higher localization accuracy.

scholarly journals A Hierarchical Voting Based Mixed Filter Localization Method for Wireless Sensor Network in Mixed LOS/NLOS Environments

Sensors ◽  
2018 ◽  
Vol 18 (7) ◽  
pp. 2348 ◽  
Author(s):  
Yan Wang ◽  
Jinquan Hang ◽  
Long Cheng ◽  
Chen Li ◽  
Xin Song
Keyword(s):  
Kalman Filter ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Unscented Kalman Filter ◽  
Rapid Development ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Line Of Sight ◽  
Time Of Arrival ◽  
Localization Method

In recent years, the rapid development of microelectronics, wireless communications, and electro-mechanical systems has occurred. The wireless sensor network (WSN) has been widely used in many applications. The localization of a mobile node is one of the key technologies for WSN. Among the factors that would affect the accuracy of mobile localization, non-line of sight (NLOS) propagation caused by a complicated environment plays a vital role. In this paper, we present a hierarchical voting based mixed filter (HVMF) localization method for a mobile node in a mixed line of sight (LOS) and NLOS environment. We firstly propose a condition detection and distance correction algorithm based on hierarchical voting. Then, a mixed square root unscented Kalman filter (SRUKF) and a particle filter (PF) are used to filter the larger measurement error. Finally, the filtered results are subjected to convex optimization and the maximum likelihood estimation to estimate the position of the mobile node. The proposed method does not require prior information about the statistical properties of the NLOS errors and operates in a 2D scenario. It can be applied to time of arrival (TOA), time difference of arrival (TDOA), received signal (RSS), and other measurement methods. The simulation results show that the HVMF algorithm can efficiently reduce the effect of NLOS errors and can achieve higher localization accuracy than the Kalman filter and PF. The proposed algorithm is robust to the NLOS errors.

scholarly journals A Robust Indoor Mobile Localization Algorithm for Wireless Sensor Network in Mixed LOS/NLOS Environments

2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Ou Yong Kang ◽  
Cheng Long
Keyword(s):  
Kalman Filter ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Unscented Kalman Filter ◽  
Wireless Sensor ◽  
Selection Strategy ◽  
Time Of Arrival ◽  
Multiple Model ◽  
Localization Algorithm ◽  
Extend Kalman Filter

Wireless sensor network (WSN) is a self-organizing network which is composed of a large number of cheap microsensor nodes deployed in the monitoring area and formed by wireless communication. Since it has the characteristics of rapid deployment and strong resistance to destruction, the WSN positioning technology has a wide application prospect. In WSN positioning, the nonline of sight (NLOS) is a very common phenomenon affecting accuracy. In this paper, we propose a NLOS correction method algorithm base on the time of arrival (TOA) to solve the NLOS problem. We firstly propose a tendency amendment algorithm in order to correct the NLOS error in geometry. Secondly, this paper propose a particle selection strategy to select the standard deviation of the particle swarm as the basis of evolution and combine the genetic evolution algorithm, the particle filter algorithm, and the unscented Kalman filter (UKF) algorithm. At the same time, we apply orthogon theory to the UKF to make it have the ability to deal with the target trajectory mutation. Finally we use maximum likelihood localization (ML) to determine the position of the mobile node (MN). The simulation and experimental results show that the proposed algorithm can perform better than the extend Kalman filter (EKF), Kalman filter (KF), and robust interactive multiple model (RIMM).

scholarly journals A Hybrid Mobile Node Localization Algorithm Based on Adaptive MCB-PSO Approach in Wireless Sensor Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-17 ◽  
Author(s):  
Hua Wu ◽  
Ju Liu ◽  
Zheng Dong ◽  
Yang Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Mobile Node ◽  
Global Optimum ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Mobile Nodes ◽  
Node Localization ◽  
Localization Accuracy

In this paper, a hybrid adaptive MCB-PSO node localization algorithm is proposed for three-dimensional mobile wireless sensor networks (MWSNs), which considers the random mobility of both anchor and unknown nodes. An improved particle swarm optimization (PSO) approach is presented with Monte Carlo localization boxed (MCB) to locate mobile nodes. It solves the particle degeneracy problem that appeared in traditional MCB. In the proposed algorithm, a random waypoint model is incorporated to describe random movements of anchor and unknown nodes based on different time units. An adaptive anchor selection operator is designed to improve the performance of standard PSO for each particle based on time units and generations, to maintain the searching ability in the last few time units and particle generations. The objective function of standard PSO is then reformed to make it obtain a better rate of convergence and more accurate cost value for the global optimum position. Furthermore, the moving scope of each particle is constrained in a specified space to improve the searching efficiency as well as to save calculation time. Experiments are made in MATLAB software, and it is compared with DV-Hop, Centroid, MCL, and MCB. Three evaluation indexes are introduced, namely, normalized average localization error, average localization time, and localization rate. The simulation results show that the proposed algorithm works well in every situation with the highest localization accuracy, least time consumptions, and highest localization rates.

scholarly journals Computer Simulation Algorithm of Gymnastics Formation Change Path Based on Wireless Sensor

2021 ◽  
Author(s):  
Bingxin Chen ◽  
Lifei Kuang ◽  
Wei He
Keyword(s):  
Computer Simulation ◽  
Control Method ◽  
Rapid Development ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Target Point ◽  
Simulation Algorithm ◽  
Mobile Nodes ◽  
Loop Control ◽  
Beacon Node

Abstract Today, with the rapid development of information age, the communication of science and technology is getting closer to each other, and our country has begun to conduct in-depth research on WSN. This study mainly discusses the computer simulation algorithm of gymnastics formation transformation path based on wireless sensor. In this study, an improved leader follower method is designed. In the research of gymnastics formation transformation of mobile nodes in wireless sensor network environment, the traditional three types of nodes are divided into four categories according to different formation responsibilities, namely coordinator, beacon node, leader and follower. When it makes accurate positioning with the help of beacon node information, it will send the information in the form of broadcast, and then the coordinator will send the information to the host computer through the serial port for tracking display. In order to make the mobile nodes in the network keep the current gymnastics formation moving towards the target point after completing the gymnastics formation transformation, this paper uses the L - φ closed-loop control method to modify the gymnastics formation in real time. The method based on the received signal strength is used to locate the mobile node. Combined with the positioning engine in the core processor CC2431 of the mobile node, the efficient and low-energy wireless positioning can be realized. Multiple mobile nodes coordinate and control each other, and each node communicates with each other through wireless mode, and senses its own heading angle information through geomagnetic sensor, so as to judge and adjust the maintenance and transformation of the current gymnastics formation. In the process of formation transformation, the analysis shows that the maximum offset of follower2 relative to the ideal path is + 0.28M in the process of marching to the desired position in the triangle queue. This research effectively realizes the computer simulation of autonomous formation.

Sequence Localization Algorithm Based on 3D Voronoi Diagram in Wireless Sensor Network

2014 ◽  
Vol 644-650 ◽  
pp. 4422-4426 ◽  
Author(s):  
Xi Yang ◽  
Jun Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Voronoi Diagram ◽  
Wireless Sensor ◽  
Weighted Estimate ◽  
Localization Algorithm ◽  
Simulation Experiments ◽  
Localization Accuracy ◽  
3D Space ◽  
Unknown Node

For nodes’ self-localization in wireless sensor networks (WSN), a new localization algorithm called Sequence Localization algorithm based on 3D Voronoi diagram (SL3V) is proposed, which uses 3D Voronoi diagram to divide the localization space.It uses the polyhedron vertices as the virtual beacon nodes and constructs the rank sequence table of virtual beacon nodes. Then it computes Kendall coefficients of the ranks in the optimal rank sequence table and that of the unknown node. Finally, it realizes the weighted estimate of the unknown node by normalization processing Kendall coefficients. Simulation experiments prove that itcan obviously improve the localization accuracy compared with the traditional 2D sequence-based localization and can satisfy the need of localization for 3D space.

An Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 2 (2) ◽  
pp. 16-35 ◽  
Author(s):  
Shrawan Kumar ◽  
D. K. Lobiyal
Keyword(s):  
Wireless Sensor Networks ◽  
Linear Programming ◽  
Sensor Networks ◽  
Problem Formulation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Location Accuracy ◽  
Localization Accuracy ◽  
Error Terms

Obtaining precise location of sensor nodes at low energy consumption, less hardware requirement, and little computation is a challenging task. As one of the well-known range-free localization algorithm, DV-Hop can be simply implemented in wireless sensor networks, but it provides poor localization accuracy. Therefore, in this paper, the authors propose an enhanced DV-Hop localization algorithm that provides good localization accuracy without requiring additional hardware and communication messages in the network. The first two steps of proposed algorithm are similar to the respective steps of the DV-Hop algorithm. In the third step, they first separate error terms (correction factors) of the estimated distance between unknown node and anchor node. The authors then minimize these error terms by using linear programming to obtain better location accuracy. Furthermore, they enhance location accuracy of nodes by introducing weight matrix in the objective function of linear programming problem formulation. Simulation results show that the performance of our proposed algorithm is superior to DV-Hop algorithm and DV-Hop–based algorithms in all considered scenarios.

scholarly journals A Grey Model and Mixture Gaussian Residual Analysis-Based Position Estimator in an Indoor Environment

Sensors ◽  
2020 ◽  
Vol 20 (14) ◽  
pp. 3941
Author(s):  
Yan Wang ◽  
Wenjia Ren ◽  
Long Cheng ◽  
Jijun Zou
Keyword(s):  
Kalman Filter ◽  
Measurement Errors ◽  
Unscented Kalman Filter ◽  
Grey Model ◽  
Interacting Multiple Model ◽  
Multiple Model ◽  
Localization Accuracy ◽  
Gaussian Fitting ◽  
Degree Of Membership ◽  
Measured Distance

As the progress of electronics and information processing technology continues, indoor localization has become a research hotspot in wireless sensor networks (WSN). The adverse non-line of sight (NLOS) propagation usually causes large measurement errors in complex indoor environments. It could decrease the localization accuracy seriously. A traditional grey model considers the motion characteristics but does not take the NLOS propagation into account. A robust interacting multiple model (R-IMM) could effectively mitigate NLOS errors but the clipping point is hard to choose. In order to easily cope with NLOS errors, we present a novel filter framework: mixture Gaussian fitting-based grey Kalman filter structure (MGF-GKFS). Firstly, grey Kalman filter (GKF) is proposed to pre-process the measured distance, which can mitigate the process noise and alleviate NLOS errors. Secondly, we calculate the residual which is the difference between the filtered distance of GKF and the measured distance. Thirdly, a soft decision method based on mixture Gaussian fitting (MGF) is proposed to identify the propagation condition through residual value and give the degree of membership. Fourthly, weak NLOS noise is further processed by unscented Kalman filter (UKF). The filtered results of GKF and UKF are weighted using the degree of membership. Finally, a maximum likelihood (ML) algorithm is applied to get the coordinate of the target. MGF-GKFS is not supported by any of the priori knowledge. Full-scale simulations and an experiment are conducted to compare the localization accuracy and robustness with the state-of-the-art algorithms, including robust interacting multiple model (R-IMM), unscented Kalman filter (UKF) and interacting multiple model (IMM). The results show that MGF-GKFS could achieve significant improvement compared to R-IMM, UKF and IMM algorithms.

scholarly journals Enhancing the Sensor Node Localization Algorithm Based on Improved DV-Hop and DE Algorithms in Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (2) ◽  
pp. 343 ◽  
Author(s):  
Dezhi Han ◽  
Yunping Yu ◽  
Kuan-Ching Li ◽  
Rodrigo Fernandes de Mello
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Random Mutation ◽  
Localization Accuracy ◽  
De Algorithm ◽  
Distance Vector

The Distance Vector-Hop (DV-Hop) algorithm is the most well-known range-free localization algorithm based on the distance vector routing protocol in wireless sensor networks; however, it is widely known that its localization accuracy is limited. In this paper, DEIDV-Hop is proposed, an enhanced wireless sensor node localization algorithm based on the differential evolution (DE) and improved DV-Hop algorithms, which improves the problem of potential error about average distance per hop. Introduced into the random individuals of mutation operation that increase the diversity of the population, random mutation is infused to enhance the search stagnation and premature convergence of the DE algorithm. On the basis of the generated individual, the social learning part of the Particle Swarm (PSO) algorithm is embedded into the crossover operation that accelerates the convergence speed as well as improves the optimization result of the algorithm. The improved DE algorithm is applied to obtain the global optimal solution corresponding to the estimated location of the unknown node. Among the four different network environments, the simulation results show that the proposed algorithm has smaller localization errors and more excellent stability than previous ones. Still, it is promising for application scenarios with higher localization accuracy and stability requirements.

scholarly journals An improved DV-Hop localization with minimum connected dominating set for mobile nodes in wireless sensor networks

2018 ◽  
Vol 14 (1) ◽  
pp. 155014771875563 ◽  
Author(s):  
Gulshan Kumar ◽  
Mritunjay Kumar Rai ◽  
Rahul Saha ◽  
Hye-jin Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Localization Algorithm ◽  
Mobile Nodes ◽  
Minimum Connected Dominating Set ◽  
Anchor Nodes

Localization is one of the key concepts in wireless sensor networks. Different techniques and measures to calculate the location of unknown nodes were introduced in recent past. But the issue of nodes’ mobility requires more attention. The algorithms introduced earlier to support mobility lack the utilization of the anchor nodes’ privileges. Therefore, in this article, an improved DV-Hop localization algorithm is introduced that supports the mobility of anchor nodes as well as unknown nodes. Coordination of anchor nodes creates a minimum connected dominating set that works as a backbone in the proposed algorithm. The focus of the research paper is to locate unknown nodes with the help of anchor nodes by utilizing the network resources efficiently. The simulated results in network simulator-2 and the statistical analysis of the data provide a clear impression that our novel algorithm improves the error rate and the time consumption.

Sign in / Sign up

Export Citation Format

Share Document