한국통신학회논문지 (The Journal of Korean Institute of Communications and Information Sciences)

  • 제30권2A호
  • /
  • Pages.98-106
  • /
  • 2005
  • /
  • 1226-4717(pISSN)
  • /
  • 2287-3880(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

링크 계층 재전송을 고려한 무선 패킷 스케줄링 알고리즘

Wireless Packet Scheduling Algorithms based on Link Level Retransmission

  • 김남기 (삼성전자 정보통신총괄 통신연구소) ;
  • 윤현수 (한국과학기술원 전자전산학과)
  • 발행 : 2005.02.28
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 MAC 계층 이하에 존재하는 링크 계층 재전송 기법과 잘 부합할 수 있는 새로운 무선 패킷 스케줄링 알고리즘인 WFQ-R (Wireless Fair Queueing with Retransmission) 알고리즘을 제안한다. WFQ-R 알고리즘에서 링크 계층 재전송에 의해 사용된 자원은 재전송을 수행한 플로우(flow)가 다른 플로우들에게 미리 차용한 자원으로 취급한다. 즉 MAC 계층 이하의 재전송 과정에서 패킷 스케줄러의 허락 없이 사용되어진 자원을 재전송을 수행한 플로우에게 책임 지움으로써 WFQ-R 알고리즘은 무선 공평성(fairness)을 획득할 수 있게 된다. 본 논문에서는 실험을 통하여 WFQ-R 알고리즘기 공평성을 유지함과 동시에 시스템 성능을 최대화 함을 보인다. 또 플로우 구분성(seperation)과 보상성(compensation)도 획득할 수 있음도 보인다.

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.

키워드

참고문헌

  1. A. Demers, S. Keshav, and S. Shenker, 'Analysis and Simulation of a Fair Queueing Algorithm,' ACM SIGCOM'89, 1989
  2. S. Lu, V. Bharghavan, and R. Srikant, 'Fair Scheduling in Wireless Packet Networks,' IEEE/ACM Transactions on Networking, vol. 7, no. 4, Aug, 1999
  3. P. Ramanathan and P. Agrawal, 'Adapting Packet Fair Queueing Algorithms to Wireless Networks,' ACM MOBICOM'98, Oct. 1998
  4. T. S. E. Ng, I. Stoica and H. Zhang, 'Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors,' IEEE INFOCOM'98, 1998
  5. S. Lu, T. Nandagopal and V. Bharghavan, 'Design and Analysis of an Algorithm for Fair Service in Error-Prone Wireless Channels,' ACM Wireless Networks Journal, vol. 6, no. 4, pp. 232-343, 2000
  6. Y. Liu, S. Gruhl, and E. W. Knightly, 'WCFQ: An Opportunistic Wireless Scheduler with Statistical Fairness Bounds,' IEEE Transactions on Wireless Communications, vol. 2, no. 5, Sep. 2003
  7. M. Liu, L. B. Milstein, and R. Rao, 'Wireless Random Scheduling Protocol with Realistic Channel Conditions,' IEEE MILCOM'03, Boston, Sep. 2003
  8. V. Bharghavan, S. Lu and T. Nandagopal, 'Fair Queuing in Wireless Networks: Issues and Approaches,' IEEE Personal Communications, Feb. 1999
  9. P. Goyal, H. M. Yin, and H. Cheng, 'Start-Time Fair Queueing: A scheduling Algorithm for Integrated Services Packet Switching Networks,'. IEEE/ACM Transactions on Networking,. vol. 5, no. 5, Oct. 1997
  10. http://www.isi.edu/nsnam/ns/
  11. TIA/EIA/cdma2000, 'Mobile Station - Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular Systems,' TIA/EIAI Standard, 1999.
  12. 3GPP, 'RLR Protocol Specification,' 3GPP TS 25.322 version 3.0, Oct. 1999
  13. 3GPP2, 'Physical Layer Standard for cdma2000 Spread Spectrum Systems Release C,' 3GPP2 C.S0002-C V1.0, May 2002
  14. IEEE 802.16 Task Group e (Mobile Wireless MAN), http://www.ieee802.org/16/tge/
  15. IEEE 802.20 Mobile Broadband Wireless Access, http://grouper.ieee.org/groups/802/20/