Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Approximate medians and other quantiles in one pass and with limited memory
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Random sampling for histogram construction: how much is enough?
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
Proceedings of the 1st international conference on Embedded networked sensor systems
Poster abstract: spatial average of a continuous physical process in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
In-network surface simplification for sensor fields
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Exact distributed Voronoi cell computation in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
A new deterministic data aggregation method for wireless sensor networks
Signal Processing
Sensor Selection for Minimizing Worst-Case Prediction Error
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Segmenting a sensor field: Algorithms and applications in network design
ACM Transactions on Sensor Networks (TOSN)
Fast summation via sampling in large-scale sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Distributed online aggregations
Proceedings of the VLDB Endowment
Estimation of a population size in large-scale wireless sensor networks
Journal of Computer Science and Technology - Special section on trust and reputation management in future computing systmes and applications
A two round reporting approach to energy efficient interpolation of sensor fields
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Distributed and compact routing using spatial distributions in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates broadcast queries to all sensors and use in-network aggregation of responses to minimize messaging costs. In this work, we focus on uniform random sampling across nodes, which can serve both as an alternative building block for aggregation and as an integral component of many other useful randomized algorithms. Prior to our work, the best existing proposals for uniform random sampling of sensors involve contacting all nodes in the network. We propose a practical method which is only approximately uniform, but contacts a number of sensors proportional to the diameter of the network instead of its size. The approximation achieved is tunably close to exact uniform sampling, and only relies on well-known existing primitives, namely geographic routing, distributed computation of Voronoi regions and von Neumann's rejection method. Ultimately our sampling algorithm has the same worst-case asymptotic cost as routing a point-to-point message, and thus it is asymptotically optimal among request/reply-based sampling methods. We provide experimental results demonstrating the effectiveness of our algorithm on both synthetic and real sensor topologies.