This paper presents a performance analysis of two recently proposed distributed localization algorithms for cooperative 3-D wireless sensor networks (WSNs) in a more realistic scenario. The tested algorithms rely on distance and angle measurements obtained from received signal strength (RSS) and angle-of arrival (AoA) information, respectively. The measurements are then used to derive a convex estimator, based on second order cone programming (SOCP) relaxation techniques, and a non-convex one that can be formulated as a generalized trust region sub-problem (GTRS). Both estimators have shown excellent performance assuming a static network scenario, giving accurate location estimates in addition to converging in few iterations. Here, we test their performance considering different probabilities of communication failure between neighbour nodes at the broadcast phase. Our simulations show that their performance holds for high probability of communication failure and that convergence is still achieved in a reasonable number of iterations.
|Number of pages||6|
|Publication status||Published - 30 May 2017|
|Event||2017 International Young Engineers Forum (YEF-ECE) - Almada, Almada, Portugal|
Duration: 5 May 2017 → 5 May 2017
|Conference||2017 International Young Engineers Forum (YEF-ECE)|
|Abbreviated title||YEF-ECE 2017|
|Period||5/05/17 → 5/05/17|