Distributed bounding of feasible sets in cooperative wireless network positioning

Simple item page
buir.contributor.authorGezici, Sinan
dc.citation.epage1599en_US
dc.citation.issueNumber8en_US
dc.citation.spage1596en_US
dc.citation.volumeNumber17en_US
dc.contributor.authorGholami, M. R.en_US
dc.contributor.authorWymeersch, H.en_US
dc.contributor.authorGezici, Sinanen_US
dc.contributor.authorStröm, E. G.en_US
dc.date.accessioned2016-02-08T09:35:56Z
dc.date.available2016-02-08T09:35:56Z
dc.date.issued2013en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractLocations 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.provenanceMade 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: 2013en
dc.identifier.doi10.1109/LCOMM.2013.070113.130905en_US
dc.identifier.issn1089-7798
dc.identifier.urihttp://hdl.handle.net/11693/20820
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/LCOMM.2013.070113.130905en_US
dc.source.titleIEEE Communications Lettersen_US
dc.subjectcooperative positioningen_US
dc.subjectellipsoid approximationen_US
dc.subjectWireless sensor networken_US
dc.subjectActual distanceen_US
dc.subjectCooperative wireless networksen_US
dc.subjectEllipsoid approximationen_US
dc.subjectFeasible seten_US
dc.subjectIterative techniqueen_US
dc.subjectNumber of iterationsen_US
dc.subjectOuter approximationen_US
dc.subjectElectrical engineeringen_US
dc.subjectMathematical modelsen_US
dc.subjectWireless sensor networksen_US
dc.subjectSensor nodesen_US
dc.titleDistributed bounding of feasible sets in cooperative wireless network positioningen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
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
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering