scholarly journals A Robust, Non-Cooperative Localization Algorithm in the Presence of Outlier Measurements in Ocean Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (12) ◽  
pp. 2708 ◽  
Author(s):  
Xiaojun Mei ◽  
Huafeng Wu ◽  
Jiangfeng Xian ◽  
Bowen Chen ◽  
Hao Zhang ◽  
...  

As an important means of multidimensional observation on the sea, ocean sensor networks (OSNs) could meet the needs of comprehensive information observations in large-scale and multifactor marine environments. In what concerns OSNs, accurate location information is the basis of the data sets. However, because of the multipath effect—signal shadowing by waves and unintentional or malicious attacks—outlier measurements occur frequently and inevitably, which directly degrades the localization accuracy. Therefore, increasing localization accuracy in the presence of outlier measurements is a critical issue that needs to be urgently tackled in OSNs. In this case, this paper proposed a robust, non-cooperative localization algorithm (RNLA) using received signal strength indication (RSSI) in the presence of outlier measurements in OSNs. We firstly formulated the localization problem using a log-normal shadowing model integrated with a first order Taylor series. Nevertheless, the problem was infeasible to solve, especially in the presence of outlier measurements. Hence, we then converted the localization problem into the optimization problem using squared range and weighted least square (WLS), albeit in a nonconvex form. For the sake of an accurate solution, the problem was then transformed into a generalized trust region subproblem (GTRS) combined with robust functions. Although GTRS was still a nonconvex framework, the solution could be acquired by a bisection approach. To ensure global convergence, a block prox-linear (BPL) method was incorporated with the bisection approach. In addition, we conducted the Cramer–Rao low bound (CRLB) to evaluate RNLA. Simulations were carried out over variable parameters. Numerical results showed that RNLA outperformed the other algorithms under outlier measurements, notwithstanding that the time for RNLA computation was a little bit more than others in some conditions.

Sensors ◽  
2019 ◽  
Vol 19 (21) ◽  
pp. 4665 ◽  
Author(s):  
Zhaoyang Wang ◽  
Xuebo Jin ◽  
Xiaoyi Wang ◽  
Jiping Xu ◽  
Yuting Bai

Reliable and accurate localization of objects is essential for many applications in wireless networks. Especially for large-scale wireless sensor networks (WSNs), both low cost and high accuracy are targets of the localization technology. However, some range-free methods cannot be combined with a cooperative method, because these range-free methods are characterized by low accuracy of distance estimation. To solve this problem, we propose a hard decision-based cooperative localization method. For distance estimation, an exponential distance calibration formula is derived to estimate distance. In the cooperative phase, the cooperative method is optimized by outlier constraints from neighboring anchors. Simulations are conducted to verify the effectiveness of the proposed method. The results show that localization accuracy is improved in different scenarios, while high node density or anchor density contributes to the localization. For large-scale WSNs, the hard decision-based cooperative localization is proved to be effective.


2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Guangjie Han ◽  
Chenyu Zhang ◽  
Jaime Lloret ◽  
Lei Shu ◽  
Joel J. P. C. Rodrigues

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 of 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 several mobile anchors which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. This paper proposes a mobile anchor assisted localization algorithm based on regular hexagon (MAALRH) in two-dimensional WSNs, which can cover the whole monitoring area with a boundary compensation method. Unknown nodes calculate their positions by using trilateration. We compare the MAALRH with HILBERT, CIRCLES, and S-CURVES algorithms in terms of localization ratio, localization accuracy, and path length. Simulations show that the MAALRH can achieve high localization ratio and localization accuracy when the communication range is not smaller than the trajectory resolution.


2018 ◽  
Vol 2018 ◽  
pp. 1-18
Author(s):  
Huanqing Cui ◽  
Yongquan Liang ◽  
Chuanai Zhou ◽  
Ning Cao

Due to uneven deployment of anchor nodes in large-scale wireless sensor networks, localization performance is seriously affected by two problems. The first is that some unknown nodes lack enough noncollinear neighbouring anchors to localize themselves accurately. The second is that some unknown nodes have many neighbouring anchors to bring great computing burden during localization. This paper proposes a localization algorithm which combined niching particle swarm optimization and reliable reference node selection in order to solve these problems. For the first problem, the proposed algorithm selects the most reliable neighbouring localized nodes as the reference in localization and using niching idea to cope with localization ambiguity problem resulting from collinear anchors. For the second problem, the algorithm utilizes three criteria to choose a minimum set of reliable neighbouring anchors to localize an unknown node. Three criteria are given to choose reliable neighbouring anchors or localized nodes when localizing an unknown node, including distance, angle, and localization precision. The proposed algorithm has been compared with some existing range-based and distributed algorithms, and the results show that the proposed algorithm achieves higher localization accuracy with less time complexity than the current PSO-based localization algorithms and performs well for wireless sensor networks with coverage holes.


