Throughput Enhancement Scheduling in Non-Full Load Wireless Mesh Networks

Abstract£ºIn non-full load wireless mesh networks, the discontinuity of traffic can significantly adversely affect the performance of entire network. The object of this paper is to provide an efficient solution of the resource waste caused by the time-limited traffic, using activeness-labelled link scheduling and unselfish flow selection. Firstly, based on the network, link scheduling problem is converted to link group construction and maximizing network throughput is equal to satisfying all the links with the least timeslots. Secondly, a link label is designed to denote each link¡¯s current state and an unselfish flow selection strategy conforming to game theory is proposed. Then a greedy concurrent transmission algorithm is proposed to schedule the available links. At last, the simulation results demonstrate that the system throughput can be enhanced efficiently and Nash Equilibrium can be achieved by using the method proposed in this paper.