HR-WPAN을 위한 Worst-case Guaranteed Scheduling Algorithm
- Title
- HR-WPAN을 위한 Worst-case Guaranteed Scheduling Algorithm
- Other Titles
- Worst-case Guaranteed Scheduling Algorithm for HR-WPAN
- Author
- 김제민
- Alternative Author(s)
- Kim, Je-Min
- Advisor(s)
- 이정규
- Issue Date
- 2007-08
- Publisher
- 한양대학교
- Degree
- Master
- Abstract
- 현재까지 HR-WPAN(High Rate-Wireless Personal Area Network)에 제안된 LDS(Link-status Dependent Scheduling) 알고리즘(algorithm)은 전체 네트워크(network)의 처리율(throughput) 향상만을 목적으로 함으로서, worst-link에 상대적으로 중요한 디바이스(device)가 연결된 경우, 그 디바이스의 처리율은 더욱 악화 된다. 본 논문에서 제안한 WGS(Worst-case Guaranteed Scheduling) 알고리즘은 link 상태가 변하더라도 모든 디바이스의 처리율을 동일하게 유지함으로써, worst-link에 연결된 디바이스의 처리율을 어느 정도 보장하고 전체 네트워크의 지연은 기존의 LDS 알고리즘보다 감소시킬 수 있다. 따라서 향후 HR-WPAN의 설계 시 worst-link에 연결된 디바이스의 처리율을 어느 정도 보장하고 전체 네트워크의 지연을 감소시키고 싶을 경우, 본 논문에서 제안한 WGS 알고리즘이 유용하게 사용될 수 있을 것이다.; The proposed LDS(Link-status Dependent Scheduling) algorithm in HR-WPAN(High Rate-Wireless Personal Area Network) up to now aims at doing only throughput elevation of the whole network, when the crucial device is connected with worst-link relatively, throughput of this device becomes aggravation. The proposed the WGS(Worst-case Guaranteed Scheduling) algorithm in this paper guarantees throughput of the device which is connected with worst-link in a certain degree as maintaining throughput of all devices identically even if a link-status changes, decreases delay of the whole network more than current LDS algorithm. Therefore proposed WGS algorithm in this paper will be useful in case of guaranteeing throughput of a device which is connected worst-blink in a certain degree in a design of HR-WPAN hereafter.
- URI
- https://repository.hanyang.ac.kr/handle/20.500.11754/148534http://hanyang.dcollection.net/common/orgView/200000406913
- Appears in Collections:
- GRADUATE SCHOOL[S](대학원) > COMPUTER SCIENCE & ENGINEERING(컴퓨터공학과) > Theses (Master)
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML