1 December 2021 in IEEE Transactions on Vehicular Technology
Worst-case robust approximation was proven to be efficient in alleviating the non-line-of-sight (NLOS) influence for source positioning. However, the existing time-difference-of-arrival (TDOA)-based worst-case solutions still have two issues: 1) Inaccurate objective transformations are introduced in some algorithms, which reduce the accuracy; 2) A method with higher accuracy is computationally intensive. This study proposes an accurate and simplified worst-case approximation method to tackle the troubles. Precisely, we first prove that the nonconvex worst-case objective is piecewise monotone to the NLOS bias. We further use monotonicity to derive an accurate and convex expression of the worst-case objective. Then, we propose simplified transformations to redefine the worst-case approximation problem with fewer constraints. Besides, we prove the effectiveness of the simplified transformations. Simulations and experiments demonstrate that the proposed method with moderate computation exhibits better performance than the state-of-the-art worst-case approximation algorithms.
19 August 2022 in IEEE Internet of Things Journal
Source localization within wireless sensor networks (WSNs) is one of the critical technologies in the Internet of Things (IoT). As the number of network nodes increases, so does the amount of data and computational requirement. It is imperative to introduce edge computing. However, there are still two issues when running existing wireless location algorithms on edge nodes: 1) conventional low-complexity approaches are easily affected by the bias generated in complex environments, leading to low locating accuracy and 2) the optimization algorithms considering the bias have good performances, but they are calculation-efficiency low on edge nodes. This study proposes a computationally efficient and high-precision location method to tackle the troubles. Precisely, we first introduce our previous research to construct a bias-considered nonconvex problem with a linear objective. Then, we propose an angle-assisted Taylor series with zero truncation error to linearize the second-order cone (SOC) constraint in the established problem. Next, we resort to the mini-max criterion to eliminate the angular uncertainty and get a robust linear programming (LP) problem with an optimal solution. So far, we have obtained a convex problem of low complexity. To ensure the calculated efficiency of the proposed problem on edge nodes, we proceed to give the solving process of the problem. Moreover, we provide a constraints tracking mechanism to reduce the number of iterations in the solution procedure, improving computational efficiency. Simulations and experiments demonstrate that the proposed method with similar locating accuracy to state-of-the-art optimization algorithms exhibits much higher computing efficiency on edge nodes.
27 August 2024 in IEEE Transactions on Vehicular Technology
In the presence of occlusion, the non-line-of-sight (NLOS) error has been proven to satisfy a distance-dependent model (DDM). However, existing DDM-based Time-of-Arrival (TOA) localization methods overfit due to their dependence on the exact linear coefficients in the model or assume that the linear coefficients are the same in all paths. In response to the defect, we represent the linear coefficients in matrix form and resort to robust optimization. Subsequently, we construct a second-order cone (SOC) programming with the linear coefficients matrix. To obtain a tractable robust optimization problem, we first convert the SOC constraint to a semi-definite cone (SDC) constraint using the Schur complement. Then, we decompose the SDC constraint with auxiliary variables. For the nonconvexity introduced by the linear coefficients matrix, we use Cauchy-Schwarz inequality and norm compatibility to eliminate the linear coefficients matrix. Finally, we convert a non-convex problem into a solvable semi-definite programming (SDP) problem. This study considers the linear coefficients as matrix variables, making the estimates accurate in densely cluttered environments and independent of precisely priori information about the linear coefficients. Simulations and experiments show better localization accuracy in complex environments than state-of-the-art algorithms.
24 June 2024 in IEEE Transactions on Industrial Informatics
Wireless localization with ultra-wideband technology or 5G/6G cellular networks is a major contributor to addressing satellite signal-denied positioning. The accuracy of localization, however, suffers from non-line-of-sight (NLOS) propagation. Literature has highlighted several approaches to improve precision, such as channel-based, map-based, and statistical feature-based. More attention has focused on the linear growth trend of NLOS error with distance at lower prior information acquisition costs. However, no previous study explores the uncertainty in the trend arising from a dynamic NLOS environment. Accordingly, this article intends to comprehensively utilize the linear trend and uncertainty to find the optimal location solution. First, we propose a distance-dependent uncertain model for NLOS error and construct an uncertain second-order cone programming. We then convert the nonconvex problem into a solvable positive semidefinite programming by Schur complement, Cauchy–Schwarz inequality, S-lemma, and constraint relaxation/tightening techniques. Simulations and experiments show that the resulting optimal and robust solution can obtain remarkable positioning accuracy in densely cluttered environments. The importance and originality of this study are that it fully uses the linear growth trend of NLOS error while incorporating the uncertainty for the trend.
15 April 2025 in Signal Processing