Throughput Characterization of Wireless CSMA Networks With Arbitrary Sensing and Interference Topologies
Xinghua Sun, Wenhai Lin, Ruike Zhou

TL;DR
This paper introduces a new analytical framework for accurately characterizing throughput in wireless CSMA networks with complex sensing and interference topologies, overcoming previous limitations.
Contribution
It develops an explicit throughput analysis method that accounts for arbitrary topologies without zero-delay assumptions, using clique structures and Markov renewal processes.
Findings
Framework provides explicit throughput expressions for complex topologies.
Simulation shows improved accuracy over existing models in dense and strongly coupled networks.
Analysis applies to various scenarios including IEEE 802.11 networks and ad-hoc topologies.
Abstract
The performance analysis of wireless CSMA networks is notoriously difficult due to the intricate sensing and interference relationships among links. Even the fundamental problem of throughput characterization remains open when sensing and interference topologies are both arbitrary. In this paper, we develop a new analytical framework for throughput characterization in wireless CSMA networks with arbitrary sensing and interference topologies. The proposed framework yields explicit throughput expressions without relying on the commonly adopted zero-propagation-delay assumption. The key idea is to exploit the clique structure of the sensing graph to transform the original CSMA network into an equivalent multi-channel network, and then model its dynamics through a discrete-time Markov renewal process. In this way, the framework explicitly captures global coupling among links and enables…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
