We address the target localization problem in large-scale cooperative wireless sensor networks (WSNs). Using the noisy range measurements, extracted from the received signal strength (RSS) information, we formulate the localization problem by using the maximum likelihood (ML) criterion. ML-based solutions are particularly important due to their asymptotically optimal performance, but the localization problem is highly non-convex. To overcome this difficulty, we propose a convex relaxation leading to second-order cone programming (SOCP), which can be efficiently solved by interior-point algorithms. Since the energy is a very valuable resource of the WSNs, we investigate the case where target nodes limit the number of cooperating nodes by selecting only those neighbors with highest RSS. This simple procedure can reduce the energy consumption of an algorithm in both communication and computation phase. Our simulation results show that the proposed approach outperforms the existing ones in terms of the estimation accuracy. Moreover, they show that the new approach does not suffer significant performance degradation when the number of cooperating nodes is reduced.
|Title of host publication||Proceedings of the ICTF Forum|
|Publication status||Published - 1 Jan 2014|
|Event||ICTF Forum - |
Duration: 1 Jan 2014 → …
|Period||1/01/14 → …|
Beko, M., Dinis, R. M. H. D. M., & DEE Group Author (2014). Energy-efficient Distributed RSS-based Localization in Wireless Sensor Networks Using Convex Relaxation. In Proceedings of the ICTF Forum (pp. 1-6)