A distributed semantic filtering model based on approximate automata for heterogeneous multi-sensor networks

Abstract

An increasing number of sensor networks are deployed to collect information on a wide range of applications. However, these sensor networks are isolated to each other. Meanwhile, processing large-scale of data stream is the neck of the push-mode system. To match the huge event stream in heterogeneous sensor network data, we propose approximation semantic factor (ASR), according to which we further propose the approximately semantic matching model for heterogeneous multi-sensor networks called approximately semantic matching model for heterogeneous multi-sensor networks (ASMMN). Furthermore, the evaluate pattern algorithm is put forward. ASMMN can effectively solve the semantic coupling and speed matching. Simulation results show that the proposed model can accelerate the matching process and reduce memory consumption of intermediate states among event streams. Meanwhile, the model has a good scalability that can be widely used in the heterogeneous push-mode sensor networks and internet of things (IOTs).

DOI: 10.1504/IJSNET.2016.074279

10 Figures and Tables

Cite this paper

@article{Wang2016ADS, title={A distributed semantic filtering model based on approximate automata for heterogeneous multi-sensor networks}, author={Tong Wang and Xueling Tao and Yucai Zhou and Pengcheng Li and Chunhui Zhao}, journal={IJSNet}, year={2016}, volume={20}, pages={46-53} }