scholarly journals Incremental Localization Algorithm Based on Regularized Iteratively Reweighted Least Square

2016 ◽  
Vol 41 (3) ◽  
pp. 183-196 ◽  
Author(s):  
Xiaoyong Yan ◽  
Zhong Yang ◽  
Yu Liu ◽  
Xiaoduo Xu ◽  
Huijun Li
Keyword(s):  
High Stability ◽  
Simulation Experiment ◽  
High Accuracy ◽  
Least Square ◽  
Localization Algorithm ◽  
Localization Method ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Regularized Method ◽  
Collinearity Problem

AbstractIncremental localization algorithm is a distributed localization method with excellent characteristics for wireless network. However, its estimated result is generally influenced by the heteroscedasticity arising from cumulative errors and the collineation among anchor nodes. We have proposed a novel incremental localization algorithm with consideration to cumulative errors and collinearity among anchors. Using iteratively reweighted and regularized method, the algorithm reduces the influences of errors accumulation and avoids collinearity problem between anchors. Simulation experiment results show that compared with the previous incremental localization algorithms, the proposed algorithm obtains a localization solution which not only has high accuracy but also high stability. Therefore, the proposed algorithm is suitable for different deployment environments and has high adaptability.

Incremental Multi-Hop Localization Algorithm Based on Regularized Weighted Least Squares

2019 ◽  
Vol 33 (09) ◽  
pp. 1959032 ◽  
Author(s):  
Ru-Lin Dou ◽  
Bo Hu ◽  
Wei-Juan Shi
Keyword(s):  
Least Squares ◽  
High Efficiency ◽  
Least Squares Method ◽  
Weighted Least Squares ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Weighted Least Squares Method ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Regularized Method

Incremental multi-hop localization algorithm applies to networks with broad range and low density of anchor nodes. However, during the localization process, it tends to be affected by accumulative errors and collinear problem between anchor nodes. We have proposed an incremental multi-hop localization algorithm based on regularized weighted least squares method, and the algorithm uses weighted least squares method to reduce the influence of accumulative errors and uses regularized method to weaken the collinear problem between anchor nodes. The results of both real experiment and simulative experiment show that compared to previous incremental multi-hop localization algorithms, the algorithm proposed in this paper can not only well solve the accumulated errors problem and obtain high localization accuracy, but it has also considered the influence of collinear problem on localization computation during the localization process. We evaluate our method based on various network scenes, and analyze its performance. We also compare our method with several existing methods, and demonstrate the high efficiency of our proposed method.

scholarly journals MNCE: Multi-Hop Node Localization Algorithm for Wireless Sensor Network Based on Error Correction

Information ◽  
2020 ◽  
Vol 11 (5) ◽  
pp. 269
Author(s):  
Yinghui Meng ◽  
Yuewen Chen ◽  
Qiuwen Zhang ◽  
Weiwei Zhang
Keyword(s):  
Error Correction ◽  
Large Error ◽  
Least Square ◽  
Localization Algorithm ◽  
Target Node ◽  
Node Localization ◽  
Simulation Experiments ◽  
Connectivity Information ◽  
Localization Algorithms ◽  
Anchor Nodes

Considering the problems of large error and high localization costs of current range-free localization algorithms, a MNCE algorithm based on error correction is proposed in this study. This algorithm decomposes the multi-hop distance between nodes into several small hops. The distance of each small hop is estimated by using the connectivity information of adjacent nodes; small hops are accumulated to obtain the initial estimated distance. Then, the error-correction rate based on the error-correction concept is proposed to correct the initial estimated distance. Finally, the location of the target node is resolved by total least square methods, according to the information on the anchor nodes and estimated distances. Simulation experiments show that the MNCE algorithm is superior to the similar types of localization algorithms.

scholarly journals NLOS Identification and Positioning Algorithm Based on Localization Residual in Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2991 ◽  
Author(s):  
Jingyu Hua ◽  
Yejia Yin ◽  
Weidang Lu ◽  
Yu Zhang ◽  
Feng Li
Keyword(s):  
Hypothesis Test ◽  
Intermediate Position ◽  
Wireless Sensor ◽  
Line Of Sight ◽  
Localization Algorithm ◽  
Target Node ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Positioning Algorithm ◽  
Non Line Of Sight

