# An Efficient Randomized Routing Protocol for Single-Hop Radio Networks

##### Citations

8 citations

3 citations

### Cites background from "An Efficient Randomized Routing Pro..."

...In [23], the authors present a randomized algorithm for the permutation routing that takes 3n k + O( n k ) broadcast rounds with high probability....

[...]

1 citations

### Cites background from "An Efficient Randomized Routing Pro..."

...Much of the theoretical foundation is proposed to describe the single-hop network with single channel for cognitive radio network [11], where a cognitive radio communication network routing policy with single channel was proposed [12]....

[...]

##### References

[...]

6,991 citations

3,760 citations

### "An Efficient Randomized Routing Pro..." refers methods in this paper

...An application of Chernoff bounds shows that s = m 2 + õ(m)....

[...]

...The following three facts (known as Chernoff bounds) will be used in the paper (and were discovered by Chernoff [3] and Angluin & Valiant [1]): Prob [X ≥ m] ≤ (np m )m em−np,...

[...]

...One of the most frequently used facts in analyzing randomized algorithms is Chernoff bounds....

[...]

...The following three facts (known as Chernoff bounds) will be used in the paper (and were discovered by Chernoff [3] and Angluin & Valiant [1]): Prob [X ≥ m] ≤ (np m )m em−np, Prob [X ≥ (1 + )np] ≤ exp(− 2np/3), and Prob [X ≤ (1− )np] ≤ exp(− 2np/2), for any 0 < < 1, and m > np....

[...]

1,695 citations

1,610 citations

### "An Efficient Randomized Routing Pro..." refers background in this paper

...For the selection problem, it is known that the maximum or minimum element can be found in O(log n) rounds on a RN(n, 1), provided broadcast conflicts can be resolved in O(1) time....

[...]

694 citations

### "An Efficient Randomized Routing Pro..." refers background in this paper

...Likewise if one wants to use the two-phase randomized routing scheme of Valiant [19] at least 2 k broadcast rounds will be needed....

[...]

...Likewise if one wants to use the two-phase randomized routing scheme of Valiant [19] at least 2n k broadcast rounds will be needed....

[...]

...The following three facts (known as Chernoff bounds) will be used in the paper (and were discovered by Chernoff [3] and Angluin & Valiant [1]): Prob [X ≥ m] ≤ (np m )m em−np, Prob [X ≥ (1 + )np] ≤ exp(− 2np/3), and Prob [X ≤ (1− )np] ≤ exp(− 2np/2), for any 0 < < 1, and m > np....

[...]