An iterative method of processing node flip ambiguity in wireless sensor networks node localization

In order to solve the problem of the node flip ambiguity generated by using classical least squares method in wireless sensor networks node localization, an iterative method based on triangular node blocks (IP-TNB) to process node flip ambiguity is proposed in this paper. At first, orthogonal projection detection method is adopted to detect an unknown node needed to be positioned. If the node would be detected to have a flip ambiguity, based on the stability of triangle node blocks and the whole network connectivity information, the flip ambiguity node is processed by the iterative method based on coordinate transformation and recursive optimization, so the process can detect and correct the problem of node flip ambiguity using the least squares method. The simulation results demonstrate that IP-TNB has better positioning performance and reduce node localization errors compared with Particle Swarm Optimization (PSO) and Iterative Inflexible Body Merging (IIBM) proposed by Xiao et al. By the simulation experiment of the effect of the number of beacon nodes and range errors on IP-TNB, results show that the proposed method not only can effectively deal with the problem of node flip ambiguity using the least squares method, but also improve the whole network localization accuracy.

[1]  Guoqiang Mao,et al.  Analysis of Flip Ambiguities for Robust Sensor Network Localization , 2010, IEEE Transactions on Vehicular Technology.

[2]  Angelo Cenedese,et al.  Low-Density Wireless Sensor Networks for Localization and Tracking in Critical Environments , 2010, IEEE Transactions on Vehicular Technology.

[3]  Enqing Dong,et al.  An improved flip ambiguity detection algorithm in wireless sensor networks node localization , 2014, 2014 21st International Conference on Telecommunications (ICT).

[4]  Francesco Sottile,et al.  Robust Localization for Wireless Sensor Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[5]  Jiannong Cao,et al.  Iterative Localization of Wireless Sensor Networks: An Accurate and Robust Approach , 2014, IEEE/ACM Transactions on Networking.

[6]  Zhixin Sun,et al.  Toward collinearity-aware and conflict-friendly localization for wireless sensor networks , 2012, Comput. Commun..

[7]  Jun Luo,et al.  Beyond rigidity: obtain localisability with noisy ranging measurement , 2011, Int. J. Ad Hoc Ubiquitous Comput..

[8]  Joe-Air Jiang,et al.  A Distributed RSS-Based Localization Using a Dynamic Circle Expanding Mechanism , 2013, IEEE Sensors Journal.

[9]  Yunhao Liu,et al.  Perpendicular Intersection: Locating Wireless Sensors With Mobile Beacon , 2010 .

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

[11]  Azzedine Boukerche,et al.  Localization systems for wireless sensor networks , 2007, IEEE wireless communications.

[12]  Yunhao Liu,et al.  OFA: An optimistic approach to conquer flip ambiguity in network localization , 2013, Comput. Networks.

[13]  Dan Komosny,et al.  Multilateration and Flip Ambiguity Mitigation in Ad-hoc Networks , 2012 .

[14]  Guoqiang Mao,et al.  Use of flip ambiguity probabilities in robust sensor network localization , 2011, Wirel. Networks.

[15]  G. Mazzini,et al.  Collinearity for sensor network localization , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[16]  Francesco Marcelloni,et al.  A two-objective evolutionary approach based on topological constraints for node localization in wireless sensor networks , 2012, Appl. Soft Comput..