Show simple item record

dc.creatorTassiulas, L.en
dc.creatorSarkar, S.en
dc.date.accessioned2015-11-23T10:49:37Z
dc.date.available2015-11-23T10:49:37Z
dc.date.issued2005
dc.identifier10.1109/jsac.2004.837365
dc.identifier.issn0733-8716
dc.identifier.urihttp://hdl.handle.net/11615/33587
dc.description.abstractWe investigate from an algorithmic perspective the maxmin fair allocation of bandwidth in wireless ad hoc networks. We formalize the maxmin fair objective under wireless scheduling constraints, and present a necessary and sufficient condition for maxmin fairness of a bandwidth allocation. We propose an algorithm that assigns weights to the sessions dynamically such that the weights depend on the congestion in the neighborhood, and schedules the sessions that constitute a maximum weighted matching. We prove that this algorithm attains the maxmin fair rates, even though it does not use any information about the statistics of the packet arrival process.en
dc.source.uri<Go to ISI>://WOS:000226063100015
dc.subjectadaptiveen
dc.subjectalgorithmsen
dc.subjectmatchingen
dc.subjectmaxmin fairen
dc.subjectonlineen
dc.subjectschedulingen
dc.subjectwireless ad hoc networksen
dc.subjectEngineering, Electrical & Electronicen
dc.subjectTelecommunicationsen
dc.titleMaxmin fair scheduling in wireless ad hoc networksen
dc.typejournalArticleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record