The problem of target localization in WSN (wireless sensor network) has received much attention in recent years. However, the performance of traditional localization algorithms will drastically degrade in the non-line of sight (NLOS) environment. Moreover, variable methods have been presented to address this issue, such as the optimization-based method and the NLOS modeling method. The former produces a higher complexity and the latter is sensitive to the propagating environment. Therefore, this paper puts forward a simple NLOS identification and localization algorithm based on the residual analysis, where at least two line-of-sight (LOS) propagating anchor nodes (AN) are required. First, all ANs are grouped into several subgroups, and each subgroup can get intermediate position estimates of target node through traditional localization algorithms. Then, the AN with an NLOS propagation, namely NLOS-AN, can be identified by the threshold based hypothesis test, where the test variable, i.e., the localization residual, is computed according to the intermediate position estimations. Finally, the position of target node can be estimated by only using ANs under line of sight (LOS) propagations. Simulation results show that the proposed algorithm can successfully identify the NLOS-AN, by which the following localization produces high accuracy so long as there are no less than two LOS-ANs.

The Circle-End-Face Centering Device Based on Image Processing

2014 ◽  
Vol 926-930 ◽  
pp. 3447-3450
Author(s):  
Yong Bo Li ◽  
Yun Zhao Xu ◽  
Jia He
Keyword(s):  
Image Processing ◽  
Digital Image Processing ◽  
High Stability ◽  
Least Square Method ◽  
High Accuracy ◽  
Concentric Circle ◽  
Least Square ◽  
Programmable Logic ◽  
Edge Extraction ◽  
Stability And Accuracy

The circle-end-face centering device which is in the base of image processing accomplishes the center of the cylinders end face by digital image processing. Through edge extraction and doing the matching in the calculation of the least square method, the coordinate of the central of the circle can be calculated. At last, the drill will be moved to the central of the circle and do the punching by the actuator. This equipment is in the high accuracy and speed compared with the traditional way and the concentric circle laser of marking with the center. Meanwhile, the actuator consists of the programmable logic controller, touch panel and servo drivers which is in the high stability and accuracy. Certainly it is easy to be controlled by the method.

A Collaborative Multilateral Localization Algorithm for Wireless Sensor Networks

2013 ◽  
Vol 303-306 ◽  
pp. 201-205
Author(s):  
Shao Ping Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Method ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Method ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Unknown Node

Localization technology is one of the key supporting technologies in wireless sensor networks. In this paper, a collaborative multilateral localization algorithm is proposed to localization issues for wireless sensor networks. The algorithm applies anchor nodes within two hops to localize unknown nodes, and uses Nelder-Mead simplex optimization method to compute coordinates of the unknown nodes. If an unknown node can not be localized through two-hop anchor nodes, it is localized by anchor nodes and localized nodes within two hops through auxiliary iterative localization method. Simulation results show that the localization accuracy of this algorithm is very good, even in larger range errors.

scholarly journals Localization Algorithm for 3D Sensor Networks: A Recursive Data Fusion Approach

Sensors ◽  
2021 ◽  
Vol 21 (22) ◽  
pp. 7626
Author(s):  
Rafaela Villalpando-Hernandez ◽  
Cesar Vargas-Rosales ◽  
David Munoz-Rodriguez
Keyword(s):  
Sensor Networks ◽  
Data Fusion ◽  
Assisted Living ◽  
Ad Hoc ◽  
Location Estimation ◽  
Localization Algorithm ◽  
Noisy Information ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Recursive Data

Location-based applications for security and assisted living, such as human location tracking, pet tracking and others, have increased considerably in the last few years, enabled by the fast growth of sensor networks. Sensor location information is essential for several network protocols and applications such as routing and energy harvesting, among others. Therefore, there is a need for developing new alternative localization algorithms suitable for rough, changing environments. In this paper, we formulate the Recursive Localization (RL) algorithm, based on the recursive coordinate data fusion using at least three anchor nodes (ANs), combined with a multiplane location estimation, suitable for 3D ad hoc environments. The novelty of the proposed algorithm is the recursive fusion technique to obtain a reliable location estimation of a node by combining noisy information from several nodes. The feasibility of the RL algorithm under several network environments was examined through analytic formulation and simulation processes. The proposed algorithm improved the location accuracy for all the scenarios analyzed. Comparing with other 3D range-based positioning algorithms, we observe that the proposed RL algorithm presents several advantages, such as a smaller number of required ANs and a better position accuracy for the worst cases analyzed. On the other hand, compared to other 3D range-free positioning algorithms, we can see an improvement by around 15.6% in terms of positioning accuracy.

scholarly journals Trilateration based localization method using mobile anchor in wireless sensor networks

