Worst-case Guaranteed Scheduling Algorithm for HR-WPAN 


Vol. 32,  No. 5, pp. 270-276, May  2007


PDF
  Abstract

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-link in a certain degree in a design of HR-WPAN hereafter.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Kim and J. Lee, "Worst-case Guaranteed Scheduling Algorithm for HR-WPAN," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 5, pp. 270-276, 2007. DOI: .

[ACM Style]

Je-min Kim and Jong-kyu Lee. 2007. Worst-case Guaranteed Scheduling Algorithm for HR-WPAN. The Journal of Korean Institute of Communications and Information Sciences, 32, 5, (2007), 270-276. DOI: .

[KICS Style]

Je-min Kim and Jong-kyu Lee, "Worst-case Guaranteed Scheduling Algorithm for HR-WPAN," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 5, pp. 270-276, 5. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880