Covert Localization in Wireless Networks: Feasibility and Performance Analysis
In this paper, we propose covert localization to improve the security of wireless localization networks, which can prevent the legitimate transmission of localization signals between anchors and agent from being detected by the illegitimate warden. Specifically, we first establish a framework of covert localization and demonstrate its feasibility when the warden suffers noise uncertainty. Then, with two specific noise uncertainty distributions, we derive the fundamental limit of localization accuracy, i.e., covert squared position error bound (CSPEB), which is the achievable localization accuracy for the agent while ensuring covertness for the warden. Theoretical analysis of CSPEB demonstrates the impact of different factors on the localization accuracy. Besides, in an energy-constrained scenario, we formulate a power allocation problem to refine anchors' power to minimize the CSPEB for a given total power budget and develop an algorithm based on the semidefinite program (SDP). Simulation results verify our theoretical analysis by evaluating the effect of several representative factors on the CSPEB and show the superiority of the SDP-based power allocation algorithm to the other baseline methods.