dc.creator | Tassiulas, L. | en |
dc.creator | Sarkar, S. | en |
dc.date.accessioned | 2015-11-23T10:49:37Z | |
dc.date.available | 2015-11-23T10:49:37Z | |
dc.date.issued | 2005 | |
dc.identifier | 10.1109/jsac.2004.837365 | |
dc.identifier.issn | 0733-8716 | |
dc.identifier.uri | http://hdl.handle.net/11615/33587 | |
dc.description.abstract | We 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.subject | adaptive | en |
dc.subject | algorithms | en |
dc.subject | matching | en |
dc.subject | maxmin fair | en |
dc.subject | online | en |
dc.subject | scheduling | en |
dc.subject | wireless ad hoc networks | en |
dc.subject | Engineering, Electrical & Electronic | en |
dc.subject | Telecommunications | en |
dc.title | Maxmin fair scheduling in wireless ad hoc networks | en |
dc.type | journalArticle | en |