Cryptographic defense against traffic analysis
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution
Combinatorics, Probability and Computing
Probabilistic Protocols for Fair Communication in Wireless Sensor Networks
Algorithmic Aspects of Wireless Sensor Networks
Analytic Combinatorics
A holistic approach to wireless sensor network routing in underground tunnel environments
Computer Communications
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 paper we study the efficiency of information flooding protocols in various communication networks, and in the presence of random faults. We show big differences between the flooding performance of networks with a seemingly similar structure. Since real-life systems usually consist of a moderate number of devices, the analysis presented in this paper is not limited to the asymptotic behavior of the flooding protocol. Instead, exact formulas are provided whenever possible. The presented results can be useful building blocks for the analysis of other, more sophisticated protocols. In particular, they may be used for planning and analyzing sensors network deployed in an environment subject to communication failures.