On the Performance Analysis of TDOA Localization with Uncommon Reference Nodes

Decentralized time difference of arrival (TDOA) measurement in large wireless sensor networks (WSNs) is helpful to reduce transmission and computation costs, but it also brings the intractable problem of source position solving. This paper investigates TDOA-based localization with uncommon reference nodes (URNs). We propose an efficient localization algorithm taking advantage of both the algebraic and the iterative methods. More importantly, the localization-refused area (LRA), caused by the sensor-source geometries, is theoretically analyzed. Simulation results are included to examine the performance of the proposed algorithm and to demonstrate the LRAs with different network topologies.