Tight Two-Dimensional Outer-Approximations of Feasible Sets in Wireless Sensor Networks

Finding a tight ellipsoid that contains the intersection of a finite number of ellipsoids is of interest in positioning applications for wireless sensor networks (WSNs). To this end, we propose a novel geometrical method in 2-dimensional (2-D) space. Specifically, we first find a tight polygon, which contains the desired region and then obtain the tightest ellipse containing the polygon by solving a convex optimization problem. For demonstrating the usefulness of this method, we employ it in a distributed algorithm for elliptical outer-approximation of feasible sets in co-operative WSNs. Through simulations, we show that the proposed method gives a tighter bounding ellipse than conventional methods, while having similar computational cost.

[1]  W. Kahan,et al.  Circumscribing an Ellipsoid about the Intersection of Two Ellipsoids , 1968, Canadian Mathematical Bulletin.

[2]  N. Shor,et al.  New algorithms for constructing optimal circumscribed and inscribed ellipsoids , 1992 .

[3]  J. Norton,et al.  State bounding with ellipsoidal set description of the uncertainty , 1996 .

[4]  E. Yaz.  Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[5]  Federico Thomas,et al.  An ellipsoidal calculus based on propagation and fusion , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[6]  A.H. Sayed,et al.  Network-based wireless location: challenges faced in developing techniques for accurate wireless location information , 2005, IEEE Signal Processing Magazine.

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

[8]  Stephen P. Boyd,et al.  Disciplined Convex Programming , 2006 .

[9]  R. M. Buehrer,et al.  Non-line-of-sight identification in ultra-wideband systems based on received signal statistics , 2007 .

[10]  F. L. Chernousko,et al.  Ellipsoidal bounds for sets of attainability and uncertainty in control problems , 2007 .

[11]  Moe Z. Win,et al.  Cooperative Localization in Wireless Networks , 2009, Proceedings of the IEEE.

[12]  Ismail Güvenç,et al.  A Survey on TOA Based Wireless Localization and NLOS Mitigation Techniques , 2009, IEEE Communications Surveys & Tutorials.

[13]  Moe Z. Win,et al.  NLOS identification and mitigation for localization based on UWB experimental data , 2010, IEEE Journal on Selected Areas in Communications.

[14]  Erik G. Ström,et al.  Wireless network positioning as a convex feasibility problem , 2011, EURASIP J. Wirel. Commun. Netw..

[15]  Erik G. Ström,et al.  Distributed Bounding of Feasible Sets in Cooperative Wireless Network Positioning , 2013, IEEE Communications Letters.

[16]  Benoît Champagne,et al.  Mobile Localization in Non-Line-of-Sight Using Constrained Square-Root Unscented Kalman Filter , 2014, IEEE Transactions on Vehicular Technology.