Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
438345 | Theoretical Computer Science | 2008 | 13 Pages |
Abstract
We propose an algorithm for coordinating access to a shared broadcast channel in an ad hoc network of unknown size n. We reduce the runtime necessary to self-organize access to the channel over the previous algorithm of Cai, Lu and Wang. The runtime of that algorithm is O(n). The goal of our work is to improve the constant factor in this estimation. Apart from the experimental evidence of algorithm quality, we provide a rigorous probabilistic analysis of its behavior.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics