Mixed integer linear programming for carrier optimization in wireless localization networks

Abstract

Localization of wireless nodes is a key feature in many modern services and applications. Recent investigations show that, appropriate resource allocation among the network nodes is of great importance in wireless localization. In this paper, we focus on the joint power and spectrum allocation (JPSA) problem in wireless localization networks. Since the original problem is essentially non-convex, JPSA can thus be reformulated as a mixed integer linear programming (MILP) problem by appropriate relaxations. Two high accuracy approximation algorithms are presented to solve the JPSA problems, in both non-cooperative and cooperative localization networks. Numeric results show that, the MILP based algorithms can solve the carrier optimization problem with high accuracy and efficiency, compared to the traditional full enumeration method. Furthermore, based on the presented optimal JPSA frameworks, appropriate cooperations among agents can obviously improve the performance of wireless positioning.