Paper Info
Title
Semi-definite programming-based localization algorithm in networks with inhomogeneous transmission medium
Abstract
We study the asymptotic properties of a semi-definite programming (SDP) based localization algorithm in a network of wireless sensors with an inhomogeneous RF transmission interface given incomplete and inaccurate pairwise distance measurements between sensor-sensor and sensor-anchors. A novel relaxed SDP approach based on a graph realization problem with noisy time-of-arrival (TOA) measurements with additive Gaussian noise and inaccurate transmission permittivity and permeability coefficients both with additive standard Gaussian noise and a varying dielectric constant is proposed. Denoting the true distance between a pair of sensors i and j by [EQUATION] and the set of known pair-wise distances between sensors-sensors and sensors-anchors by Λ, an upper bound for the expected value of the optimal objective relaxed SDP problem is obtained, showing that its asymptotic properties can potentially grow as fast as [EQUATION].
Year
DOI
Venue
2015
10.1145/2811411.2811494
RACS
Field
DocType
Citations 
Permittivity,Upper and lower bounds,Computer science,Algorithm,Expected value,Transmission medium,Gaussian noise,Linear matrix inequality,Semidefinite programming,Graph realization problem
Conference
0
PageRank 
References 
Authors
0.34
3
3
Name
Order
Citations
PageRank
Esmaeil S. Nadimi195.90
Jürgen Herp200.68
Mohammad H. Ramezani322.08