Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Comb Optim

Search In Journal Title:

Abbravation: Journal of Combinatorial Optimization

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1006/bbrc.1996.0596

Search In DOI:

ISSN

1573-2886

Search In ISSN:
Search In Title Of Papers:

Approximate event detection over multimodal sensi

Authors: Jing Gao Jianzhong Li Yingshu Li
Publish Date: 2015/03/10
Volume: 32, Issue: 4, Pages: 1002-1016
PDF Link

Abstract

Composite event detection is one of the fundamental tasks for heterogeneous wireless sensor networks WSNs Multimodal 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 NPcomplete A dynamic programming based algorithm is presented for simple linear confidence combination operators which runs in pseudopolynomial 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:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. A Lagrangian bound for many-to-many assignment problems
  2. New bounds for the balloon popping problem
  3. An exact algorithm for the maximum probabilistic clique problem
  4. A two-stage method for member selection of emergency medical service
  5. Budget-constrained minimum cost flows
  6. On the complexity of partitioning a graph into a few connected subgraphs
  7. Median problems with positive and negative weights on cycles and cacti
  8. The unconstrained binary quadratic programming problem: a survey
  9. Multiple L ( j ,1)-labeling of the triangular lattice
  10. A hybrid algorithm based on variable neighbourhood for the strip packing problem
  11. Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system
  12. Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks
  13. Modified differential evolution with self-adaptive parameters method
  14. Extremal polyomino chains with respect to general Randić index
  15. The weighted link ring loading problem
  16. A new recombination lower bound and the minimum perfect phylogenetic forest problem
  17. Optimization of loss-balanced multicast in all-optical WDM networks
  18. Reconfiguration of dominating sets
  19. Mobile facility location: combinatorial filtering via weighted occupancy
  20. Bounded information dissemination in multi-channel wireless networks
  21. Total coloring of planar graphs without adjacent short cycles
  22. Disjunctive total domination in graphs
  23. A quadratic lower bound for colourful simplicial depth
Search Result: