Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
From MaRDI portal
Publication:658674
DOI10.1007/S00446-011-0130-ZzbMATH Open1231.68095OpenAlexW3137008996MaRDI QIDQ658674FDOQ658674
Authors: Haifeng Yu 
Publication date: 6 February 2012
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.5872
Recommendations
Cites Work
- SPINS: Security protocols for sensor networks
- Ranked set sampling. Theory and applications
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Probability and Computing
- Complexity measures and decision tree complexity: a survey.
- Tail bounds for occupancy and the satisfiability threshold conjecture
- Probabilistic counting algorithms for data base applications
- Decision trees with Boolean threshold queries
- Simple proofs of occupancy tail bounds
- An Optimal Algorithm for Monte Carlo Estimation
- Cryptographic Hardware and Embedded Systems - CHES 2004
Cited In (8)
- A new deterministic data aggregation method for wireless sensor networks
- Secure distributed data aggregation
- \(\mathrm{REQUEST}^{+}\): a framework for efficient processing of region-based queries in sensor networks
- A statistics-based sensor selection scheme for continuous probabilistic queries in sensor networks
- Linear approaches to resilient aggregation in sensor networks
- An efficient top-\(k\) query processing with result integrity verification in two-tiered wireless sensor networks
- DoS-resilient secure aggregation queries in sensor networks
- The cost of fault tolerance in multi-party communication complexity
Uses Software
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)
