%0 Conference Proceedings
%T Distributed RSS-Based Localization in Wireless Sensor Networks with Node Selection Mechanism
%+ Institute for Systems and Robotics [Lisbon] (ISR)
%+ Universidade Lusófona de Humanidades e Tecnologias [Lisbon]
%+ Instituto de Desenvolvimento de Novas Tecnologias [Caparica] (UNINOVA)
%+ Departamento de Engenharia Electrotécnica (DEE)
%+ Instituto de Telecomunicações [Lisboa, Portugal]
%+ University of Belgrade [Belgrade]
%+ Megatrend University [Belgrade]
%A Tomic, Slavisa
%A Beko, Marko
%A Dinis, Rui
%A Dimic, Goran
%A Tuba, Milan
%Z Part 7: Perception and Signal Processing
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 6th Doctoral Conference on Computing, Electrical and Industrial Systems (DoCEIS)
%C Costa de Caparica, Portugal
%Y Luis M. Camarinha-Matos
%Y Thais A. Baldissera
%Y Giovanni Di Orio
%Y Francisco Marques
%3 Technological Innovation for Cloud-Based Engineering Systems
%V AICT-450
%P 204-214
%8 2015-04-13
%D 2015
%R 10.1007/978-3-319-16766-4_22
%K Wireless localization
%K Wireless sensor network (WSN)
%K Received signal strength (RSS)
%K Second-order cone programming problem (SOCP)
%K Cooperative localization
%K Distributed localization
%Z Computer Science [cs]Conference papers
%X In this work, 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 based on 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. Furthermore, we investigate the case where target nodes limit the number of cooperating nodes by selecting only those neighbors with the highest RSS measurements. This simple procedure may decrease 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 degradation in its performance when the number of cooperating nodes is reduced.
%G English
%Z TC 5
%Z WG 5.5
%2 https://inria.hal.science/hal-01343484/document
%2 https://inria.hal.science/hal-01343484/file/336594_1_En_22_Chapter.pdf
%L hal-01343484
%U https://inria.hal.science/hal-01343484
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-WG
%~ IFIP-WG5-5
%~ IFIP-DOCEIS
%~ IFIP-AICT-450