22 December 2008 in IEEE Transactions on Wireless Communications
The goal of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pairwise noisy distance measurements and some anchor node positions. This paper describes a distributed localization algorithm based on second-order cone programming relaxation. We show that the sensor nodes can estimate their positions based on local information. Unlike previous approaches, we also consider the effect of inaccurate anchor positions. In the presence of anchor position errors, the localization is performed in three steps. First, the sensor nodes estimate their positions using information from their neighbors. In the second step, the anchors refine their positions using relative distance information exchanged with their neighbors and finally, the sensors refine their position estimates. We demonstrate the convergence of the algorithm numerically. Simulation study, for both uniform and irregular network topologies, illustrates the robustness of the algorithm to anchor position and distance estimation errors, and the performance gains achievable in terms of localization accuracy, problem size reduction and computational efficiency.
25 September 2012 in Journal of Signal Processing Systems
1 July 2011 in Journal AWWA
1 August 2018 in Sensors and Actuators A: Physical
12 August 2021 in IEEE Transactions on Instrumentation and Measurement
The ability of a sensor node to determine its location in a sensor network is important in many applications. We address the scenario, where malicious anchor node(s) attempt to disrupt, in an uncoordinated or coordinated manner, the localization process of a target node. We propose four localization techniques: weighted least square (WLS), secure WLS (SWLS), and l 1 -norm-based techniques LN-1 and LN-1E. WLS and SWLS techniques are shown to offer a significant advantage in uncoordinated attacks over existing techniques by detecting the malicious nodes and eliminating their measurements from the localization process and assigning larger weights to the measurements corresponding to anchor nodes that are closer to the target node. In a coordinated attack, the localization problem can be posed as a plane fitting problem, where the measurements from nonmalicious and malicious anchor nodes lie on two different planes. The LN-1E technique estimates the two planes and prevents disruption of the localization process. LN-1E can also determine the location where the malicious anchor nodes intend to make the target node appear to be located. The Cramer-Rao lower bound for the position estimate is also derived. We present simulation and experimental results, which demonstrate that the proposed techniques provide better localization accuracy than existing algorithms.