A High-Order Markov-Chain-Based Scheduling Algorithm for Low Delay in CSMA Networks

Abstract

Recently, several CSMA algorithms based on the Glauber dynamics model have been proposed for wireless link scheduling, as viable solutions to achieve the throughput optimality, yet simple to implement. However, their delay performance still remains unsatisfactory, mainly due to the nature of the underlying Markov chains that imposes a fundamental constraint on how the link state can evolve over time. In this paper, we propose a new approach toward better queueing delay performance, based on our observation that the algorithm needs not be Markovian, as long as it can be implemented in a distributed manner. Our approach hinges upon utilizing past state information observed by local link and then constructing a high-order Markov chain for the evolution of the feasible link schedules. We show that our proposed algorithm, named delayed CSMA, achieves the throughput optimality, and also provides much better delay performance by effectively "decorrelating" the link state process (and thus resolves link starvation). Our simulation results demonstrate that the delay under our algorithm can be reduced by a factor of 20 in some cases, compared to the standard Glauber-dynamics-based CSMA algorithm.Index Terms-Carrier sense multiple access (CSMA), Markov chain, scheduling algorithms, wireless networks. 1063-6692

A Temporal Adaptive Access Mechanism for Data Fusion in an IoT Environment

“…On the other hand, some research has been done for improving CSMA delay performance. For example, the delayed CSMA scheme proposed in [29] utilized past state information observed by a local link to construct a high-order Markov chain for the evolution of the feasible link schedules. The algorithm developed in [30] applied quadratic Lyapunov functions in conjunction with the Lindley equation and Azuma’s inequality for obtaining an exponential decaying property in certain queueing dynamics.…”

MICE: Algoritmo de escalonamento para redes sem fio baseado no modelo antiferromagnético de Ising

“…O algoritmo para escalonar enlaces em redes sem fioé de muita importância, e um bom algoritmo deve não somente alcançar alta vazão com baixa latência, como deve também ser simples. Pela lei de Little, a vazão e a latência estão relacionadas com o tamanho da fila do enlace e recentemente algoritmos onde a probabilidade de um enlace ser escalonado depende do tamanho de sua fila vem ganhando destaque [Wang and Xia 2017a, Ni et al 2010, Jiang et al 2012, Kwak et al 2016, Xue et al 2017. A alta vazãó e alcançada quando o algoritmo consegue estabilizar as filas para todas as taxas de chegada dentro da região de capacidade da rede.…”

Convergence of a transition probability tensor of a higher‐order Markov chain to the stationary probability vector

“…Some part of this widespread application of the first-order Markov chains owes to its well-developed theory [7], the kind of development that has not yet happened for higher-order Markov chains, and using higher-order Markov chains involved approximating them by first-order Markov chains [8][9][10]. Also, higher-order Markov chains have been applied in many different backgrounds such as computer science [11,12], meteorology [13], image processing [14] and genetics [8]. On the other hand, studying tensors from a linear algebraic point of view has become a new trend for researchers in recent years [15].…”