Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
From MaRDI portal
(Redirected from Publication:658674)
Recommendations
Cites work
- An Optimal Algorithm for Monte Carlo Estimation
- Complexity measures and decision tree complexity: a survey.
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Decision trees with Boolean threshold queries
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Probabilistic counting algorithms for data base applications
- Probability and Computing
- Ranked set sampling. Theory and applications
- SPINS: Security protocols for sensor networks
- Simple proofs of occupancy tail bounds
- Tail bounds for occupancy and the satisfiability threshold conjecture
Cited in
(8)- The cost of fault tolerance in multi-party communication complexity
- \(\mathrm{REQUEST}^{+}\): a framework for efficient processing of region-based queries in sensor networks
- Linear approaches to resilient aggregation in sensor networks
- A statistics-based sensor selection scheme for continuous probabilistic queries in sensor networks
- A new deterministic data aggregation method for wireless sensor networks
- Secure distributed data aggregation
- An efficient top-\(k\) query processing with result integrity verification in two-tiered wireless sensor networks
- DoS-resilient secure aggregation queries in sensor networks
This page was built for publication: Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658674)
