Locations of target nodes in cooperative wireless sensor networks can be confined to a number of feasible sets in certain situations, e.g., when the estimated distances between sensors are larger than the actual distances.
Quantifying feasible sets is often challenging in cooperative positioning. In this letter, we propose an iterative technique to cooperatively outer approximate the feasible sets containing the locations of the target nodes.
We first outer approximate a feasible set including a target node location by an ellipsoid. Then, we extend the ellipsoid with the measured distances between sensor nodes and obtain larger ellipsoids. The larger ellipsoids are used to determine the intersections containing other targets.
Simulation results show that the proposed technique converges after a small number of iterations.

Skapa referens, olika format (klipp och klistra)

BibTeX @article{Gholami2013,author={Gholami, Mohammad Reza and Wymeersch, Henk and Gezici, Sinan and Ström, Erik G.},title={Distributed Bounding of Feasible Sets in Cooperative Wireless Network Positioning},journal={IEEE Communications Letters},issn={1089-7798},abstract={Locations of target nodes in cooperative wireless sensor networks can be confined to a number of feasible sets in certain situations, e.g., when the estimated distances between sensors are larger than the actual distances.
Quantifying feasible sets is often challenging in cooperative positioning. In this letter, we propose an iterative technique to cooperatively outer approximate the feasible sets containing the locations of the target nodes.
We first outer approximate a feasible set including a target node location by an ellipsoid. Then, we extend the ellipsoid with the measured distances between sensor nodes and obtain larger ellipsoids. The larger ellipsoids are used to determine the intersections containing other targets.
Simulation results show that the proposed technique converges after a small number of iterations.
},year={2013},keywords={Wireless sensor network; outer approximation; feasible sets; ellipsoid approximation; cooperative positioning},}

RefWorks RT Journal ArticleSR ElectronicID 178001A1 Gholami, Mohammad RezaA1 Wymeersch, HenkA1 Gezici, SinanA1 Ström, Erik G.T1 Distributed Bounding of Feasible Sets in Cooperative Wireless Network PositioningYR 2013JF IEEE Communications LettersSN 1089-7798AB Locations of target nodes in cooperative wireless sensor networks can be confined to a number of feasible sets in certain situations, e.g., when the estimated distances between sensors are larger than the actual distances.
Quantifying feasible sets is often challenging in cooperative positioning. In this letter, we propose an iterative technique to cooperatively outer approximate the feasible sets containing the locations of the target nodes.
We first outer approximate a feasible set including a target node location by an ellipsoid. Then, we extend the ellipsoid with the measured distances between sensor nodes and obtain larger ellipsoids. The larger ellipsoids are used to determine the intersections containing other targets.
Simulation results show that the proposed technique converges after a small number of iterations.
LA engDO 10.1109/LCOMM.2013.070113.130905LK http://dx.doi.org/10.1109/LCOMM.2013.070113.130905LK http://publications.lib.chalmers.se/records/fulltext/178001/local_178001.pdfOL 30