Name
Abstract | ||
|---|---|---|
Large-scale Enterprise WLANs are amenable to centralized control and coordination through the wired backbone for improved performance. Distributed scheduling algorithms either fail to achieve high performance in real deployments due to their myopic view of interference characteristics, or take significant time to converge to a globally optimal solution. Thus, they are not reactive to current network conditions. Centralized packet scheduling algorithms do not suffer from the performance limitations of distributed approaches, but are non-trivial to implement. Tight time synchronization requirements make proposed centralized schemes difficult to use in practice. This paper proposes Relative Scheduling: a technique for triggering wireless transmissions through other wireless transmissions in a domino-like fashion, thus making tight time synchronization unnecessary. Through USRP experiments and trace-driven simulations, we show that our approach can achieve up to 1.96× the throughput of Distributed Coordination Function (DCF). |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2535372.2535401 | CoNEXT |
Keywords | Field | DocType |
centralized scheme,tight time synchronization requirement,wireless transmission,relative scheduling,centralized control,improved performance,tight time synchronization,enterprise wireless lans,high performance,centralized packet scheduling algorithm,significant time,performance limitation | Wireless,Fair-share scheduling,Scheduling (computing),Computer science,Universal Software Radio Peripheral,Computer network,Domino,Distributed coordination function,Throughput,Dynamic priority scheduling,Distributed computing | Conference |
Citations | PageRank | References |
15 | 0.70 | 31 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenjie Zhou | 1 | 40 | 2.56 |
| Dong Li | 2 | 475 | 67.20 |
| Kannan Srinivasan | 3 | 1324 | 117.98 |
| Prasun Sinha | 4 | 2527 | 181.57 |