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

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1912 ◽  
Author(s):  
Pengfei Xu ◽  
Tianhao Cui ◽  
Lei Chen

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 ℓ 2 , 1 -norm Regularized Matrix Decomposition (RRMD) model, where complex noise is fitted by Mixture of Gaussian (MoG) distribution, and node anomaly is sifted by ℓ 2 , 1 -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.

2017 ◽  
Vol 13 (05) ◽  
pp. 4 ◽  
Author(s):  
Peng An

In the wireless sensor network, there is a consistent one-to-one match between the information collected by the node and the location of the node. Therefore, it attempts to determine the location of unknown nodes for wireless sensor networks. At present, there are many kinds of node localization methods. Because of the distance error, hardware level, application environment and application costs and other factors, the positioning accuracy of various node positioning methods is not in complete accord. The objective function is established and algorithm simulation experiments are carried out to make a mobile ronot node localization.  The experimnettal results showed that  the proposed algorithm can achieve higher localization precision in fewer nodes. In addition, the localization algorithm was compared with the classical localization algorithm. In conclusion, it is verified that the localization algorithm proposed in this paper has higher localization accuracy than the traditional classical localization algorithm when the number of nodes is larger than a certain number


2012 ◽  
Vol 490-495 ◽  
pp. 1207-1211
Author(s):  
Nan Zhang ◽  
Jian Hua Zhang ◽  
Jian Ying Chen ◽  
Xiao Mei Qu

Node localization technology is the premise and foundation of all applications in wireless sensor network. An improved DV-Hop algorithm was proposed aimed at the low-power requirement of wireless sensor networks. The distances between nodes and anchor nodes were used to calculate the node location in DV-Hop algorithm, and the immune algorithm was used to optimize the estimated location in the third stage of DV-Hop algorithm. The improved algorithm does not require additional hardware devices, and has smaller additional amount of communication and computation.


Author(s):  
Wenli Liu ◽  
Cuiping Shi ◽  
Hengjun Zhu ◽  
Hongbo Yu

Aiming at the large error and low accuracy of wireless sensor node location, this paper proposes a node location method based on the fusion of Particle Swarm Optimization and Monkey Algorithm (PSO-MA). Firstly, this article describes the node location model based on DV-HOP algorithm; secondly, this article uses PSO in node location, uses place Laplace distribution for population initialization, improves population diversity, and optimizes particle weights to avoid algorithm falling into local optimality. In this paper, dynamic guidance factors are used to update individual positions to improve individual optimization capabilities, and Monkey Algorithm is used to select individuals to improve the quality of optimal solutions. In the simulation experiment, the algorithm PSO and MA of this paper are compared to achieve better positioning results in the reference node ratio, node density and communication radius indicators.


2014 ◽  
Vol 998-999 ◽  
pp. 1390-1393
Author(s):  
Yong He

This paper proposes a node localization algorithm based on super chondritic calculation, super chondritic calculation scanning of a training set is able to complete the training process, the training has characteristics of fast, the problem of node localization for wireless sensor networks. Firstly, according to the related parameter information for the location of wireless sensor nodes, a multi input, multi output problem of training set, and then through the methods of grid division, location area, the original training set into the classification of multi input, single output training set, the super chondritic algorithm by scanning training, in order to get the relevant parameters, and the estimation of the unknown node location. Simulation results show that the proposed algorithm has better positioning accuracy.


2011 ◽  
Vol 8 (4) ◽  
pp. 953-972 ◽  
Author(s):  
Qingji Qian ◽  
Xuanjing Shen ◽  
Haipeng Chen

Sensor node localization is the basis for the entire wireless sensor networks. Because of restricted energy of the sensor nodes, the location error, costs of communication and computation should be considered in localization algorithms. DV-Hop localization algorithm is a typical positioning algorithm that has nothing to do with distance. In the isotropic dense network, DV-Hop can achieve position more precisely, but in the random distribution network, the node location error is great. This paper summed up the main causes of error based on the analysis on the process of the DV-Hop algorithm, aimed at the impact to the location error which is brought by the anchor nodes of different position and different quantity, a novel localization algorithm called NDVHop_Bon (New DV-Hop based on optimal nodes) was put forward based on optimal nodes, and it was simulated on Matlab. The results show that the new proposed location algorithm has a higher accuracy on localization with a smaller communication radius in the circumstances, and it has a wider range of applications.


Sensors ◽  
2019 ◽  
Vol 19 (14) ◽  
pp. 3242 ◽  
Author(s):  
Jin Yang ◽  
Yongming Cai ◽  
Deyu Tang ◽  
Zhen Liu

Node localization, which is formulated as an unconstrained NP-hard optimization problem, is considered as one of the most significant issues of wireless sensor networks (WSNs). Recently, many swarm intelligent algorithms (SIAs) were applied to solve this problem. This study aimed to determine node location with high precision by SIA and presented a new localization algorithm named LMQPDV-hop. In LMQPDV-hop, an improved DV-Hop was employed as an underground mechanism to gather the estimation distance, in which the average hop distance was modified by a defined weight to reduce the distance errors among nodes. Furthermore, an efficient quantum-behaved particle swarm optimization algorithm (QPSO), named LMQPSO, was developed to find the best coordinates of unknown nodes. In LMQPSO, the memetic algorithm (MA) and Lévy flight were introduced into QPSO to enhance the global searching ability and a new fast local search rule was designed to speed up the convergence. Extensive simulations were conducted on different WSN deployment scenarios to evaluate the performance of the new algorithm and the results show that the new algorithm can effectively improve position precision.


Sign in / Sign up

Export Citation Format

Share Document