Multicode-DRR: A packet-scheduling algorithm for delay guarantee in a multicode-CDMA network

Peng Yong Kong, Kee Chaing Chua, Brahim Bensaou

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

Multicode-code division multiple access (CDMA) supports a variety of transmission rates within a wireless network. However, providing packet-delay guarantees in a multicode-CDMA network is difficult because its transmission capacity is time varying even in an error-free wireless channel. In this paper, we develop a packet-scheduling algorithm called multicode-deficit round robin (DRR) as a solution to the problem. The basic idea of multicode-DRR is to separate the time-varying capacity into a deterministic component and a variable component, and to use these components to serve time-sensitive and non-time-sensitive traffic, respectively. With the proposed scheduling algorithm, simulation results have confirmed that the maximum packet delays for time-sensitive traffic never exceed their target upper bounds.

Original languageBritish English
Pages (from-to)2694-2703
Number of pages10
JournalIEEE Transactions on Wireless Communications
Volume4
Issue number6
DOIs
StatePublished - Nov 2005

Keywords

  • Deficit round robin (DRR)
  • Multicode code division multiple access (multicode-CDMA)
  • Packet scheduling

Fingerprint

Dive into the research topics of 'Multicode-DRR: A packet-scheduling algorithm for delay guarantee in a multicode-CDMA network'. Together they form a unique fingerprint.

Cite this