Distributed bounding of feasible sets in cooperative wireless network positioning
buir.contributor.author | Gezici, Sinan | |
dc.citation.epage | 1599 | en_US |
dc.citation.issueNumber | 8 | en_US |
dc.citation.spage | 1596 | en_US |
dc.citation.volumeNumber | 17 | en_US |
dc.contributor.author | Gholami, M. R. | en_US |
dc.contributor.author | Wymeersch, H. | en_US |
dc.contributor.author | Gezici, Sinan | en_US |
dc.contributor.author | Ström, E. G. | en_US |
dc.date.accessioned | 2016-02-08T09:35:56Z | |
dc.date.available | 2016-02-08T09:35:56Z | |
dc.date.issued | 2013 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description.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. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T09:35:56Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2013 | en |
dc.identifier.doi | 10.1109/LCOMM.2013.070113.130905 | en_US |
dc.identifier.issn | 1089-7798 | |
dc.identifier.uri | http://hdl.handle.net/11693/20820 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/LCOMM.2013.070113.130905 | en_US |
dc.source.title | IEEE Communications Letters | en_US |
dc.subject | cooperative positioning | en_US |
dc.subject | ellipsoid approximation | en_US |
dc.subject | Wireless sensor network | en_US |
dc.subject | Actual distance | en_US |
dc.subject | Cooperative wireless networks | en_US |
dc.subject | Ellipsoid approximation | en_US |
dc.subject | Feasible set | en_US |
dc.subject | Iterative technique | en_US |
dc.subject | Number of iterations | en_US |
dc.subject | Outer approximation | en_US |
dc.subject | Electrical engineering | en_US |
dc.subject | Mathematical models | en_US |
dc.subject | Wireless sensor networks | en_US |
dc.subject | Sensor nodes | en_US |
dc.title | Distributed bounding of feasible sets in cooperative wireless network positioning | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Distributed bounding of feasible sets in cooperative wireless network positioning.pdf
- Size:
- 180.83 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version