Scheduling for distributed sensor networks with single sensor measurement per time step

被引：12
作者：
Chung, TH [1 ]
Gupta, V [1 ]
Hassibi, B [1 ]
Burdick, J [1 ]
Murray, RM [1 ]
机构：
[1] CALTECH, Div Engn & Appl Sci, Pasadena, CA 91125 USA
来源：
2004 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1- 5, PROCEEDINGS | 2004年
关键词：
D O I：
10.1109/ROBOT.2004.1307149
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We examine the problem of distributed estimation when only one sensor can take a measurement per time step. We solve for the optimal recursive estimation algorithm when the sensor switching schedule is given. We then consider the effect of noise in communication channels. We also investigate the problem of determining an optimal sensor switching strategy. We see that this problem involves searching a tree in general and propose two strategies for pruning the tree to minimize the computation. The first is a sliding window strategy motivated by the Viterbi algorithm, and the second one uses thresholding. The performance of the algorithms is illustrated using numerical examples.
引用
收藏
页码：187 / 192
页数：6
相关论文
共 21 条
[1]  
Bar-Shalom Yaakov., 1993, ESTIMATION TRACKING
[2]  
Dhillon SS, 2002, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON INFORMATION FUSION, VOL II, P1581, DOI 10.1109/ICIF.2002.1021005
[3]  
ESTRIN D, 1999, P 5 ANN INT C MOB CO
[4]   VITERBI ALGORITHM [J].
FORNEY, GD .
PROCEEDINGS OF THE IEEE, 1973, 61 (03) :268-278
[5]  
GUPTA V, 2004, UNPUB INFORMATON PRO
[6]  
HWANG YK, 1992, COMPUT SURV, V24, P219, DOI 10.1145/136035.136037
[7]  
KAHN J, 1999, P AC MOB C SEATTL WA
[8]  
Kailath T, 2000, PR H INF SY, pXIX
[9]  
KARL H, 2002, ESF WORKSH LA SPEZ I
[10]  
Lincoln B, 2002, IEEE T AUTOMAT CONTR, V47, P1701, DOI 10.1109/TAC.2002.803509
123