상세정보
학술지
Performance of Greedy Policies for Downlink Scheduling in Networks with Relay Stations
- 저자
- 백승준, 신재승
- 발행일
- 201102
- 출처
- IEICE Electronics Express, v.8 no.3, pp.175-181
- ISSN
- 1349-2543
- 출판사
- IEICE
- 협약과제
- 11VI1100, 스마트 모바일 서비스를 위한 B4G 이동통신 기술 개발, 박남훈
- 초록
- 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. © IEICE 2011.
- KSP 제안 키워드
- Backpressure Algorithm, Downlink scheduling, Fluid Model, Fluid regime, Optimal Scheduling, Relay Station, Time-varying channels, broadband wireless networks, mean delay