Approximate event detection over multi-modal sensing data |
| |
Authors: | Jing Gao Jianzhong Li Yingshu Li |
| |
Affiliation: | 1.Department of Computer Science and Technology,Harbin Institute of Technology,Harbin,China;2.Department of Computer Science,Georgia State University,Atlanta,USA |
| |
Abstract: | Composite event detection is one of the fundamental tasks for heterogeneous wireless sensor networks (WSNs). Multi-modal data generated by heterogeneous sensors bring new challenges for composite event monitoring in heterogeneous WSNs. By exploiting the correlations between different types of data, the approximate composite event detection problem is investigated in this paper. The optimal transmitting scheme problem is proposed to calculate the optimal transmitting scheme with minimum cost on the constraint that the confidence of the composite event must exceed the threshold. The optimal transmitting scheme problem is proved to belong to NP-complete. A dynamic programming based algorithm is presented for simple linear confidence combination operators, which runs in pseudo-polynomial time. The greedy based approximate algorithm is also designed for general confidence combination operators and the approximate ratio is proved to be 2 for “+” as the confidence combination operator. The simulation results show that our algorithms can reduce energy consumption significantly. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|