Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Guaranteed Scheduling for Worst-Case in HR-WPAN
- Authors
- 이정규; Kang, Jae Eun
- Issue Date
- Aug-2008
- Publisher
- IEEE
- 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 mod
- Citation
- IEEE Conference of Convergence and Hybrid Information Technology (ICHIT 2008), pp.338 - 343
- Indexed
- SCOPUS
- Journal Title
- IEEE Conference of Convergence and Hybrid Information Technology (ICHIT 2008)
- Start Page
- 338
- End Page
- 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.
- Files in This Item
- Go to Link
- Appears in
Collections - COLLEGE OF COMPUTING > SCHOOL OF COMPUTER SCIENCE > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.