Mostrar el registro sencillo del ítem

dc.contributor.authorZhou, Congzhou
dc.contributor.authorMaxemchuk, Nicholas F. 
dc.date.accessioned2021-07-13T09:41:02Z
dc.date.available2021-07-13T09:41:02Z
dc.date.issued2011-03
dc.identifier.issn1570-8705
dc.identifier.urihttp://hdl.handle.net/20.500.12761/783
dc.description.abstractOur 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.
dc.publisherElsevier
dc.subject.lccQ Science::Q Science (General)
dc.subject.lccQ Science::QA Mathematics::QA75 Electronic computers. Computer science
dc.subject.lccT Technology::T Technology (General)
dc.subject.lccT Technology::TA Engineering (General). Civil engineering (General)
dc.subject.lccT Technology::TK Electrical engineering. Electronics Nuclear engineering
dc.titleScalable max–min fairness in wireless ad hoc networks
dc.typejournal article
dc.journal.titleAd Hoc Networks
dc.volume.number9
dc.issue.number2
dc.identifier.urlhttp://dx.doi.org/10.1016/j.adhoc.2010.03.004
dc.identifier.doihttp://dx.doi.org/10.1016/j.adhoc.2010.03.004
dc.page.final119
dc.page.initial112
dc.description.refereedTRUE
dc.description.statuspub
dc.eprint.idhttp://eprints.networks.imdea.org/id/eprint/209


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem