Concurrent Transmission Scheduling with Time-Limited Traffic in Wireless Mesh Networks

Due to discontinuity of traffic, traffic distribution strategy in each intermediate node and each flow´s state before transmission should be considered in non-full load wireless mesh networks when scheduling. In this paper, an activeness-labelled concurrent transmission method with unselfish traffic distribution is designed to enlarge throughput in non-full load wireless mesh networks. Firstly, the radio based model used in this paper is presented and flow relationship is obtained through graph transformation. Secondly, with the introduction of scenario concept, the problem of maximizing throughput is equal to satisfying all the flows with the least scenarios. Then a flow label is designed to denote each flow´s state and an unselfish traffic distribution strategy based on game theory is proposed. Furthermore, a greedy concurrent transmission algorithm for scenario construction is proposed to schedule the available flows. At last, the simulation results demonstrate that the system throughput can be enhanced efficiently and Nash Equilibrium can be achieved by using the algorithm proposed in this paper.