Guaranteed Scheduling for Worst-Case in HR-WPAN
- Title
- Guaranteed Scheduling for Worst-Case in HR-WPAN
- Author
- 이정규
- Keywords
- Computing and Processing; Communication, Networking and Broadcast Technologies; Components, Circuits, Devices and Systems; Delay; Random access memory; Artificial neural networks; Fault currents; Computed tomography; Current transformers; Mathematical model; CTAP; HR-WPAN; Link Status; Guaranteed Scheduling
- Issue Date
- 2008-08
- Publisher
- IEEE
- Citation
- 2008 International Conference on Convergence and Hybrid Information Technology, Page. 338-343
- Abstract
- So far, the link-status dependent scheduling (LDS) Algorithm in HR-WPAN (high rate wireless personal area network) mainly focused on the throughput elevation in terms of an entire network. However, in the LDS algorithm the throughput of each DEV (device) is not sensibly considered for the elevation. For instance in case where the DEV has been connected under the bad channel quality, the LDS algorithm does not clearly provide avoidance of the bad user experience of the UE. From this consideration, we introduce a new algorithm which is guaranteed scheduling for worst-case (GSW) that the throughput of each DEV can be individually guaranteed.
- URI
- https://ieeexplore.ieee.org/document/4622848https://repository.hanyang.ac.kr/handle/20.500.11754/104779
- ISBN
- 978-0-7695-3328-5
- DOI
- 10.1109/ICHIT.2008.288
- Appears in Collections:
- COLLEGE OF COMPUTING[E](소프트웨어융합대학) > COMPUTER SCIENCE(소프트웨어학부) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML