• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.249-251
• /
• 2007

The proposed LDS(Link-status Dependent Scheduling) algorithm in HR-WPAN up to now aims at doing only throughput elevation of the whole network, when the crucial DEV(Device) is connected with worst-link relatively, throughput of this DEV becomes aggravation, The proposed the WGS(Worst-case Guaranteed Scheduling) _algorithm in this paper guarantees throughput of the DEV which is connected with worst-link in a certain degree as maintaining throughput of all DEVs 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 DEV which is connected worst-link in a certain degree in a design of HR-WPAN hereafter.