This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Mixed Convex/Nonconvex Distributed Localization Approach for the Deployment of Indoor Positioning Services
November 2008 (vol. 7 no. 11)
pp. 1325-1337
Antonio Abramo, University of Udine, Udine
Franco Blanchini, University of Udine, Udine
Luca Geretti, University of Udine, Udine
Carlo Savorgnan, University of Udine, Udine
In this paper the indoor wireless localization problem is addressed both from the theoretical and application standpoints. The main result of the paper is on the theoretical side: the topological definition of regular and irregular nodes is introduced, and formal results are presented to support regularity as a desirable network property for the attainment of precise node localization. In force of this definition, a mixed convex/non—convex optimization approach has been derived for the solution of the positioning problem. The two procedures, suitably combined, allow the achievement of better convergence towards the best positioning of a multitude of blind wireless nodes. A completely decentralized, partially asynchronous algorithm is presented, which proceeds locally on each node based on the sole knowledge of the distances measured from, and of the estimated positions of the connected nodes only. Its repeated asynchronous application on each nodes guarantees the convergence of the algorithm to the positioning of the whole network, even in presence of a limited number of peripheral reference points. Indeed, no global information is required for the proper functioning of the algorithm. Simulations of relevant case studies have been performed to qualify the proposed scheme in realistic conditions, and the results are presented.

[1] J. van Greunen and J. Rabaey, “Locationing and Timing Synchronization Services in Ambient Intelligence Networks,” Ambient Intelligence, W. Weber, J. Rabaey, and E. Aarts, eds., Springer Verlag, p. 173, 2005.
[2] Texas Instrument CC2430 ZeegBee transceiver Data Sheet, http://focus.ti.com/lit/ds/symlinkCC2430.pdf , 2008.
[3] Texas Instrument CC2431 Location Engine Data Sheet, http://focus.ti.com/lit/ds/symlinkcc2431.pdf , 2008.
[4] H. Ochi and S. Tagashira, “A Localization Scheme for Sensor Networks Based on Wireless Communication with Anchor Groups,” IEICE Trans. Information and Systems, vol. E89-D, p. 1614, 2006.
[5] E. Elnahrawy, L. Xiaoyan, and R. Martin, “The Limits of Localization Using Signal Strength: A Comparative Study,” Proc. First IEEE Conf. Sensor and Ad Hoc Comm. and Networks (SECON'04), p. 406, 2004.
[6] N. Priyantha, H. Balakrishnan, E. Demaine, and S. Teller, “Anchor-Free Distributed Localization in Sensor Networks,” MIT LCS, Technical Report TR-892, citeseer.ist.psu.edu681068.html, Apr. 2003.
[7] X. Ji and H. Zha, “Sensor Positioning in Wireless Ad Hoc Networks Using Multidimensional Scaling,” IEEE INFOCOM '04 Technical Digest, p. 2652, 2004.
[8] K. Liu, S. Wang, F. Zhang, F. Hu, and C. Xu, “Efficient Localized Localization Algorithm for Wireless Sensor Networks,” Proc. Fifth Int'l Conf. Computer and Information Technology (CIT '05), p. 517, 2005.
[9] S. Guha, R. Murty, and E.G. Sirer, “Sextant: A Unified Node and Event Localization Framework Using Non-Convex Constraints,” ACM MobiHoc '05 Technical Digest, p. 205, 2005.
[10] W. Wang and B.-H. Soong, “A Distributed Heuristics of Localization in Wireless Sensor Network,” Proc. Second IEEE Int'l Conf. Wireless Comm., Networking and Mobile Computing (WiCOM '06), p. 1, 2006.
[11] P. Liu, X. Zhang, S. Tian, Z. Zhao, and P. Sun, “A Novel Virtual Anchor Node-Based Localization Algorithm for Wireless Sensor Networks,” Proc. Sixth Int'l Conf. Networking (ICN '07), p. 9, 2007.
[12] B. Turgut and R.P. Martin, “Localization for Indoor Wireless Networks Using Minimum Intersection Areas of ISO-RSS Lines,” Proc. 32nd Ann. IEEE Conf. Local Computer Networks (LCN '07), p. 962, 2007.
[13] Y. Shang, W. Ruml, Y. Zhang, and M. Fromherz, “Localization from Mere Connectivity,“ ACM MobiHoc '03 Technical Digest, p.201, 2003.
[14] L. Doherty, K. Pister, and L.E. Ghaoui, “Convex Position Estimation in Wireless Sensor Networks,” Proc. IEEE INFOCOM '01, p. 1655, 2001.
[15] T. Eren, D. Goldenberg, W. Whiteley, Y. Yang, A. Morse, B. Anderson, and P. Belhumeur, “Rigidity, Computation, and Randomization in Network Localization,” Proc. IEEE INFOCOM '04, vol. 4, p. 2673, 2004.
[16] K. Langendoen and N. Reijers, “Distributed Localization in Wireless Sensor Networks: A Qualitative Comparison,” Int'l J. Computer and Telecomm. Networking, vol. 43, p. 499, 2003.
[17] N. Patwari, A.H. III, M. Perkins, N. Correal, and R. O'Dea, “Relative Location Estimation in Wireless Sensor Networks,” IEEE Trans. Signal Processing, vol. 51, p. 2137, 2003.
[18] J. Costa, N. Patwari, and A. Hero, “Distributed Weighted Multidimensional Scaling for Node Localization in Sensor Networks,” ACM Trans. Sensor Networks, vol. 2, p. 39, 2006.
[19] J. Liu, Y. Zhang, and F. Zhao, “Robust Distributed Node Localization with Error Management,” ACM MobiHoc '06 Technical Digest, p. 250, 2006.
[20] S. Datta, C. Klinowski, M. Rudafshani, and S. Khaleque, “Distributed Localization in Static and Mobile Sensor Networks,” Proc. IEEE Second Int'l Conf. Wireless and Mobile Computing, Networking and Comm. (WiMob '06), p. 696, 2006.
[21] D. Bertsekas, Nonlinear Programming. Athena Scientific, 2004.
[22] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
[23] D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computing: Numerical Methods. Athena Scientific, 1997.

Index Terms:
Mobile Applications, Pervasive computing, Optimization, Constrained optimization, Convex programming
Citation:
Antonio Abramo, Franco Blanchini, Luca Geretti, Carlo Savorgnan, "A Mixed Convex/Nonconvex Distributed Localization Approach for the Deployment of Indoor Positioning Services," IEEE Transactions on Mobile Computing, vol. 7, no. 11, pp. 1325-1337, Nov. 2008, doi:10.1109/TMC.2008.59
Usage of this product signifies your acceptance of the Terms of Use.