Complexity and Error Propagation of Localization Using Interferometric Ranging

An interferometric ranging technique has been recently proposed as a possible way to localize ad hoc and sensor networks. Compared to the more common techniques such as received signal strength, time of arrival, and angle of arrival ranging, interferometric ranging has the advantage that the measurement could be highly precise. However, localization using interferometric ranging is difficult as it requires a large number of measurement readings. In this paper, we provide a formal proof of this difficulty in terms of algorithmic complexity. Furthermore, we propose an iterative algorithm that calculates node locations from a set of seeding anchors, gradually building a more global localization solution. Compared to previous localization algorithms, which treat localization as a global optimization problem, the iterative algorithm is a distributed algorithm that is simple to implement in larger networks. More importantly, the iterative algorithm allows us to study the error propagation behavior of localization using interferometric ranging. Using simulations, we validate the performance of the iterative algorithm in terms of localization error and coverage.

[1]  Gergely V. Záruba,et al.  Incorporating Data from Multiple Sensors for Localizing Nodes in Mobile Ad Hoc Networks , 2007, IEEE Transactions on Mobile Computing.

[2]  Alfred O. Hero,et al.  Indirect Radio Interferometric Localization via Pairwise Distances , 2006 .

[3]  Gaurav S. Sukhatme,et al.  Ad-hoc localization using ranging and sectoring , 2004, IEEE INFOCOM 2004.

[4]  David Evans,et al.  Localization for mobile sensor networks , 2004, MobiCom '04.

[5]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[6]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[7]  Brian D. O. Anderson,et al.  Rigidity, computation, and randomization in network localization , 2004, IEEE INFOCOM 2004.

[8]  Jie Gao,et al.  Localization and routing in sensor networks by local angle information , 2005, MobiHoc '05.

[9]  Miklós Maróti,et al.  Radio interferometric geolocation , 2005, SenSys '05.

[10]  Roger Wattenhofer,et al.  Unit disk graph approximation , 2004, DIALM-POMC '04.

[11]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[12]  R.L. Moses,et al.  Locating the nodes: cooperative localization in wireless sensor networks , 2005, IEEE Signal Processing Magazine.

[13]  Paramvir Bahl,et al.  RADAR: an in-building RF-based user location and tracking system , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  A. Ledeczi,et al.  Node-density independent localization , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[15]  Gergely V. Záruba,et al.  Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm , 2022 .

[16]  Xiaoli Li,et al.  A partial-range-aware localization algorithm for ad-hoc wireless sensor networks , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[17]  Tian He,et al.  Range-free localization schemes in large scale sensor network , 2003, MobiCom 2003.