Abstract
Computing and analyzing different types of data generated by a large number of heterogeneous devices have been an important issue demanding prompt solution in the research of Wireless Sensor Networks (WSNs). Due to the restricted computing capability and limited energy of the sensor nodes, this paper investigates the approximate composite event detection problem where composite events are integrated by multi-mode data generated by different types of sensors. Algorithms are proposed to compute 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 formulated and proved to be NP-complete. A dynamic programming based algorithm which runs in pseudo-polynomial time is presented for simple confidence combination operators, and a 2-approximate algorithm is devised for more complex situation. The experimental results demonstrate the effectiveness and efficiency of the proposed algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
