Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
A linear-time probabilistic counting algorithm for database applications
ACM Transactions on Database Systems (TODS)
Counting Distinct Elements in a Data Stream
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Note: Order statistics and estimating cardinalities of massive data sets
Discrete Applied Mathematics
On alarm protocol in wireless sensor networks
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
On message complexity of extrema propagation techniques
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
| Hi-index | 0.00 |
In this article we address the problem of estimating a size of wireless sensor networks (WSNs). We restrict our attention to sensors with very limited storage capabilities. The problem arises when sensors have to quickly obtain approximate size of the network to use algorithms which require such information. Another application area is the problem of counting the number of different objects (e.g. people in public bus transportation) and use of such information to optimize the routes and frequency of buses. In this paper we present two-phase probabilistic algorithm based on order statistics and balls-bins model which effectively solves the presented problem.