Localization-Oriented Network Adjustment in Wireless Ad Hoc and Sensor Networks

Localization is an enabling technique for many sensor network applications. Real-world deployments demonstrate that, in practice, a network is not always entirely localizable, leaving a certain number of theoretically nonlocalizable nodes. Previous studies mainly focus on how to tune network settings to make a network localizable. However, the existing methods are considered to be coarse-grained, since they equally deal with localizable and nonlocalizable nodes. Ignoring localizability induces unnecessary adjustments and accompanying costs. In this study, we propose a fine-grained approach, localizability-aided localization (LAL), which basically consists of three phases: node localizability testing, structure analysis, and network adjustment. LAL triggers a single round adjustment, after which some popular localization methods can be successfully carried out. Being aware of node localizability, all network adjustments made by LAL are purposefully selected. Experiment and simulation results show that LAL effectively guides the adjustment while makes it efficient in terms of the number of added edges and affected nodes.

[1]  S. Seidel,et al.  914 MHz path loss prediction models for indoor wireless communications in multifloored buildings , 1992 .

[2]  Andrey V. Savkin,et al.  Node localization using mobile robots in delay-tolerant sensor networks , 2005, IEEE Transactions on Mobile Computing.

[3]  David C. Moore,et al.  Robust distributed network localization with noisy range measurements , 2004, SenSys '04.

[4]  B. R. Badrinath,et al.  DV Based Positioning in Ad Hoc Networks , 2003, Telecommun. Syst..

[5]  Yunhao Liu,et al.  Localization in non-localizable sensor and ad-hoc networks: A Localizability-aided approach , 2011, 2011 Proceedings IEEE INFOCOM.

[6]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[7]  Brian D. O. Anderson,et al.  Localization in sparse networks using sweeps , 2006, MobiCom '06.

[8]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[9]  Yunhao Liu,et al.  Understanding Node Localizability of Wireless Ad-hoc Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[10]  Ying Zhang,et al.  Rigidity guided localisation for mobile robotic sensor networks , 2010, Int. J. Ad Hoc Ubiquitous Comput..

[11]  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).

[12]  David E. Culler,et al.  Calibration as parameter estimation in sensor networks , 2002, WSNA '02.

[13]  G. Laman.  On graphs and rigidity of plane skeletal structures , 1970 .

[14]  Philip Levis,et al.  Collection tree protocol , 2009, SenSys '09.

[15]  A. Savvides,et al.  Network localization in partially localizable networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[17]  Erik D. Demaine,et al.  Mobile-assisted localization in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[19]  Yunhao Liu,et al.  Detecting Outlier Measurements Based on Graph Rigidity for Wireless Sensor Network Localization , 2013, IEEE Transactions on Vehicular Technology.

[20]  Shanshan Li,et al.  Component based localization in sparse wireless ad hoc and sensor networks , 2008, 2008 IEEE International Conference on Network Protocols.

[21]  B. Hendrickson,et al.  An Algorithm for Two-Dimensional Rigidity Percolation , 1997 .

[22]  Yunhao Liu,et al.  Beyond Triangle Inequality: Sifting Noisy and Outlier Distance Measurements for Localization , 2010, 2010 Proceedings IEEE INFOCOM.

[23]  Shaojie Tang,et al.  Canopy closure estimates with GreenOrbs: sustainable sensing in the forest , 2009, SenSys '09.

[24]  Yunhao Liu,et al.  Understanding Node Localizability of Wireless Ad Hoc and Sensor Networks , 2012, IEEE Transactions on Mobile Computing.

[25]  Brian D. O. Anderson,et al.  Graphical properties of easily localizable sensor networks , 2009, Wirel. Networks.

[26]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

[27]  Brian D. O. Anderson,et al.  A Theory of Network Localization , 2006, IEEE Transactions on Mobile Computing.

[28]  Bruce Hendrickson,et al.  Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..

[29]  Guobin Shen,et al.  BeepBeep: a high accuracy acoustic ranging system using COTS mobile devices , 2007, SenSys '07.

[30]  B. Hendrickson,et al.  Regular ArticleAn Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game , 1997 .

[31]  Ivan Lavallée,et al.  A Distributed Algorithm for the Maximum Flow Problem , 2005, The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05).

[32]  Mihail L. Sichitiu,et al.  Localization of wireless sensor networks with a mobile beacon , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

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

[34]  Hewijin Christine Jiau,et al.  Localization with mobile anchor points in wireless sensor networks , 2005, IEEE Transactions on Vehicular Technology.