Scalable max-min fairness in wireless ad hoc networks

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 maxmin fair flow assignment, and with that assignment, quality of service guarantees can be achieved for real-time applications. © 2010 ICST Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering.

Cite

CITATION STYLE

APA

Zhou, C., & Maxemchuk, N. F. (2010). Scalable max-min fairness in wireless ad hoc networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 28 LNICST, pp. 79–93). https://doi.org/10.1007/978-3-642-11723-7_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free