Robust and Low Complexity Source Localization in Wireless Sensor Networks Using Time Difference of Arrival Measurement
Authors:
- Enyang XuEXEnyang Xu
- Zhi DingZDZhi Ding
- Soura DasguptaSDSoura Dasgupta
- 1 April 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15253511,p. 1-5
Abstract
Wireless source localization has found a number of applications in wireless sensor networks. In this work, we investigate robust and low complexity solutions to the problem of source localization based on the time-difference of arrivals (TDOA) measurement model. By adopting a min-max approximation to the maximum likelihood source location estimation, we develop two low complexity algorithms that can be reliably and rapidly solved through semi-definite relaxation. Our approach hinges on the use of a reference sensor node which can be optimized according to the Cramer-Rao lower bound or selected heuristically. Our low complexity estimate can be used either as the final location estimation output or as the initial point for other traditional search algorithms.Keywords
This publication has 7 references indexed in Scilit:
- Efficient Convex Relaxation Methods for Robust Target Localization by a Sensor Network Using Time Differences of ArrivalsIEEE Transactions on Signal Processing, 2009
- Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance MeasurementsIEEE Transactions on Automation Science and Engineering, 2006
- Network-based wireless location: challenges faced in developing techniques for accurate wireless location informationIEEE Signal Processing Magazine, 2005
- Locating the nodes: cooperative localization in wireless sensor networksIEEE Signal Processing Magazine, 2005
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- Semidefinite ProgrammingSIAM Review, 1996
- Solution and performance analysis of geolocation by TDOAIEEE Transactions on Aerospace and Electronic Systems, 1993