Cooperative localization in hybrid infrared/visible light networks: Theoretical limits and distributed algorithms

buir.contributor.authorKeskin, M. Furkan
buir.contributor.authorErdem, Osman
buir.contributor.authorGezici, Sinan
dc.citation.epage197en_US
dc.citation.issueNumber1en_US
dc.citation.spage181en_US
dc.citation.volumeNumber5en_US
dc.contributor.authorKeskin, M. Furkanen_US
dc.contributor.authorErdem, Osmanen_US
dc.contributor.authorGezici, Sinanen_US
dc.date.accessioned2019-02-21T16:05:59Zen_US
dc.date.available2019-02-21T16:05:59Zen_US
dc.date.issued2019en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractLight emitting diode (LED) based visible light positioning (VLP) networks can provide accurate location information in environments where the global positioning system (GPS) suffers from severe signal degradation and/or cannot achieve high precision, such as indoor scenarios. In this manuscript, we propose to employ cooperative localization for hybrid infrared/visible light networks that involve multiple LED transmitters having known locations (e.g., on the ceiling) and visible light communication (VLC) units equipped with both LEDs and photodetectors (PDs) for the purpose of cooperation. In the considered scenario, downlink transmissions from LEDs on the ceiling to VLC units occur via visible light signals, while the infrared spectrum is utilized for device-to-device communications among VLC units. First, we derive the Cramer-Rao lower bound (CRLB) and the maximum likelihood estimator (MLE) for the localization of VLC units in the proposed cooperative scenario. To tackle the nonconvex structure of the MLE, we adopt a set-theoretic approach by formulating the problem of cooperative localization as a quasiconvex feasibility problem, where the aim is to find a point inside the intersection of convex constraint sets constructed as the sublevel sets of quasiconvex functions resulting from the Lambertian formula. Next, we devise two feasibility-seeking algorithms based on iterative gradient projections to solve the feasibility problem. Both algorithms are amenable to distributed implementation, thereby avoiding high-complexity centralized approaches. Capitalizing on the concept of quasi-Fej\'er convergent sequences, we carry out a formal convergence analysis to prove that the proposed algorithms converge to a solution of the feasibility problem in the consistent case. Numerical examples illustrate the improvements in localization performance achieved via cooperation among VLC units and evidence the convergence of the proposed algorithms to true VLC unit locations in both the consistent and inconsistent cases. IEEEen_US
dc.description.provenanceMade available in DSpace on 2019-02-21T16:05:59Z (GMT). No. of bitstreams: 1 Bilkent-research-paper.pdf: 222869 bytes, checksum: 842af2b9bd649e7f548593affdbafbb3 (MD5) Previous issue date: 2018en
dc.identifier.doi10.1109/TSIPN.2018.2866344en_US
dc.identifier.eissn2373-776Xen_US
dc.identifier.issn1053-587Xen_US
dc.identifier.urihttp://hdl.handle.net/11693/50285en_US
dc.language.isoEnglishen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.relation.isversionofhttps://doi.org/10.1109/TSIPN.2018.2866344en_US
dc.source.titleIEEE Transactions on Signal and Information Processing over Networksen_US
dc.subjectConvergenceen_US
dc.subjectCooperative localizationen_US
dc.subjectGradient projectionsen_US
dc.subjectInfrareden_US
dc.subjectLight emitting diodesen_US
dc.subjectPositioningen_US
dc.subjectQuasi-Fejer convergenceen_US
dc.subjectQuasiconvex feasibilityen_US
dc.subjectSet-theoretic estimationen_US
dc.titleCooperative localization in hybrid infrared/visible light networks: Theoretical limits and distributed algorithmsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Cooperative_Localization_in_Hybrid_Infrared_Visible_Light_Networks_Theoretical_Limits_and_Distributed_Algorithms.pdf
Size:
1.06 MB
Format:
Adobe Portable Document Format
Description:
Full printable version