PRISM achieves full topology discovery in single-hop bounded-interference networks in O(L(1+δ)log K) expected rounds with failure probability K^{-δ} and O(L² log K) deterministically via pseudorandom residue-based scheduling.
Packet switching in radio channels: Part i - carrier sense multiple-access modes and their throughput-delay characteristics,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Optimality of Network Topology Discovery in Single-Hop Bounded-Interference Networks
PRISM achieves full topology discovery in single-hop bounded-interference networks in O(L(1+δ)log K) expected rounds with failure probability K^{-δ} and O(L² log K) deterministically via pseudorandom residue-based scheduling.