CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

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

S. Yousefi ; Henk Wymeersch (Institutionen för signaler och system, Kommunikationssystem) ; X. W. Chang ; B. Champagne
Ieee Communications Letters (1089-7798). Vol. 20 (2016), 3, p. 570-573.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: Computational geometry, localization, non-line-of-sight, optimization, localization, uncertainty, mitigation, Telecommunications, ernousko fl, 1982, optimal control applications & methods, v3, p187



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2016-04-22. Senast ändrad 2016-12-06.
CPL Pubid: 235061

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)




Projekt

Denna publikation är ett resultat av följande projekt:


Cooperative Situational Awareness for Wireless Networks (COOPNET) (EC/FP7/258418)