Estimation theoretic analyses of location secrecy and ris-aided localization under hardware impairments

buir.advisorGezici, Sinan
dc.contributor.authorÖztürk, Cüneyd
dc.date.accessioned2022-08-08T06:41:23Z
dc.date.available2022-08-08T06:41:23Z
dc.date.copyright2022-06-29
dc.date.issued2022-06
dc.date.submitted2022-06-29
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (Ph.D.): Bilkent University, Department of Electrical and Electronics Engineering, İhsan Doğramacı Bilkent University, 2022.en_US
dc.descriptionIncludes bibliographical references (leaves 145-157).en_US
dc.description.abstractIn this thesis, we present estimation theoretic analyses of location secrecy and reconfigurable intelligent surface (RIS) aided localization under hardware impairments. First, we consider a wireless source localization network in which a target node emits localization signals that are used by anchor nodes to estimate the target node position. In addition to target and anchor nodes, there can also exist eavesdropper nodes and jammer nodes which aim to estimate the position of the target node and to degrade the accuracy of localization, respectively. We propose the problem of eavesdropper selection with the goal of optimally placing a given number of eavesdropper nodes to a subset of possible positions in the network to estimate the target node position as accurately as possible. As the performance metric, the Cramér-Rao lower bound (CRLB) related to the estimation of the target node position by eavesdropper nodes is derived, and its convexity and monotonicity properties are investigated. By relaxing the integer constraints, the eavesdropper selection problem is approximated by a convex optimization problem and algorithms are proposed for eavesdropper selection. Moreover, in the presence of parameter uncertainty, a robust version of the eavesdropper selection problem is developed. Then, the problem of jammer selection is proposed where the aim is to optimally place a given number of jammer nodes to a subset of possible positions for degrading the localization accuracy of the network as much as possible. A CRLB expression from the literature is used as the performance metric, and its concavity and monotonicity properties are derived. Also, a convex optimization problem and its robust version are derived after relaxation. Moreover, the joint eavesdropper and jammer selection problem is proposed with the goal of placing certain numbers of eavesdropper and jammer nodes to a subset of possible positions. Simulation results are presented to illustrate performance of the proposed algorithms. Second, a wireless source localization network consisting of synchronized target and anchor nodes is considered. An anchor placement problem is formulated to minimize the CRLB on estimation of target node positions by anchor nodes. It is shown that the anchor placement problem can be approximated as a minimization problem of the ratio of two supermodular functions. Due to the lack of a polynomial time algorithm for such problems, an anchor selection problem is proposed to solve the anchor placement problem. Via relaxation of integer constraints, the anchor selection problem is approximated by a convex optimization problem, which is used to propose two algorithms for anchor selection. Furthermore, extensions to quasi-synchronous wireless localization networks are discussed. To examine the performance of the proposed algorithms, various simulation results are presented. Third, we investigate the problem of RIS-aided near-field localization of a user equipment (UE) served by a base station (BS) under phase-dependent amplitude variations at each RIS element. Through a misspecified Cramér -Rao bound (MCRB) analysis and a resulting lower bound (LB) on localization, we show that when the UE is unaware of amplitude variations (i.e., assumes unit-amplitude responses), severe performance penalties can arise, especially at high signal-to-noise ratios (SNRs). Leveraging Jacobi-Anger expansion to decouple range-azimuth-elevation dimensions, we develop a low-complexity approximated mismatched maximum likelihood (AMML) estimator, which is asymptotically tight to the LB. To mitigate performance loss due to model mismatch, we propose to jointly estimate the UE location and the RIS amplitude model parameters. The corresponding Cramér -Rao bound (CRB) is derived, as well as an iterative refinement algorithm, which employs the AMML method as a subroutine and alternatingly updates individual parameters of the RIS amplitude model. Simulation results indicate fast convergence and performance close to the CRB. The proposed method can successfully recover the performance loss of the AMML under a wide range of RIS parameters and effectively calibrate the RIS amplitude model online with the help of a user that has an a-priori unknown location. Fourth, we consider RIS-aided localization scenarios with RIS pixel failures, where individual RIS elements can become faulty due to hardware imperfections. We explore the impact of such failures on the localization performance. To that aim, an MCRB analysis is conducted and numerical results indicate that performance loss for estimating the UE position can be significant in the presence of pixel failures. To remedy this issue, we develop two different diagnosis strategies to determine which pixels are failing, and design robust methods to perform localization in the presence of faulty elements. One strategy is based on the l_1-regularization method, the second one employs a successive approach. Both methods significantly reduce the performance loss due to pixel failures. The successive one performs very close to the theoretical bounds at high SNRs even though it has a higher computational cost than the l_1-regularization based method. In the final part of the dissertation, the optimal encoding strategy of a scalar parameter is performed in the presence of jamming based on an estimation theoretic criterion. Namely, the aim is to obtain the optimal encoding function at the transmitter that minimizes the expectation of the conditional Cramér -Rao bound (ECRB) at the receiver when the jammer has access to the parameter and alters the received signal by sending an encoded version of the parameter. Via calculus of variations, the optimal encoding function at the transmitter is characterized explicitly, and an algorithm is proposed to calculate it. Numerical examples demonstrate benefits of the proposed optimal encoding approach.en_US
dc.description.degreePh.D.en_US
dc.description.statementofresponsibilityby Cüneyd Öztürken_US
dc.embargo.release2022-12-29
dc.format.extentxvii, 157 leaves : charts ; 30 cm.en_US
dc.identifier.itemidB161040
dc.identifier.urihttp://hdl.handle.net/11693/110388
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectAnchor placementen_US
dc.subjectCalculus of variationsen_US
dc.subjectCramér-Rao lower bound (CRLB)en_US
dc.subjectEavesdroppingen_US
dc.subjectHardware impairmentsen_US
dc.subjectJammingen_US
dc.subjectMaximum likelihood estimatoren_US
dc.subjectMisspeci ed Cramér-Rao bound (MCRB)en_US
dc.subjectLocalizationen_US
dc.subjectOptimizationen_US
dc.subjectParameter estimationen_US
dc.subjectRecon- fi gurable intelligent surfaces (RIS)en_US
dc.subjectSecrecyen_US
dc.titleEstimation theoretic analyses of location secrecy and ris-aided localization under hardware impairmentsen_US
dc.title.alternativeKonum gizliliğinin ve donanımsal hatalar altında YYAY destekli konumlandırmanın kestirim kuramsal analizlerien_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
B161040.pdf
Size:
1.77 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description: