Loading [a11y]/accessibility-menu.js
VQ-CSMA: Throughput-Optimal Low-Delay Random Access | IEEE Journals & Magazine | IEEE Xplore

VQ-CSMA: Throughput-Optimal Low-Delay Random Access


Abstract:

Queue based carrier-sense multiple access (Q-CSMA) is designed to ensure throughput optimality in wireless networks, where the access probability depends on the local que...Show More

Abstract:

Queue based carrier-sense multiple access (Q-CSMA) is designed to ensure throughput optimality in wireless networks, where the access probability depends on the local queue length information. However, some links may be long-term blocked if their neighbors continuously occupy the channel, which is called starvation and leads to poor delay performance. In this letter, to deal with the starvation problem, we construct a neighbor-aware virtual queue system, which considers not only the local queue lengths but also the neighbors’ queue lengths. In the virtual queue system, we design a new Lyapunov function and derive a virtual queue based CSMA (VQ-CSMA) algorithm. With the presence of negative virtual queues, we discuss four cases of virtual queues and prove that VQ-CSMA achieves throughput optimality by analyzing the corresponding maximum-weight scheduling. The simulation results demonstrate that VQ-CSMA alleviates the starvation problem and consequently leads to a better delay performance compared to existing Q-CSMA.
Published in: IEEE Wireless Communications Letters ( Volume: 11, Issue: 6, June 2022)
Page(s): 1303 - 1307
Date of Publication: 05 April 2022

ISSN Information:

Funding Agency:


References

References is not available for this document.