Guaranteed Scheduling for Worst-Case in HR-WPAN

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.