Beacon deployment strategy for guaranteed localization in wireless sensor networks

AbstractIn wireless sensor networks, beacons are always treated as infrastructures for localization. After beacons are deployed, non-beacon nodes can be located by simple schemes such as multilateration and multidimensional scaling (MDS). Deploying as many beacons as needed is an efficient way to improve localization accuracy where a global positioning system does not work well or a higher location accuracy is required. With more beacons to be deployed, the configuration of beacons’ positions will have to be done manually. Therefore position auto-configuration using measured distances between these beacons can save a lot of efforts for the deployment. One challenge of this auto-configuration is that the positions should be uniquely determined based on the measured distances. In graph theory, it is a problem of unique realization in which the positions of vertices are determined by edges between them. Addressing this problem is one major aspect of this paper. To determine whether the topology of a network is a unique realization, this paper proposes a novel category of topology named Uniquely Determined Topology, with which edges in a d-dimensional space can be reduced from $$d+1$$d+1 to d in each extension, which is less strict and more suitable for beacon deployment. The other aspect of this paper is to improve localization accuracy of the deployed beacons. In MDS and curvilinear component analysis, a shortest-path algorithm is adopted to approximately reconstruct the distance matrix between each two nodes, and our proposed Uniquely Determined Topology has a feature that a distance calculation model can be adopted to replace the shortest-path algorithm, therefore that the local distance matrix can be reconstructed more accurately. Theoretical analysis shows that it has a low computational complexity to determine whether a deployment is a Uniquely Determined Topology. Simulations show the advantages of the improved localization scheme, in that they do not depend on the connectivity level of the networks, and they can provide accurate localization when the estimation accuracy of distances is high.

[1]  Iwen Coisel,et al.  Untangling RFID Privacy Models , 2013, IACR Cryptol. ePrint Arch..

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

[3]  Bodhi Priyantha,et al.  The Cricket indoor location system , 2005 .

[4]  Robert Connelly,et al.  Generic Global Rigidity , 2005, Discret. Comput. Geom..

[5]  Jan Beutel,et al.  Deployment Techniques for Sensor Networks , 2010 .

[6]  Ying Zhang,et al.  Localization from mere connectivity , 2003, MobiHoc '03.

[7]  Behzad Moshiri,et al.  Survey on location information services for Vehicular Communication Networks , 2014, Wirel. Networks.

[8]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs , 2022 .

[9]  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 .

[10]  Rosdiadee Nordin,et al.  Recent Advances in Wireless Indoor Localization Techniques and System , 2013, J. Comput. Networks Commun..

[11]  Takahiro Hara,et al.  Localization algorithms of Wireless Sensor Networks: a survey , 2011, Telecommunication Systems.

[12]  Li Li,et al.  Cooperative node localization using nonlinear data projection , 2009, TOSN.

[13]  Mohammad Reza Meybodi,et al.  Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach , 2013, Wirel. Networks.

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

[15]  Chi-Chang Chen,et al.  Range-Free Localization Scheme in Wireless Sensor Networks Based on Bilateration , 2013, Int. J. Distributed Sens. Networks.

[16]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

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

[18]  Wheeler Ruml,et al.  Improved MDS-based localization , 2004, IEEE INFOCOM 2004.

[19]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

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

[21]  Patrick J. F. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 2003 .

[22]  J. Holtzman,et al.  The non-line of sight problem in mobile location estimation , 1996, Proceedings of ICUPC - 5th International Conference on Universal Personal Communications.

[23]  F. Raab,et al.  Magnetic Position and Orientation Tracking System , 1979, IEEE Transactions on Aerospace and Electronic Systems.

[24]  Antonio Iera,et al.  The Internet of Things: A survey , 2010, Comput. Networks.

[25]  Yunhao Liu,et al.  Beyond Trilateration: On the Localizability of Wireless Ad-Hoc Networks , 2009, INFOCOM 2009.

[26]  Marc St-Hilaire,et al.  iCCA-MAP: A New Mobile Node Localization Algorithm , 2009, 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[27]  Seth J. Teller,et al.  The cricket compass for context-aware mobile applications , 2001, MobiCom '01.

[28]  Yunhao Liu,et al.  Location, Localization, and Localizability , 2010, Journal of Computer Science and Technology.

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