Interacting particle-based model for missing data in sensor networks: Foundations and applications

被引:0
作者
Koushanfar, Farinaz [1 ]
Kiyavash, Negar [2 ]
Potkonjak, Miodrag [3 ]
机构
[1] Rice Univ, ECE Dept, Houston, TX 77251 USA
[2] Univ Illinois, ECE Dept, Champaign, IL USA
[3] Univ Calif Los Angeles, Dept CS, Los Angeles, CA USA
来源
2006 IEEE SENSORS, VOLS 1-3 | 2006年
关键词
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Missing data is unavoidable in sensor networks due to sensor faults, communication malfunctioning and malicious attacks. There is a very little insight in missing data causes and statistical and pattern properties of missing data in collected data streams. To address this problem, we utilize interacting-particle model that takes into account both patterns of missing data at individual sensor data streams as well as the correlation between occurrence of missing data at other sensor data streams. The model can be used in algorithms and protocols for energy efficient data collection and other tasks in presence of missing data. We use statistical intersensor models for predicting the readings of different sensors. As a driver application, we address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while we guarantee that values of nodes in the sleep mode can be recovered from the awake nodes within a user's specified error bound and probability of missing data at awake nodes is less than a given threshold. The sleeping coordination is addressed by creating the maximal number of subgroups of disjoint nodes, each of whose data is sufficient to recover the data of the entire network in presence of missing data. On simulated and actually collected data for temperature and humidity sensors in Intel Berkeley Lab, we show that by using sleeping coordination that considers missing data, we reduce the typical 40% missing data rate of traditional sleeping techniques to less than 7%.
引用
收藏
页码:888 / +
页数:2
相关论文
共 10 条
  • [1] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
  • [2] Cerpa A, 2005, 2005 FOURTH INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING IN SENSOR NETWORKS, P81
  • [3] Durrett R., 1988, LECT NOTES PARTICLE
  • [4] Feige U, 2003, SIAM J COMPUT, V32, P172
  • [5] Friedman J., 2001, The elements of statistical learning, V1, DOI DOI 10.1007/978-0-387-21606-5
  • [6] A dynamic operating system for sensor nodes
    Han, CC
    Kumar, R
    Shea, R
    Kohler, E
    Srivastava, M
    [J]. PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON MOBILE SYSTEMS, APPLICATIONS, AND SERVICES (MOBISYS 2005), 2005, : 163 - 176
  • [7] KOUSHANFAR F, 2005, SLEEPING COORDINATIO
  • [8] EVIDENCE FOR A NEW PHASE IN THE DOMANY-KINZEL CELLULAR AUTOMATON
    MARTINS, ML
    DERESENDE, HFV
    TSALLIS, C
    DEMAGALHAES, ACN
    [J]. PHYSICAL REVIEW LETTERS, 1991, 66 (15) : 2045 - 2047
  • [9] Energy-aware wireless microsensor networks
    Raghunathan, V
    Schurgers, C
    Park, S
    Srivastava, MB
    [J]. IEEE SIGNAL PROCESSING MAGAZINE, 2002, 19 (02) : 40 - 50
  • [10] RAJENDRAN V, 2003, SENSYS, P181