(, )-monitoring for event detection in wireless sensor networks
From MaRDI portal
Publication:346476
DOI10.1007/S10878-015-9837-2zbMATH Open1355.90016OpenAlexW2079747752MaRDI QIDQ346476FDOQ346476
Hong Gao, Yingshu Li, Jianzhong Li, Ran Bi
Publication date: 29 November 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9837-2
Reliability, availability, maintenance, inspection in operations research (90B25) Communication networks in operations research (90B18)
Cites Work
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- Probability and Computing
- Computing and Combinatorics
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem
- Arithmetic-geometric mean and related inequalities for operators
- Algorithms for distributed functional monitoring
- Dispatching design for storage-centric wireless sensor networks
- Relay node placement in two-tiered wireless sensor networks with base stations
- Learning from Data Streams
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Fault tolerant multiple event detection in a wireless sensor network π π
- Sensor Selection for Event Detection in Wireless Sensor Networks π π
- Event Detection in Wireless Sensor Networks in Random Spatial Sensors Deployments π π
This page was built for publication: \((\alpha,\tau )\)-monitoring for event detection in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346476)