Mixed Convex/Non-Convex Distributed Localization Algorithm for the Deployment of Indoor Positioning Services

In this paper a fully decentralized algorithm for indoor wireless localization is presented. The algorithm combines the use of convex and non-convex optimization procedures, nested to achieve better converge towards the best positioning of a multitude of blind wireless nodes. The algorithm proceeds locally on each node, based on the sole knowledge of the measured distances from, and estimated positions of, the connected nodes only. Repeated asynchronous application on each node of the local procedure guarantees hierarchical convergence of the algorithm to the positioning of the whole network, even in presence of a limited number of peripheral anchors. No global information is required for the proper functioning of the algorithm. From the theoretical standpoint, the paper introduces the geometrical definition of regular and irregular nodes, which is shown to be a useful concept, given a network topology, for the characterization of the convergence properties of the localization problem.

[1]  Satoshi Fujita,et al.  A localization scheme for sensor networks based on wireless communication with anchor groups , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[2]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Xiang Ji,et al.  Sensor positioning in wireless ad-hoc sensor networks using multidimensional scaling , 2004, IEEE INFOCOM 2004.

[4]  Emin Gün Sirer,et al.  Sextant: a unified node and event localization framework using non-convex constraints , 2005, MobiHoc '05.

[5]  Alfred O. Hero,et al.  Distributed weighted-multidimensional scaling for node localization in sensor networks , 2006, TOSN.

[6]  Richard P. Martin,et al.  The limits of localization using signal strength: a comparative study , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[7]  Ying Zhang,et al.  Robust distributed node localization with error management , 2006, MobiHoc '06.

[8]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[9]  Suprakash Datta,et al.  Distributed localization in static and mobile sensor networks , 2006, 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[10]  Koen Langendoen,et al.  Distributed localization in wireless sensor networks: a quantitative compariso , 2003, Comput. Networks.

[11]  Erik D. Demaine,et al.  Anchor-Free Distributed Localization in Sensor Networks , 2003 .

[12]  Richard P. Martin,et al.  Localization for indoor wireless networks using minimum intersection areas of iso-RSS lines , 2007 .

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

[14]  Wei Wang,et al.  A Distributed Heuristics of Localization in Wireless Sensor Network , 2006, 2006 International Conference on Wireless Communications, Networking and Mobile Computing.

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

[16]  Alfred O. Hero,et al.  Relative location estimation in wireless sensor networks , 2003, IEEE Trans. Signal Process..

[17]  Fan Zhang,et al.  Efficient Localized Localization Algorithm for Wireless Sensor Networks , 2005, The Fifth International Conference on Computer and Information Technology (CIT'05).

[18]  Jan M. Rabaey,et al.  Locationing and Timing Synchronization Services in Ambient Intelligence Networks , 2005 .

[19]  Xinming Zhang,et al.  A Novel Virtual Anchor Node-Based Localization Algorithm for Wireless Sensor Networks , 2007, Sixth International Conference on Networking (ICN'07).

[20]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .