Achieving Optimal Throughput Utility and Low Delay With CSMA-Like Algorithms: A Virtual Multichannel Approach

Huang, Po-Kai; Lin, Xiaojun

doi:10.1109/tnet.2014.2301170

Cited by 9 publications

(4 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If no data transmission is detected in the channel, the node will send data immediately at the beginning of the next slot. If data transmission is detected in the channel, the channel is continued to be listened for until it is detected that the channel is idle, and then the data is sent [26, 27]. A 1‐CSMA access control protocol model is illustrated in Fig.…”

Section: Modelling and Simulation Analysis Of Mac Protocol In Vanetmentioning

confidence: 99%

Hardware implementation and performance analysis of MPTD‐CSMA protocol based on field‐programmable gate array in VANET

Ding

et al. 2020

IET Communications

View full text Add to dashboard Cite

Section: Modelling and Simulation Analysis Of Mac Protocol In Vanetmentioning

confidence: 99%

Hardware implementation and performance analysis of MPTD‐CSMA protocol based on field‐programmable gate array in VANET

Ding

et al. 2020

IET Communications

View full text Add to dashboard Cite

“…Optimality for many of these algorithms [ 13 , 23 , 25 , 27 – 29 ] only holds for non-fading channels. In [ 11 ], focus is placed on reducing the delay inherent in many CSMA-based approaches, however once again this is done using non-fading channels. In the analysis presented here, we do not include channel conditions but rather focus on the fundamental behaviour of TO-DCF and on the packet arrival process.…”

Section: Related Workmentioning

confidence: 99%

An analytic model for Throughput Optimal Distributed Coordination Function (TO-DCF)

2017

View full text Add to dashboard Cite

TO-DCF, a new backoff scheme for 802.11, has the potential to significantly increase throughput in dense wireless LANs while also opportunistically favouring nodes with heavier traffic loads and/or better channel conditions. In this paper we present an analytical model to investigate the behaviour and performance of the TO-DCF protocol with regards to operating parameters such as the number of nodes, the contention window size and the backoff countdown probabilities. We then compare numerical results from an implementation of our model with simulations. Our model shows a high level of accuracy, even when the model assumptions are relaxed, and provides guidance for network operators to correctly configure the weight functions for nodes running TO-DCF given the network’s operating conditions.

show abstract

“…Also, the performance of the discrete time version of the algorithm in [6] can be quite poor. The authors in [7] try to address the poor delay performance of CSMA based algorithms by assuming nonfading channels. The authors in [8] and [9] try to develop MW type algorithms for practical 802.11 networks without providing any analytical guarantees.…”

Section: Introductionmentioning

confidence: 99%

Approaching Optimal Centralized Scheduling With CSMA-Based Random Access Over Fading Channels

Karaca

Landfeldt

2016

IEEE Commun. Lett.

View full text Add to dashboard Cite

Abstract-Carrier Sense Multiple Access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput-optimality, these algorithms can either incur large delay and have large complexity or only operate over non-fading channels. In this letter, by assuming arbitrary back-off time we first propose a fully distributed randomized algorithm whose performance can be pushed to the performance of the centralized Max-Weight policy not only in terms of throughput but also in terms of delay for completely-connected interference networks with fading channels. Then, inspired by the proposed algorithm we introduce an implementable distributed algorithm for practical networks with a reservation scheme. We show that the proposed practical algorithm can still achieve the performance of the centralized Max-Weight policy.Index Terms-Max-Weight scheduling, CSMA, queue stability, distributed algorithm, fading channels. I. INTRODUCTIONThe major challenge of channel access management in wireless networks is optimally scheduling users so that interference is eliminated and the maximum performance in terms of throughput, delay, jitter, etc., can be achieved. The centralized Max-Weight algorithm (MW) [1] can achieve maximum throughput, and can stabilize the network. However, due to the huge complexity of MW algorithm Carrier Sense Multiple Access (CSMA) based algorithms have received significant attention from many researchers. In [2], [3], [4] and [5], CSMA based throughput optimal algorithms are developed for nonfading channels, which, however, suffer from either poor delay performance or high complexity. The authors in [6] present an optimal scheduling algorithm for deadline constrained-traffic by assuming continuous back-off time which is impossible to implement, and also the optimality does not hold for practical systems. Also, the performance of the discrete time version of the algorithm in [6] can be quite poor. The authors in [7] try to address the poor delay performance of CSMA based algorithms by assuming nonfading channels. The authors in [8] and [9] try to develop MW type algorithms for practical 802.11 networks without providing any analytical guarantees.In order to be feasible and practical for wireless systems, any CSMA based algorithm should; i-) have low-complexity, and require only local information (no message passing); ii-)

show abstract

Achieving Optimal Throughput Utility and Low Delay With CSMA-Like Algorithms: A Virtual Multichannel Approach

Cited by 9 publications

References 29 publications

Hardware implementation and performance analysis of MPTD‐CSMA protocol based on field‐programmable gate array in VANET

Hardware implementation and performance analysis of MPTD‐CSMA protocol based on field‐programmable gate array in VANET

An analytic model for Throughput Optimal Distributed Coordination Function (TO-DCF)

Approaching Optimal Centralized Scheduling With CSMA-Based Random Access Over Fading Channels

Contact Info

Product

Resources

About