scholarly journals Boundary-Improved Distance Vector-Hop Localization Method with Multipower Correction for Wireless Sensor Networks

2017 ◽  
pp. 675
Sensors ◽  
2019 ◽  
Vol 19 (17) ◽  
pp. 3638 ◽  
Author(s):  
Yan Wang ◽  
Huihui Jie ◽  
Long Cheng

As one of the most essential technologies, wireless sensor networks (WSNs) integrate sensor technology, embedded computing technology, and modern network and communication technology, which have become research hotspots in recent years. The localization technique, one of the key techniques for WSN research, determines the application prospects of WSNs to a great extent. The positioning errors of wireless sensor networks are mainly caused by the non-line of sight (NLOS) propagation, occurring in complicated channel environments such as the indoor conditions. Traditional techniques such as the extended Kalman filter (EKF) perform unsatisfactorily in the case of NLOS. In contrast, the robust extended Kalman filter (REKF) acquires accurate position estimates by applying the robust techniques to the EKF in NLOS environments while losing efficiency in LOS. Therefore it is very hard to achieve high performance with a single filter in both LOS and NLOS environments. In this paper, a localization method using a robust extended Kalman filter and track-quality-based (REKF-TQ) fusion algorithm is proposed to mitigate the effect of NLOS errors. Firstly, the EKF and REKF are used in parallel to obtain the location estimates of mobile nodes. After that, we regard the position estimates as observation vectors, which can be implemented to calculate the residuals in the Kalman filter (KF) process. Then two KFs with a new observation vector and equation are used to further filter the estimates, respectively. At last, the acquired position estimates are combined by the fusion algorithm based on the track quality to get the final position vector of mobile node, which will serve as the state vector of both KFs at the next time step. Simulation results illustrate that the TQ-REKF algorithm yields better positioning accuracy than the EKF and REKF in the NLOS environment. Moreover, the proposed algorithm achieves higher accuracy than interacting multiple model algorithm (IMM) with EKF and REKF.


Sensors ◽  
2020 ◽  
Vol 20 (2) ◽  
pp. 343 ◽  
Author(s):  
Dezhi Han ◽  
Yunping Yu ◽  
Kuan-Ching Li ◽  
Rodrigo Fernandes de Mello

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.


2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Sana Messous ◽  
Hend Liouane

One of the main issues of wireless sensor networks is localization. Besides, it is important to track and analyze the sensed information. The technique of localization can calculate node position with the help of a set of designed nodes, denoted as anchors. The set density of these anchors may be incremented or decremented because of many reasons such as maintenance, lifetime, and breakdown. The well-known Distance Vector Hop (DV-Hop) algorithm is a suitable solution for localizing nodes having few neighbor anchors. However, existing DV-Hop-based localization methods have not considered the problem of anchor breakdown which may happen during the localization process. In order to avoid this issue, an Online Sequential DV-Hop algorithm is proposed in this paper to sequentially calculate positions of nodes and improve accuracy of node localization for multihop wireless sensor networks. The algorithm deals with the variation of the number of available anchors in the network. We note that DV-Hop algorithm is used in this article to process localization of nodes by a new optimized method for the estimation of the average distance of hops between nodes. Our proposed localization method is based on an online sequential computation. Compared with the original DV-Hop and other localization methods from the literature, simulation results prove that the proposed algorithm greatly minimizes the average of localization error of sensor nodes.


Sign in / Sign up

Export Citation Format

Share Document