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 d¯ ij 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 Σ (i, j)∈ Λ d¯ 2 ij(1 + (1 + μ ij) 2 + σ 2 ij).
|Titel||Proceedings of the 2015 Conference on research in adaptive and convergent systems|
|Forlag||Association for Computing Machinery|
|Status||Udgivet - 2015|
|Begivenhed||Conference on research in adaptive and convergent systems - Prague, Tjekkiet|
Varighed: 9. okt. 2015 → 12. okt. 2015
|Konference||Conference on research in adaptive and convergent systems|
|Periode||09/10/2015 → 12/10/2015|