Efficient Matching of Multi-Modal Sensing Nodes for Collaborative Sense Optimization of Composite Events

Composite events are sense maximizes collaboration through multiple sensors. Efficient matching of multi-modal sensing nodes in multi-composite events is always a thorny problem. In this paper, the composite event sensing model is first proposed, and then the collaborative-sense problem of multi-modal sensing nodes is translated into a binary matching problem. For these multi-class sensors and multi-class compound events scene, a pruning-grafting and parallel strategy be adopted, which can speed up the traversal speed and find the maximum matching edge quickly. For multi-nodes selection, the distance of the composite event constraints into binarily weighted matching. A collaborative-sense intelligent matching algorithm is suggested. It takes collaborative in various kinds of nodes matching combining with the distribution of the composite event itself around the nodes. Combined with the random distribution of various sensor nodes and composite events, the matching rate of some sensor nodes is sacrificed for the overall event efficiency. Compare to parallel algorithms, it has another effect on perceived efficiency. Finally, by comparing with other algorithms, CSSMA and other proposed algorithms have a certain advantage in the inclusive sense efficiency. In terms of composite events collaborative-sense, this work has nice theoretical significance and practical value.