2021 ◽  
Author(s):  
Hend Liouane ◽  
Sana Messous ◽  
Omar Cheikhrouhou

Abstract Multi-hop localization is a an important technique for Wireless Sensor Networks. Location awareness is very crucial for almost existing sensor network applications. However, using Global Positioning System (GPS) receivers to every node is very expensive. Therefore, the Distance Vector-Hop algorithm (DV-Hop) is proposed and very famous for its simplicity and localization accuracy for Wireless Sensor Networks. The cited algorithm uses a small number of anchor nodes, which are equipped with GPS, thus their locations are known, while other nodes estimate their location from the network connectivity information. However, DV-Hop presents some deficiencies and drawbacks in terms of localization accuracy. Therefore, we propose in this paper an improvement of DV-Hop algorithm, called Regularized Least Square DV-Hop Localization Algorithm for multihop wireless sensors networks. The proposed solution improves the location accuracy of sensor nodes within their sensing field in both isotropic and anisotropic networks. Simulation results prove that the proposed algorithm outperforms the original DV-Hop algorithm with up to 60%, as well as other related works, in terms of localization accuracy.


2011 ◽  
Vol 317-319 ◽  
pp. 1078-1083 ◽  
Author(s):  
Qing Tao Lin ◽  
Xiang Bing Zeng ◽  
Xiao Feng Jiang ◽  
Xin Yu Jin

This paper establishes a 3-D localization model and based on this model, it proposes a collaborative localization framework. In this framework, node that observes the object sends its attitude information and the relative position of the object's projection in its camera to the cluster head. The cluster head adopts an algorithm proposed in this paper to select some nodes to participate localization. The localization algorithm is based on least square method. Because the localization framework is based on a 3-D model, the size of the object or other prerequisites is not necessary. At the end of this paper, a simulation is taken on the numbers of nodes selected to locate and the localization accuracy. The result implies that selecting 3~4 nodes is proper. The theoretical analysis and the simulation result also imply that a const computation time cost is paid in this framework with a high localization accuracy (in our simulation environment, a 0.01 meter error).


Author(s):  
Shrawan Kumar ◽  
D. K. Lobiyal

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.


Sensors ◽  
2019 ◽  
Vol 19 (7) ◽  
pp. 1645 ◽  
Author(s):  
Ryota Kimoto ◽  
Shigemi Ishida ◽  
Takahiro Yamamoto ◽  
Shigeaki Tagashira ◽  
Akira Fukuda

The deployment of a large-scale indoor sensor network faces a sensor localization problem because we need to manually locate significantly large numbers of sensors when Global Positioning System (GPS) is unavailable in an indoor environment. Fingerprinting localization is a popular indoor localization method relying on the received signal strength (RSS) of radio signals, which helps to solve the sensor localization problem. However, fingerprinting suffers from low accuracy because of an RSS instability, particularly in sensor localization, owing to low-power ZigBee modules used on sensor nodes. In this paper, we present MuCHLoc, a fingerprinting sensor localization system that improves the localization accuracy by utilizing channel diversity. The key idea of MuCHLoc is the extraction of channel diversity from the RSS of Wi-Fi access points (APs) measured on multiple ZigBee channels through fingerprinting localization. MuCHLoc overcomes the RSS instability by increasing the dimensions of the fingerprints using channel diversity. We conducted experiments collecting the RSS of Wi-Fi APs in a practical environment while switching the ZigBee channels, and evaluated the localization accuracy. The evaluations revealed that MuCHLoc improves the localization accuracy by approximately 15% compared to localization using a single channel. We also showed that MuCHLoc is effective in a dynamic radio environment where the radio propagation channel is unstable from the movement of objects including humans.


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 10 (18) ◽  
pp. 6152 ◽  
Author(s):  
Zhen Xu ◽  
Shuai Guo ◽  
Tao Song ◽  
Lingdong Zeng

Aiming at the localization problem of mobile robot in construction scenes, a hybrid localization algorithm with the adaptive weights is proposed, which can effectively improve the robust localization of mobile robot. Firstly, two indicators of localization accuracy and calculation efficiency are set to reflect the robustness of localization. Secondly, the construction scene is defined as an ongoing scene, and the robust localization of mobile robot is achieved by using the measurement of artificial landmarks and matching based on generated features. Finally, the experimental results show that the accuracy of localization is up to 8.22 mm and the most matching efficiency is controlled within 0.027 s. The hybrid localization algorithm that based on adaptive weights can realize a good robustness for tasks such as autonomous navigation and path planning in construction scenes.


Sign in / Sign up

Export Citation Format

Share Document