Joint Allocation of Spectral and Power Resources for Non-Cooperative Wireless Localization Networks

Network localization is a key feature in many wireless services and applications. In typical range-based non-cooperative localization techniques, agents try to perform position estimation through ranging with respect to anchors with known positions. Based on the definition of squared positional error bound, the localization accuracy can be determined by the transmit power, carrier frequency, and signal bandwidth. This paper analyzes the joint power and spectrum allocation (JPSA) optimization problems in resource restricted wireless localization systems. We first formulate both optimal interference-free and interference affected JPSA problems. We then formulate the robust counterparts of the problems in the presence of uncertainty of the agents' positions. Since all JPSA problems are non-convex, we show that they can be modeled and solved as geometric programming (GP) by proper approximations. Numeric results validate our analysis and show that the developed algorithms are able to find solutions close to the global optimum in the investigated cases. We can find the optimal/robust resource deployment in non-cooperative wireless localization networks based on the proposed frameworks.