Browsing by Subject "Cramér-Rao lower bound (CRLB)"
Now showing 1 - 4 of 4
Results Per Page
Sort Options
Item Open Access Estimation theoretic analyses of location secrecy and ris-aided localization under hardware impairments(2022-06) Öztürk, CüneydIn 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.Item Open Access Improved position estimation using hybrid TW-TOA and TDOA in cooperative networks(Institute of Electrical and Electronics Engineers, 2012-04-13) Gholami, M. R.; Gezici, Sinan; Ström, E. G.This paper addresses the problem of positioning multiple target nodes in a cooperative wireless sensor network in the presence of unknown turn-around times. In this type of cooperative networks, two different reference sensors, namely, primary and secondary nodes, measure two-way time-of-arrival (TW-TOA) and time-difference-of-arrival (TDOA), respectively. Motivated by the role of secondary nodes, we extend the role of target nodes such that they can be considered as pseudo secondary nodes. By modeling turn-around times as nuisance parameters, we derive a maximum likelihood estimator (MLE) that poses a difficult global optimization problem due to its nonconvex objective function. To avoid drawbacks in solving the MLE, we linearize the measurements using two different techniques, namely, nonlinear processing and first-order Taylor series, and obtain linear models based on unknown parameters. The proposed linear estimator is implemented in three steps. In the first step, a coarse position estimate is obtained for each target node, and it is refined through steps two and three. To evaluate the performance of different methods, we derive the Cramér-Rao lower bound (CRLB). Simulation results show that the cooperation technique provides considerable improvements in positioning accuracy compared to the noncooperative scenario, especially for low signal-to-noise-ratios.Item Open Access Optimal power allocation and optimal linear encoding for parameter estimation in the presence of a smart eavesdropper(IEEE, 2022-08-11) Abadi, Erfan Mehdipour; Göken, Çağrı; Öztürk, Cüneyd; Gezici, SinanIn this article, we consider secure transmission of a deterministic vector parameter from a transmitter to an intended receiver in the presence of a smart eavesdropper. The aim is to determine the optimal power allocation and optimal linear encoding strategies at the transmitter to maximize the estimation performance at the intended receiver under constraints on the estimation performance at the eavesdropper and on the transmit power. First, the A-optimality criterion is adopted by utilizing the Cramér-Rao lower bound as the estimation performance metric, and the optimal power allocation and optimal linear encoding strategies are characterized theoretically. Then, corresponding to the D-optimality criterion, the determinant of the Fisher information matrix is considered as the estimation performance metric. It is shown that the optimal linear encoding and optimal power allocation strategies lead to the same solution for this criterion. In addition, extensions of the theoretical results are provided to cases with statistical knowledge of systems parameters. Numerical examples are provided to investigate the optimal power allocation and optimal linear encoding strategies in different scenarios.Item Open Access Optimal power allocation for secure estimation of multiple parameters(IEEE, 2021-08-11) Gürgünoğlu, Doğa; Göken, Ç.; Gezici, SinanOptimal power allocation for secure estimation of multiple deterministic parameters is investigated under a total power constraint. The goal is to minimize the Cramér-Rao lower bound (CRLB) at an intended receiver while keeping estimation errors at an eavesdropper above specified target levels. To that end, an optimization problem is formulated by considering measurement models involving linear transformation of the parameter vector and additive Gaussian noise. Although the proposed optimization problem is nonconvex, it is decomposed into convex sub-problems by utilizing the structure of the secrecy constraints. Then, optimal solutions to the sub-problems are characterized via optimization theoretic approaches. An algorithm utilizing that characterization is developed to obtain the optimal solution of the proposed problem.