Sensor placement algorithms for target localization in sensor networks
Authors:
- 1 May 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10975659,p. 1-6
Abstract
This paper formulates and solves the sensor placement problem for efficient target localization in a sensor network. We illustrate our approach through a missile defense problem where the objective is the efficient localization of the missile using multiple sensors. We develop a mathematical framework for the localization of the missile using multiple sensors based on Cramer-Rao lower bound (CRLB) analysis. We derive the fisher information matrix to facilitate the evaluation of estimation accuracy. We develop an evolutionary algorithm for obtaining the sensor placements. Simulation results show that the evolutionary algorithm outperforms a greedy sensor placement algorithm and obtains sensor placements with very low estimation error.Keywords
This publication has 9 references indexed in Scilit:
- Discrete sensor placement problems in distribution networksMathematical and Computer Modelling, 2005
- Algorithms for Wireless Sensor NetworksInternational Journal of Distributed Sensor Networks, 2005
- Sensor Deployment Strategy for Detection of Targets Traversing a RegionMobile Networks and Applications, 2003
- Sensor placement for grid coverage under imprecise detections2003
- Sensor networks: an overviewIEEE Potentials, 2003
- A survey on sensor networksIEEE Communications Magazine, 2002
- Passive ranging of a low observable ballistic missile in a gravitational fieldIEEE Transactions on Aerospace and Electronic Systems, 2001
- Radar power multiplier for acquisition of low observables using an ESA radarIEEE Transactions on Aerospace and Electronic Systems, 2001
- Ballistic missile track initiation from satellite observationsIEEE Transactions on Aerospace and Electronic Systems, 1995