Name
Abstract | ||
|---|---|---|
In modern cellular networks, the channel quality is dynamic among users and also over time. The time-granularity for such dynamics is significantly diverse - either slow or fast compared to packet transmission time. Because of these issues most existing scheduling policies can not work consistently well. In this work, we propose a scheduling policy with performance relatively insensitive to the time-granularity of the dynamics of channel quality. Our policy is self-adaptive to the scale of channel variations by using an ensemble of proposed algorithms. The proposed scheduling policy is proved to have a worst-case performance bound in the existence of both slow and fast time-varying channels. Simulation results confirm that the policy better tolerates channel variations than other popular schemes such as EDF and the Greedy algorithm. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/WCNC.2007.778 | WCNC |
Keywords | Field | DocType |
wireless data networks,cellular radio,delay-constrained data scheduling,packet transmission time,greedy algorithm,packet radio networks,time-varying channels,greedy algorithms,wireless sensor networks,edf,cellular networks,throughput,cellular network,national electric code,doppler effect,scheduling algorithm | Fair-share scheduling,Computer science,Scheduling (computing),Communication channel,Computer network,Greedy algorithm,Real-time computing,Rate-monotonic scheduling,Throughput,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
ISSN | ISBN | Citations |
1525-3511 E-ISBN : 1-4244-0659-5 | 1-4244-0659-5 | 1 |
PageRank | References | Authors |
0.35 | 6 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoqiao Meng | 1 | 1576 | 82.89 |
| Thyaga Nandagopal | 2 | 1054 | 74.90 |
| Starsky H. Y. Wong | 3 | 478 | 30.23 |
| Hao Yang | 4 | 649 | 33.32 |
| Songwu Lu | 5 | 6137 | 504.90 |