Performance of greedy policies for downlink scheduling in networks with relay stations
スポンサーリンク
概要
- 論文の詳細を見る
We investigate a greedy policy for delay-optimal scheduling in broadband wireless networks using relay stations (RS). The key idea behind the policy is that users should greedily exploit opportunism from time varying channels, while the basestation should prioritize balancing queues at RS. A fluid model is presented to show that such policy is optimal in the fluid regime. By simulation we show that the proposed scheme reduces mean delay by up to 73% compared to backpressure algorithm.
著者
-
BAEK Seung
College of Pharmacy, Seoul National University
-
Shin JaeSheung
Electronics and Telecommunications Research Institute
関連論文
- Study on the Hydroxyl Radical Scavenging Activity Changes of Ginseng and Ginsenoside-Rb_2 by Heat Processing(Pharmacognosy)
- Performance of greedy policies for downlink scheduling in networks with relay stations
- Resveratrol Oligomers from Vitis amurensis Attenuate β-Amyloid-Induced Oxidative Stress in PC12 Cells(Pharmacognosy)
- Reduction of Cisplatin-Induced Nephrotoxicity by Ginsenosides Isolated from Processed Ginseng in Cultured Renal Tubular Cells(Pharmacognosy)
- Tyrosinase-Inhibitory Furanocoumarin from Angelica dahurica(Pharmacognosy)