Efficient fair TDMA scheduling in wireless multi-hop networks

Abstract

Wireless multihop networks have recently been conceived as a networking paradigm. Several algorithms may be found in the literature for scheduling TDMA transmissions for these networks. These algorithms try to determine the optimal scheduling, in order to increase the capacity and reduce the delay for a given network topology. However, to our best knowledge, no TDMA scheduling algorithms have been developed, that take into consideration the traffic requirements of the active flows of the multihop network. At the same time, the fairness of a network is closely related to the scheduling scheme. In this research effort, we propose an intelligent algorithm that can schedule the transmissions in a fair manner, taking into account the communication requirements of the active flows of the network. © 2007 International Federation for Information Processing.