2020 ◽  
Vol 9 (1) ◽  
pp. 34
Author(s):  
M.G. Kavitha ◽  
Vinoth Kumar Kalimuthu ◽  
T. Jayasankar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Future Research ◽  
Localization Algorithm ◽  
Localization Method ◽  
Coverage Ratio ◽  
Movement Trajectories ◽  
Mobile Anchor ◽  
Anchor Nodes

<p><span>Localization in wireless sensor networks (WSNs) is essential in many applications like target tracking, military applications and environmental monitoring. Anchors which are equipped with global positioning system (GPS) facility are useful for finding the location information of nodes. These anchor nodes may be static or dynamic in nature. In this paper, we propose mobile anchors assisted localization algorithm based on regular hexagons in two-dimensional WSNs. We draw a conclusion that the number of anchor nodes greatly affect the performance of localization in a WSN. An optimal number of anchor nodes significantly reduces the localization error of unknown nodes and also guarantees that unknown nodes can obtain high localization accuracy. Because of the mobility of anchor nodes high volume of sensing region is covered with less period of time and hence the coverage ratio of the proposed algorithm increases. Number of communications also decreases for the reason that the system contains log<sub>e</sub> (n) number of anchor nodes which leads to less energy consumption at nodes. Simulation results show that our LUMAT algorithm significantly outperforms the localization method containing single anchor node in the network. Movement trajectories of mobile anchors should be designed dynamically or partially according to the observable environment or deployment situations to make full use of real-time information during localization. This is the future research issue in the area of mobile anchor assisted localization algorithm.</span></p>

scholarly journals Wireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions

2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Chenguang Shao
Keyword(s):  
Three Dimensional ◽  
Target Localization ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Target Node ◽  
Localization Accuracy ◽  
Localization Method ◽  
Anchor Nodes ◽  
2D And 3D ◽  
The Relationship

The target localization algorithm is critical in the field of wireless sensor networks (WSNs) and is widely used in many applications. In the conventional localization method, the location distribution of the anchor nodes is fixed and cannot be adjusted dynamically according to the deployment environment. The resulting localization accuracy is not high, and the localization algorithm is not applicable to three-dimensional (3D) conditions. Therefore, a Delaunay-triangulation-based WSN localization method, which can be adapted to two-dimensional (2D) and 3D conditions, was proposed. Based on the location of the target node, we searched for the triangle or tetrahedron surrounding the target node and designed the localization algorithm in stages to accurately calculate the coordinate value of the target. The relationship between the number of target nodes and the number of generated graphs was analysed through numerous experiments, and the proposed 2D localization algorithm was verified by extending it the 3D coordinate system. Experimental results revealed that the proposed algorithm can effectively improve the flexibility of the anchor node layout and target localization accuracy.

Data Localization Algorithms for Automated Inspection

1993 ◽  
Author(s):  
Woncheol Choi ◽  
Thomas R. Kurfess
Keyword(s):  
Optimization Problems ◽  
Measured Data ◽  
Least Square ◽  
Automated Inspection ◽  
Localization Algorithm ◽  
Original Design ◽  
Tolerance Zone ◽  
Unconstrained Optimization Problems ◽  
Localization Algorithms ◽  
Tolerance Specification

Abstract For automated inspection, correlating measured data with original design geometry and tolerance specification is of fundamental necessity. In order to compare measured data to nominal geometry, it is necessary to find an exact location of the measured points with respect to a nominal geometry coordinate system. If a tolerance zone is provided, its boundaries must be compared to the measured points to determine the quality and functionality of the part. The problem of localizing measured data can be formalized as an unconstrained optimization problems. In this paper, we develop the localization algorithms using the least square criterion. Such a localization algorithm can also place the measured data into tolerance zone, when it is specified.

scholarly journals Localization of Sensor Nodes using Flooding in Wireless Sensor Networks

2013 ◽  
Vol 9 (3) ◽  
pp. 1153-1161
Author(s):  
Basavaraj K Madagouda ◽  
Varsha M Patil ◽  
Pradnya Godse
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Real Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Anchor Nodes

The accuracy of localization is a significant criterion to evaluate the practical utility of localization algorithm in wireless sensor networks (WSN). In mostly localization algorithms, one of the main methods to improve localization accuracy is to increase the number of anchor nodes. But the number of anchor nodes is always limited because of the hardware restrict, such as cost, energy consumption and so on. In this paper, we propose a novel which uses forwarding a query message in flooding technique for localization using anchor nodes and once a node localized it acts as virtual anchor node and it helps to localize remaining sensor nodes. It is scheme to increase and upgrade the virtual anchor nodes, while the real number of physical anchors is the same as before.

Sign in / Sign up

Export Citation Format

Share Document