ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 A New Efficient BS Scheduler and Scheduling Algorithm in WiBro Systems
Cited 12 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
김주희, 김은경, 김경수
발행일
200602
출처
International Conference on Advanced Communication Technology (ICACT) 2006, pp.1467-1470
초록
In this paper, we propose an efficient structure of base station (BS) scheduler for the Wireless Broadband (WiBro) system. The BS scheduler consists of an uplink scheduling block, a downlink scheduling block and a channel quality information block. Both uplink and downlink scheduling blocks operate closely with a channel quality information block to schedule downlink packets and allocate uplink/downlink radio resources. Next, we propose a new efficient scheduling algorithm for WiBr0 systems. The proposed algorithm utilizes the user-based scheduling to relieve the MAP overhead problem and to modify the normal proportional fair (PF) scheduling algorithm to guarantee user-based quality of service (QoS). The simulation study shows that the proposed algorithm relieves the MAP overhead problem by allocating the minimum number of user bursts in a frame and supports better fairness performance, while supporting the system throughput performance similar to that of the normal PF scheduling algorithm.
KSP 제안 키워드
Channel Quality Information, Downlink scheduling, Proportional fair (PF) scheduling, Scheduling algorithm, Simulation study, Throughput performance, Uplink Scheduling, User based, Wireless Broadband, base station(BS), quality of service(QoS)