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, whic...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2016-03, Vol.20 (3), p.570-573
Main Authors: Yousefi, Siamak, Wymeersch, Henk, Xiao-Wen Chang, Champagne, Benoit
Format: Article
Language:English
Subjects:
1982
Computational efficiency
Computational geometry
Computational modeling
Convex functions
Ellipsoids
ernousko fl
localization
mitigation
Noise measurement
non-line-of-sight
non-line-ofsight
optimal control applications & methods
optimization
p187
Position measurement
Telecommunications
uncertainty
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1089-7798
1558-2558
1558-2558
DOI:10.1109/LCOMM.2016.2518186