Tight Two-Dimensional Outer-Approximations of Feasible Sets in Wireless Sensor Networks
Journal article, 2016

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.

optimal control applications & methods

localization

ernousko fl

mitigation

Computational geometry

p187

optimization

v3

uncertainty

Telecommunications

1982

localization

non-line-of-sight

Author

S. Yousefi

McGill University

Henk Wymeersch

Chalmers, Signals and Systems, Communication, Antennas and Optical Networks

X. W. Chang

McGill University

B. Champagne

McGill University

IEEE Communications Letters

1089-7798 (ISSN) 15582558 (eISSN)

Vol. 20 3 570-573 7383251

Cooperative Situational Awareness for Wireless Networks (COOPNET)

European Commission (EC) (EC/FP7/258418), 2011-05-01 -- 2016-04-30.

Areas of Advance

Information and Communication Technology

Driving Forces

Sustainable development

Subject Categories

Signal Processing

DOI

10.1109/lcomm.2016.2518186

More information

Created

10/8/2017