v(t) CSMA: a link scheduling algorithm in wireless networks with improved delay characteristics

Authors:
Ahmed Elbagoury;Moustafa Youssef;Dongyue Xue;Eylem Ekici
Affiliations:
Wireless Research Center, Alexandria University & E-JUST, Alexandria, Egypt;Wireless Research Center, Alexandria University & E-JUST, Alexandria, Egypt;Department of Electrical and Computer Engineering, the Ohio State University, USA, Ohio, USA;Department of Electrical and Computer Engineering, the Ohio State University, USA, Ohio, USA
Venue:
Proceedings of the 19th annual international conference on Mobile computing & networking
Year:
2013

Citing 1
Cited 0

Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient scheduling of wireless resources has always been one of the most challenging tasks for wireless networks. To achieve throughput-optimality, traditional back-pressure algorithms calculate a maximal weight matching at each time slot. However, these algorithms need centralized scheduling with high complexity, and thus are not suitable for practical distributed implementations. A class of distributed queue-length-based CSMA algorithms have been proposed that achieve throughput optimality, which we refer to as regular throughput-optimal. These algorithms suffer from two problems: large delays, and temporal starvation. In this demo we demonstrate the operation of the v(t)-regulated CSMA algorithm that mitigates these two problems while provably retaining throughput optimality. The demo allows the participants to see the the performance advantage of v(t)-regulated CSMA over queue-length-based CSMA algorithms and change the different system parameters.