Name
Title | ||
|---|---|---|
Tight Two-Dimensional Outer-Approximations of Feasible Sets in Wireless Sensor Networks. |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/LCOMM.2016.2518186 | IEEE Communications Letters |
Keywords | Field | DocType |
Ellipsoids,Wireless sensor networks,Convex functions,Position measurement,Noise measurement,Computational modeling,Computational efficiency | Topology,Mathematical optimization,Polygon,Ellipsoid,Computer science,Computational geometry,Real-time computing,Convex function,Distributed algorithm,Ellipse,Convex optimization,Wireless sensor network | Journal |
Volume | Issue | ISSN |
20 | 3 | 1089-7798 |
Citations | PageRank | References |
2 | 0.37 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Siamak Yousefi | 1 | 13 | 1.90 |
| Henk Wymeersch | 2 | 1589 | 128.47 |
| Xiao-Wen Chang | 3 | 208 | 24.85 |
| Benoît Champagne | 4 | 510 | 67.66 |