Localization in wireless sensor networks with gradient descent

In this article, we present two distance-based sensor network localization algorithms. The location of the sensors is unknown initially and we can estimate the relative locations of sensors by using knowledge of inter-sensor distance measurements. Together with the knowledge of the absolute locations of three or more sensors, we can also determine the locations of all the sensors in the wireless network. The proposed algorithms make use of gradient descent to achieve excellent localization accuracy. The two gradient descent algorithms are iterative in nature and result is obtained when there is no further improvement on the accuracy. Simulation results have shown that the proposed algorithms have better performance than existing localization algorithms. A comparison of different methods is given in the paper. © 2011 IEEE.published_or_final_versionThe 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PacRim), Victoria, B.C., 23-26 August 2011. In IEEE PacRim Conference Proceedings, 2011, p. 91-9

A Reliable and Resilient Framework for Multi-UAV Mutual Localization

This paper presents a robust and secure framework for achieving accurate and reliable mutual localization in multiple unmanned aerial vehicle (UAV) systems. Challenges of accurate localization and security threats are addressed and corresponding solutions are brought forth and accessed in our paper with numerical simulations. The proposed solution incorporates two key components: the Mobility Adaptive Gradient Descent (MAGD) and Time-evolving Anomaly Detectio (TAD). The MAGD adapts the gradient descent algorithm to handle the configuration changes in the mutual localization system, ensuring accurate localization in dynamic scenarios. The TAD cooperates with reputation propagation (RP) scheme to detect and mitigate potential attacks by identifying UAVs with malicious data, enhancing the security and resilience of the mutual localizationComment: Accepted by the 2023 IEEE 98th Vehicular Technology Conference (VTC2023-Fall), Hong Kong, 10-13 October 202

Localization and security algorithms for wireless sensor networks and the usage of signals of opportunity

In this dissertation we consider the problem of localization of wireless devices in environments and applications where GPS (Global Positioning System) is not a viable option. The _x000C_rst part of the dissertation studies a novel positioning system based on narrowband radio frequency (RF) signals of opportunity, and develops near optimum estimation algorithms for localization of a mobile receiver. It is assumed that a reference receiver (RR) with known position is available to aid with the positioning of the mobile receiver (MR). The new positioning system is reminiscent of GPS and involves two similar estimation problems. The _x000C_rst is localization using estimates of time-di_x000B_erence of arrival (TDOA). The second is TDOA estimation based on the received narrowband signals at the RR and the MR. In both cases near optimum estimation algorithms are developed in the sense of maximum likelihood estimation (MLE) under some mild assumptions, and both algorithms compute approximate MLEs in the form of a weighted least-squares (WLS) solution. The proposed positioning system is illustrated with simulation studies based on FM radio signals. The numerical results show that the position errors are comparable to those of other positioning systems, including GPS. Next, we present a novel algorithm for localization of wireless sensor networks (WSNs) called distributed randomized gradient descent (DRGD), and prove that in the case of noise-free distance measurements, the algorithm converges and provides the true location of the nodes. For noisy distance measurements, the convergence properties of DRGD are discussed and an error bound on the location estimation error is obtained. In contrast to several recently proposed methods, DRGD does not require that blind nodes be contained in the convex hull of the anchor nodes, and can accurately localize the network with only a few anchors. Performance of DRGD is evaluated through extensive simulations and compared with three other algorithms, namely the relaxation-based second order cone programming (SOCP), the simulated annealing (SA), and the semi-de_x000C_nite programing (SDP) procedures. Similar to DRGD, SOCP and SA are distributed algorithms, whereas SDP is centralized. The results show that DRGD successfully localizes the nodes in all the cases, whereas in many cases SOCP and SA fail. We also present a modi_x000C_cation of DRGD for mobile WSNs and demonstrate the e_x000E_cacy of DRGD for localization of mobile networks with several simulation results. We then extend this method for secure localization in the presence of outlier distance measurements or distance spoo_x000C_ng attacks. In this case we present a centralized algorithm to estimate the position of the nodes in WSNs, where outlier distance measurements may be present

A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods

This research presents a distributed and formula-based bilateration algorithm that can be used to provide initial set of locations. In this scheme each node uses distance estimates to anchors to solve a set of circle-circle intersection (CCI) problems, solved through a purely geometric formulation. The resulting CCIs are processed to pick those that cluster together and then take the average to produce an initial node location. The algorithm is compared in terms of accuracy and computational complexity with a Least-Squares localization algorithm, based on the Levenberg–Marquardt methodology. Results in accuracy vs. computational performance show that the bilateration algorithm is competitive compared with well known optimized localization algorithms

A Secure and Robust Approach for Distance-Based Mutual Positioning of Unmanned Aerial Vehicles

Unmanned aerial vehicle (UAV) is becoming increasingly important in modern civilian and military applications. However, its novel use cases is bottlenecked by conventional satellite and terrestrial localization technologies, and calling for complementary solutions. Multi-UAV mutual positioning can be a potential answer, but its accuracy and security are challenged by inaccurate and/or malicious measurements. This paper proposes a novel, robust, and secure approach to address these issues.Comment: Submitted to IEEE WCNC 202