A Distributed Transmission Scheduling Algorithm for Wireless Networks Based on the Ising Model

Message scheduling in wireless networks addresses the question of which links should transmit at what time, in order to maximize the transmitting data volume without interference. Many algorithms have been proposed to solve this problem, both centralized and distributed. The distributed approach is more attractive since the networks usually lack a centralized processor. Aiming to solve the message scheduling problem for wireless networks, in this paper, we present a fully distributed scheduling policy based on the Ising model.