This work considers the problem of selecting the best nodes for localizing (in the mean squared (MS) position error sense) a target in a distributed wireless sensor network. Each node consists of an array of sensors that are able to estimate the direction of arrival (DOA) to a target. Different computationally efficient node selection approaches that use global network knowledge are introduced. Performance bounds based on the node/target geometry are derived, and these bounds help to determine the necessary communication reach of the active nodes. The resulting geolocation performance and energy usage, based on communication distance, is evaluated for a decentralized extended Kalman filter (EKF) that is exploiting the different selection approaches.
Global node selection for localization in a distributed sensor network
IEEE Transactions on Aerospace and Electronic Systems ; 42 , 1 ; 113-135
01.01.2006
2950209 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Global Node Selection for Localization in a Distributed Sensor Network
Online Contents | 2006
|Local Node Selection for Localization in a Distributed Sensor Network
Online Contents | 2006
|Node Selection Strategy for Target Localization in Wireless Sensor Networks
British Library Online Contents | 2009
|A Fast Global Node Selection Algorithm for Bearings-only Target Localization
British Library Online Contents | 2008
|