Queuing delay analysis for packet schedulers with/without multiuser diversity over a fading channel

Cited 20 time in webofscience Cited 0 time in scopus
  • Hit : 375
  • Download : 391
In this paper, we focus on a packet scheduling algorithm exploiting multiuser diversity in wireless networks. We compare the delay performance of the individual user under the scheduling algorithm exploiting multiuser diversity with that under the round-robin (RR) scheduling algorithm in order to reveal the characteristics of the scheduling algorithm exploiting multiuser diversity. For this purpose, we develop an approximate formula to estimate the tail distribution of packet delay for an arbitrary user under the scheduling algorithm exploiting multiuser diversity and under the RR scheduling algorithm. Numerical results exhibit that, in contrast to the throughput performance of the overall system, the scheduling algorithm exploiting multiuser diversity is not necessarily superior to the RR scheduling algorithm for the delay performance of the individual user. More specifically, it is shown that the former is superior to the latter only when the system lies in a severe environment, e.g., when the arrival rate is large, the burstiness of the arrival process is strong, or the average signal-to-noise ratio is low.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2007-09
Language
English
Article Type
Article
Keywords

ADAPTIVE MODULATION; WIRELESS NETWORKS; SERVICE; QUALITY; SUPPORT; PERFORMANCE; LINKS

Citation

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, v.56, no.5, pp.3220 - 3227

ISSN
0018-9545
DOI
10.1109/TVT.2007.900523
URI
http://hdl.handle.net/10203/23635
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 20 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0