Ranging energy optimization for robust sensor positioning based on semidefinite programming

  • Authors:

  • Tao Wang;Geert Leus;Li Huang

  • Affiliations:

  • Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands and Stichting IMEC Nederland, Holst Centre, Eindhoven, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands;Stichting IMEC Nederland, Holst Centre, Eindhoven, The Netherlands

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 2009

Quantified Score

Hi-index 35.68

Visualization

Abstract

Sensor positioning is an important task of location-aware wireless sensor networks. In most sensor positioning systems, sensors and beacons need to emit ranging signals to each other. Sensor ranging energy should be low to prolong system lifetime, but sufficiently high to fulfill prescribed accuracy requirements. This motivates us to investigate ranging energy optimization problems. We address ranging energy optimization for an unsynchronized positioning system, which features robust sensor positioning (RSP) in the sense that a specific accuracy requirement is fulfilled within a prescribed service area. We assume a line-of-sight (LOS) channel exists between the sensor and each beacon. The positioning is implemented by time-of-arrival (TOA) based two-way ranging between a sensor and beacons, followed by a location estimation at a central processing unit. To establish a dependency between positioning accuracy and ranging energy, we assume the adopted TOA and location estimators are unbiased and attain the associated Cramér-Rao bound. The accuracy requirement has the same form as the one defined by the Federal Communication Commission (FCC), and we present two constraints with linear-matrix-inequality form for the RSP. Ranging energy optimization problems, as well as a practical algorithm based on semidefinite programming are proposed. The effectiveness of the algorithm is illustrated by numerical experiments.