IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v32y2016i4d10.1007_s10878-015-9847-0.html
   My bibliography  Save this article

Approximate event detection over multi-modal sensing data

Author

Listed:
  • Jing Gao

    (Harbin Institute of Technology)

  • Jianzhong Li

    (Harbin Institute of Technology)

  • Yingshu Li

    (Georgia State University)

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.

Suggested Citation

  • Jing Gao & Jianzhong Li & Yingshu Li, 2016. "Approximate event detection over multi-modal sensing data," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1002-1016, November.
    • Handle: RePEc:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9847-0
    DOI: 10.1007/s10878-015-9847-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9847-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9847-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jing Ai & Alhussein A. Abouzeid, 2006. "Coverage by directional sensors in randomly deployed wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 11(1), pages 21-41, February.
    2. Xiaoming Wang & Qiaoliang Li & Yingshu Li, 2010. "EiSIRS: a formal model to analyze the dynamics of worm propagation in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 20(1), pages 47-62, July.
    3. Weiping Shang & Frances Yao & Pengjun Wan & Xiaodong Hu, 2008. "On minimum m-connected k-dominating set problem in unit disc graphs," Journal of Combinatorial Optimization, Springer, vol. 16(2), pages 99-106, August.
    4. Guangting Chen & Suhui Cui, 2013. "Relay node placement in two-tiered wireless sensor networks with base stations," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 499-508, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Seyed Kazem Alavipanah & Mohammad Karimi Firozjaei & Amir Sedighi & Solmaz Fathololoumi & Saeid Zare Naghadehi & Samiraalsadat Saleh & Maryam Naghdizadegan & Zinat Gomeh & Jamal Jokar Arsanjani & Mohs, 2022. "The Shadow Effect on Surface Biophysical Variables Derived from Remote Sensing: A Review," Land, MDPI, vol. 11(11), pages 1-30, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yishuo Shi & Yaping Zhang & Zhao Zhang & Weili Wu, 2016. "A greedy algorithm for the minimum $$2$$ 2 -connected $$m$$ m -fold dominating set problem," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 136-151, January.
    2. Tian Liu & Zhao Lu & Ke Xu, 2015. "Tractable connected domination for restricted bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 247-256, January.
    3. Yi Hong & Deying Li & Donghyun Kim & Wenping Chen & Jiguo Yu & Alade O. Tokuta, 2017. "Maximizing target-temporal coverage of mission-driven camera sensor networks," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 279-301, July.
    4. Samer Hanoun & Asim Bhatti & Doug Creighton & Saeid Nahavandi & Phillip Crothers & Celeste Gloria Esparza, 2016. "Target coverage in camera networks for manufacturing workplaces," Journal of Intelligent Manufacturing, Springer, vol. 27(6), pages 1221-1235, December.
    5. Ran Bi & Jianzhong Li & Hong Gao & Yingshu Li, 2016. "$$(\alpha , \tau )$$ ( α , τ ) -Monitoring for event detection in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 985-1001, November.
    6. Chen Liao & Shiyan Hu, 2010. "Polynomial time approximation schemes for minimum disk cover problems," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 399-412, November.
    7. Rossi, André & Singh, Alok & Sevaux, Marc, 2013. "Lifetime maximization in wireless directional sensor network," European Journal of Operational Research, Elsevier, vol. 231(1), pages 229-241.
    8. Tu-Liang Lin & Sheng-Lin Li & Hong-Yi Chang, 2016. "A Power Balance Aware Wireless Charger Deployment Method for Complete Coverage in Wireless Rechargeable Sensor Networks," Energies, MDPI, vol. 9(9), pages 1-13, August.
    9. Zhao Zhang & Jiao Zhou & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du, 2018. "Computing Minimum k -Connected m -Fold Dominating Set in General Graphs," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 217-224, May.
    10. Yan Zhang & Hongzhi Wang & Hong Gao & Jianzhong Li, 2016. "Efficient accuracy evaluation for multi-modal sensed data," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1068-1088, November.
    11. Yaoyao Zhang & Zhao Zhang & Ding-Zhu Du, 2023. "Construction of minimum edge-fault tolerant connected dominating set in a general graph," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-12, March.
    12. Korsnes, Reinert, 2010. "Rapid self-organised initiation of ad hoc sensor networks close above the percolation threshold," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(14), pages 2841-2848.
    13. Wu, Yanqing & Pu, Cunlai & Zhang, Gongxuan & Li, Lunbo & Xia, Yongxiang & Xia, Chengyi, 2023. "Epidemic spreading in wireless sensor networks with node sleep scheduling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 629(C).
    14. Jiao Zhou & Zhao Zhang & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du, 2018. "Breaking the O (ln n ) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 225-235, May.
    15. Wen Jiang & Zeyu Ma & Xinyang Deng, 2019. "An attack-defense game based reliability analysis approach for wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 15(4), pages 15501477198, April.
    16. Jiao Zhou & Zhao Zhang & Weili Wu & Kai Xing, 2014. "A greedy algorithm for the fault-tolerant connected dominating set in a general graph," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 310-319, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9847-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.