Robust Time-Based Localization for Asynchronous Networks

被引:91
作者
Wang, Yiyin [1 ]
Ma, Xiaoli [2 ]
Leus, Geert [1 ]
机构
[1] Delft Univ Technol, Fac Elect Engn Math & Comp Sci, NL-2628 CD Delft, Netherlands
[2] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA
关键词
Clock offset; clock skew; least-squares; localization; synchronization; two-way ranging; MAXIMUM-LIKELIHOOD-ESTIMATION; WIRELESS SENSOR NETWORKS; DISTRIBUTED SYNCHRONIZATION; CLOCK SYNCHRONIZATION; OFFSET; SKEW;
D O I
10.1109/TSP.2011.2159215
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Time-based localization approaches attract a lot of interest due to their high accuracy and potentially low cost for wireless sensor networks (WSNs). However, time-based localization is tightly coupled with clock synchronization. Thus, the reliability of timestamps in time-based localization becomes an important yet challenging task to deal with. In this paper, we propose robust time-based localization strategies to locate a target node with the help of anchors (nodes with known positions) in asynchronous networks. Two kinds of asynchronous networks are considered: one only with clock offsets, labeled quasi-synchronous networks, whereas the other with not only clock offsets but also clock skews, labeled fully asynchronous networks. A novel ranging protocol is developed for both networks, namely asymmetric trip ranging (ATR), to reduce the communication load and explore the broadcast property of WSNs. Regardless of the reliability of the timestamp report from the target node, closed-form least-squares (LS) estimators are derived to accurately estimate the target node position. As a result, we counter the uncertainties caused by the target node by ignoring the timestamps from this node. Furthermore, in order to simplify the estimator in fully asynchronous networks, localization and synchronization are decoupled. A simple yet efficient method is proposed to first Calibrate the Clock Skews of the anchors, and then Estimate the Node Position (CCS-ENP). Finally, Cramer-Rao bounds (CRBs) and simulation results corroborate the efficiency of our localization schemes.
引用
收藏
页码:4397 / 4410
页数:14
相关论文
共 48 条
[1]   A survey on sensor networks [J].
Akyildiz, IF ;
Su, WL ;
Sankarasubramaniam, Y ;
Cayirci, E .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) :102-114
[2]  
[Anonymous], 2007, SECURITY DISTRIBUTED
[3]  
[Anonymous], 2004, Proceedings of International Conference on Embedded Networked Sensor Systems (Sensys), DOI [10.1145/1031495.1031501, DOI 10.1145/1031495.1031501]
[4]  
[Anonymous], 2010, PROC IEEE INT C COMM, DOI DOI 10.1109/ICC.2010.5502319
[5]  
[Anonymous], 2003, Proceedings of the 1st International Conference on Embedded Networks Sensor Systems (SenSys'03), DOI DOI 10.1145/958491.958508
[6]  
[Anonymous], P IEEE ANN WIR MICR
[7]  
Bahl P., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P775, DOI 10.1109/INFCOM.2000.832252
[8]  
Capkun S, 2005, IEEE INFOCOM SER, P1917
[9]   On maximum likelihood estimation of clock offset and skew in networks with exponential delays [J].
Chaudhari, Qasim M. ;
Serpedin, Erchin ;
Qaraqe, Khalid .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (04) :1685-1697
[10]   Attack detection in wireless iocalization [J].
Chen, Yingying ;
Trappe, Wade ;
Martin, Richard P. .
INFOCOM 2007, VOLS 1-5, 2007, :1964-+