A distributed CSMA algorithm for wireless networks based on Ising model

Recent studies on queue-length-based randomized link scheduling algorithms have shown their throughput-optimality. But simulation results indicate that the packet delay in such algorithms can be quite large, even when the traffic intensity is low compared with the network capacity. The reason can be traced to the fact that these algorithms need the queues to be sufficiently large before the links have a good chance to be activated for transmission. In this paper, we propose a new randomized scheduling algorithm based on the Ising model in physics. The algorithm does not require queue build-up for link activation and can thus give better delay performance. It is easily implementable in a distributed fashion and it retains throughput-optimality.