Scalable max–min fairness in wireless ad hoc networks

Our previous work proposes a macro model to perform flow and access control in wireless ad hoc networks. In this paper, we demonstrate specifically how to apply the model to achieve max–min fair rate allocation. Our proposed scheme is simple and scalable when comparing to other techniques in the literature. Moreover, it has the ability to provide stability in mobile environment. Simulation results show that our new method provides a good max–min fair flow assignment, and with that assignment, quality of service guarantees can be achieved for real-time applications.