Shaoliang Peng
- Dimakis, A. Sarwate, A. Wainwright, and M.J., "Geographic gossip: efficient aggregation for sensor networks," in IPSN, 2006. Google Scholar
Digital Library
- Y. Wang, J. Gao, and J. Mitchell, "Boundary recognition in sensor networks by topological methods," in MOBICOM, 2006. Google ScholarDigital Library
- L. Massoulie, E.L. Merrer, A. Kermarrec, and A. Ganesh, "Peer counting and sampling in overlay networks: Random walk methods," in PODC, 2006. Google ScholarDigital Library
- S. Gandhi, S. Suri, and E. Welzl, "Catching elephants with mice: sparse sampling for monitoring sensor networks," in SenSys, 2007. Google ScholarDigital Library
- B.A. Bash and P.J. Desnoyers, "Exact distributed voronoi cell computation in sensor networks," in IPSN, 2007. Google ScholarDigital Library
- T. He, J.A. Stankovic, C. Lu, and T.F. Abdelzaher, "Speed: A stateless protocol for real-time communication in ad hoc sensor networks," in ICDCS, 2003. Google ScholarDigital Library
- B.A. Bash, J.W. Byers, and J. Considine, "Approximately uniform random sampling in sensor networks," in DMSN, 2004. Google ScholarDigital Library
- S. Peng, S. Li, G. Xing, and W. Jia, "Fish a lake: Fast release/capture sampling in large-scale sensor networks," City University of Hong Kong, Tech. Rep., 2008.Google Scholar
- Z. Govindarajulu, Elements of Sampling Theory and Methods. New York: Prentice Hall, 1999.Google Scholar
- W.W. Terpstra, C. Leng, and A.P. Buchmann, "Practical summation via gossip," in PODC, 2007. Google ScholarDigital Library
- D. Mosk-Aoyama and D. Shah, "Computing separable functions via gossip," in PODC, 2006. Google ScholarDigital Library
Index Terms
- Fast summation via sampling in large-scale sensor networks
Recommendations
Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
Wireless sensor networks are often queried for aggregates such as predicate count, sum, and average. In untrusted environments, sensors may potentially be compromised. Existing approaches for securely answering aggregation queries in untrusted sensor ...
Fast balanced sampling for highly stratified population
Balanced sampling is a very efficient sampling design when the variable of interest is correlated to the auxiliary variables on which the sample is balanced. A procedure to select balanced samples in a stratified population has previously been proposed. ...
Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
IPSN '09: Proceedings of the 2009 International Conference on Information Processing in Sensor NetworksWireless sensor networks are often queried for aggregates such as predicate count, sum, and average. In untrusted environments, sensors may potentially be compromised. Existing approaches for securely answering aggregation queries in untrusted sensor ...
Comments