Amplified Pruning and Path Selectors for Deterministic Radio Gossiping

Qin Xin

We study deterministic gossiping in unknown strongly connected directed radio networks with $n$ vertices, $m$ arcs, and distinct identifiers in $[N]$, where $N=n^{\mathcal{O}(1)}$.…