A novel distributed sensor positioning system using the dual of target tracking

被引:66
作者
Zhang, Liqiang [1 ]
Cheng, Qiang [2 ]
Wang, Yingge [3 ]
Zeadally, Sherali [4 ]
机构
[1] Indiana Univ, Dept Comp & Informat Sci, South Bend, IN 46615 USA
[2] Siemens Corp, Siemens Med Solut, Princeton, NJ 08540 USA
[3] Wayne State Univ, Dept Elect & Comp Engn, Detroit, MI 48202 USA
[4] Univ District Columbia, Dept Comp Sci & Informat Technol, Washington, DC 20008 USA
关键词
wireless sensor networks; localization algorithm; Unscented Kalman Filter;
D O I
10.1109/TC.2007.70792
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
As one of the fundamental issues in wireless sensor networks (WSNs), the sensor localization problem has recently received extensive attention. In this work, we investigate this problem from a novel perspective by treating it as a functional dual of target tracking. In traditional tracking problems, static location-aware sensors track and predict the position and/or velocity of a moving target. As a dual, we utilize a moving location assistant (LA) (with a global positioning system (GPS) or a predefined moving path) to help location-unaware sensors to accurately discover their positions. We call our proposed system Landscape. In Landscape, an LA (an aircraft, for example) periodically broadcasts its current location (we call it a beacon) while it moves around or through a sensor field. Each sensor collects the location beacons, measures the distance between itself and the LA based on the received signal strength (RSS), and individually calculates their locations via an Unscented Kalman Filter (UKF)-based algorithm. Landscape has several features that are favorable to WSNs, such as high scalability, no intersensor communication overhead, moderate computation cost, robustness to range errors and network connectivity, etc. Extensive simulations demonstrate that Landscape is an efficient sensor positioning scheme for outdoor sensor networks.
引用
收藏
页码:246 / 260
页数:15
相关论文
共 58 条
[1]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[2]  
[Anonymous], 2000, CUEDFINFENGTR380
[3]  
[Anonymous], P IEEE INFOCOM 03 AP
[4]  
[Anonymous], P IEEE RSJ INT C INT
[5]  
[Anonymous], P 1 ACM INT WORKSH W
[6]  
[Anonymous], P 34 ANN HAW INT C S
[7]  
[Anonymous], 1666 MIT AI LAB
[8]  
[Anonymous], 2004, P IEEE
[9]  
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
[10]  
BISWAS P, 2004, P 3 INT S INF PROC S