Linear programming algorithms for sensor networks node localization

Localization with a small number of beacons is a challenging problem in wireless network. Traditional approaches commonly treat it as a nonlinear optimization problem which makes the computation very costly. In this paper, we propose a linear programming algorithm to address the problem. We formulate the nonlinear problem as a simple linear programming using linear approximation and our target is to minimize the least-mean absolute errors known as the residuals. Simulation results demonstrate that the proposed algorithm can maintain a better positioning accuracy under a small number of beacon nodes compared with the existing algorithms.