Wireless Packet Scheduling Algorithms based on Link Level Retransmission 


Vol. 30,  No. 2, pp. 98-106, Feb.  2005


PDF
  Abstract

We propose a new wireless fair queueing algorithm, WFQ-R (Wireless Fair Queueing with Retransmission), which is well matched with the LLR (Link Level Retransmission) algorithm and does not require channel prediction. In the WFQ-R algorithm, the share consumed by retransmission is regarded as a debt of the retransmitted flow to the other flows. Thus, the WFQ-R algorithm achieves wireless fairness with the LLR algorithm by penalizing flows that use wireless resources without permission under the MAC layer. Through simulations, we showed that our WFQ-R algorithm maintains fairness adaptively and maximizes system throughput. Furthermore, our WFQ-R algorithm is able to achieve flow separation and compensation.

  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]

N. Kim and H. Yoon, "Wireless Packet Scheduling Algorithms based on Link Level Retransmission," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 2, pp. 98-106, 2005. DOI: .

[ACM Style]

Namgi Kim and Hyunsoo Yoon. 2005. Wireless Packet Scheduling Algorithms based on Link Level Retransmission. The Journal of Korean Institute of Communications and Information Sciences, 30, 2, (2005), 98-106. DOI: .

[KICS Style]

Namgi Kim and Hyunsoo Yoon, "Wireless Packet Scheduling Algorithms based on Link Level Retransmission," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 2, pp. 98-106, 2. 2005.