Coding theory framework for target location in distributed sensor networks

被引:40
作者
Chakrabarty, K [1 ]
Iyengar, SS [1 ]
Qi, HO [1 ]
Cho, EC [1 ]
机构
[1] Duke Univ, Dept Elect & Comp Engn, Durham, NC 27708 USA
来源
INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, PROCEEDINGS | 2001年
关键词
D O I
10.1109/ITCC.2001.918778
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Distributed real-time sensor networks are essential for effective surveillance in the digitized battlefield and for environmental monitoring. In this paper; we present the first systematic theory that leads to novel sensor deployment strategies for effective surveillance and target location. We represent the sensor field as a grid (two- or three-dimensional) of points (coordinates), and use the term target location to refer to the problem of pin-pointing a target at a grill point at all instant in time. We use the fr framework: of identifying codes to determine sensor placement for unique target location. We provide coding-theoretic bounds on die number of sensors and present methods for determtheir placement in the sensorfield. We also show that sensor placement for single targets provides asymptotically complete (unambiguous) location of multiple targets.
引用
收藏
页码:130 / 134
页数:5
相关论文
共 11 条
[1]   Resource placement in torus-based networks [J].
Bae, MM ;
Bose, B .
IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (10) :1083-1092
[2]  
Brooks R.R., 1998, MULTISENSOR FUSION F
[3]  
Cohen G, 1997, COVERING CODES
[4]  
ESTRIN D, 1999, P ACM IEEE INT C MOB
[5]  
Fujiwara E., 1989, ERROR CONTROL CODING
[6]  
IYENGAR SS, 1995, ADV DISTRIBUTED SENS
[7]  
Kahn J.M., 1999, ACM IEEE INT C MOB C
[8]   On a new class of codes for identifying vertices in graphs [J].
Karpovsky, MG ;
Chakrabarty, K ;
Levitin, LB .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (02) :599-611
[9]   UPPER-BOUNDS FOR Q-ARY COVERING CODES [J].
OSTERGARD, PRJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (03) :660-664
[10]  
QI H, 2001, IN PRESS P IEEE AER