| dc.contributor |
John Guttag. |
|
| dc.contributor |
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. |
|
| dc.contributor |
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. |
|
| dc.creator |
Tan, Godfrey, 1975- |
|
| dc.date |
2007-02-21T11:59:12Z |
|
| dc.date |
2007-02-21T11:59:12Z |
|
| dc.date |
2006 |
|
| dc.date |
2006 |
|
| dc.date.accessioned |
2022-05-04T06:27:36Z |
|
| dc.date.available |
2022-05-04T06:27:36Z |
|
| dc.identifier |
http://hdl.handle.net/1721.1/36185 |
|
| dc.identifier |
74907459 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/3015 |
|
| dc.description |
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006. |
|
| dc.description |
Includes bibliographical references (p. 159-166). |
|
| dc.description |
A distributed medium access control (MAC) protocol is responsible for allocating the shared spectrum efficiently and fairly among competing devices using a wireless local area network. Unfortunately, existing MAC protocols, including 802.11's DCF, achieve neither efficiency nor fairness under many realistic conditions. In this dissertation, we show that both bit and frame-based fairness,the most widely used notions, lead to drastically reduced aggregate throughput and increased average delay in typical environments, in which competing nodes transmit at different data transmission rates. We demonstrate the advantages of time-based fairness, in which each competing node receives an equal share of the wireless channel occupancy time. Through analysis, experiments on a Linux test bed, and simulation, we demonstrate that time-based fairness can lead to significant improvements in aggregate throughput and average delay. Through a game theoretic analysis and simulation, we also show that existing MAC protocols encourage non-cooperative nodes to employ globally inefficient transmission strategies that lead to low aggregate throughput. We show that providing long-term time share guarantees among competing nodes leads rational nodes to employ efficient transmission strategies at equilibriums. |
|
| dc.description |
(cont.) We describe two novel solutions, TES (Time-fair Efficient and Scalable MAC protocol) and TBR (Time-based Regulator) that provide time-based fairness and long-term time share guarantees among competing nodes. TBR is a backward-compatible centralized solution that runs at the AP,works in conjunction with DCF, and requires no modifications to clients nor to DCF. TBR is appropriate for existing access point based networks, but not effective when nearby non-cooperative nodes fall under different administrative domains. Our evaluation of TBR on an 802.1lb/Linux test bed shows that TBR can improve aggregate TCP throughput by as much as 105% in rate diverse environments. TES is a non-backward compatible distributed contention-based MAC protocol that is effective in any environment, including non-cooperative environments. Furthermore, the aggregate throughputs sustained with increased loads. Through extensive simulation experiments, we demonstrate that TES is significantly more efficient(as much as 140% improvement in aggregate TCP throughput) and fairer than existing MAC protocols including DCF. |
|
| dc.description |
by Godfrey Tan. |
|
| dc.description |
Ph.D. |
|
| dc.format |
173 p. |
|
| dc.format |
application/pdf |
|
| dc.language |
eng |
|
| dc.publisher |
Massachusetts Institute of Technology |
|
| dc.rights |
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. |
|
| dc.rights |
http://dspace.mit.edu/handle/1721.1/7582 |
|
| dc.subject |
Electrical Engineering and Computer Science. |
|
| dc.title |
Improving aggregate user utilities and providing fairness in multi-rate wireless LANs |
|
| dc.type |
Thesis |
|