A clique-based transformation of the sensing graph yields explicit throughput expressions for CSMA networks with arbitrary topologies via discrete-time Markov renewal processes, without zero-propagation-delay assumptions.
A unified analysis of IEEE 802.11 DCF networks: Stability, throughput, and delay
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
-
Throughput Characterization of Wireless CSMA Networks With Arbitrary Sensing and Interference Topologies
A clique-based transformation of the sensing graph yields explicit throughput expressions for CSMA networks with arbitrary topologies via discrete-time Markov renewal processes, without zero-propagation-delay assumptions.