Adaptive CSMA scheduling algorithm for queuing delay enhancement and energy optimization

Abstract

This paper proposes an adaptive carrier sense multiple access (CSMA) algorithm for link scheduling in a network of conflict graph structures. The algorithm optimizes throughput and brings the queue size of packets at a node close to zero as it makes the average service rate strictly larger than the arrival rate of packets. It also minimizes energy consumption of the node owing to the incorporation of sleep–wake up strategy when attempting to access the physical medium. This CSMA scheme utilizes a simple subgradient descent algorithm to obtain its inherent parameters for each node in an iterative and distributed manner. The conducted numerical results corroborate the superiority of the developed CSMA over the state-of-art schedulers in terms of transmission rate, queue length and energy saving.