Scheduling management in wireless mesh networks

Abstract

We propose a greedy algorithm to investigate the problem of how to schedule of a set of feasible transmissions under physical interference model. We also consider the fairness in scheduling to prevent some border nodes from starvation. We evaluate our algorithm through extensive simulation and the results show that our algorithm can achieve better aggregate throughput and fairness performance than 802.11 standard. © Springer-Verlag Berlin Heidelberg 2007.