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 max-min fair flow assignment, and with that assignment,
quality of service guarantees can be achieved for real-time applications.
|
Year | DOI | Venue |
---|---|---|
2011 | 10.1016/j.adhoc.2010.03.004 | Ad Hoc Networks |
Keywords | Field | DocType |
mobile environment,quality of service,max-min fair rate allocation,scalability,service guarantee,macro model,previous work,max–min fairness,access control,good max-min fair flow,proposed scheme,new method,real-time application,scalable max-min fairness,wireless ad hoc network,max min fairness | Mobile ad hoc network,Max-min fairness,Computer science,Computer network,Quality of service,Ad hoc wireless distribution service,Adaptive quality of service multi-hop routing,Optimized Link State Routing Protocol,Wireless ad hoc network,Vehicular ad hoc network,Distributed computing | Journal |
Volume | Issue | ISSN |
9 | 2 | Ad Hoc Networks |
Citations | PageRank | References |
5 | 0.50 | 17 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Congzhou Zhou | 1 | 9 | 1.94 |
N. F. Maxemchuk | 2 | 793 | 387.48 |