Queueing delay analysis for the joint scheduling exploiting multiuser diversity over a fading channel

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 400
  • Download : 212
In this paper, we consider a joint packet scheduling algorithm for wireless networks and investigate its characteristics. The joint scheduling algorithm is a combination of the Knopp and Humblet (KH) scheduling, which fully exploits multiuser diversity, and the probabilistic weighted round-robin (WRR) scheduling, which does not use multiuser diversity at all. Under the assumption that the wireless channel process for each user is described by the Nakagami-m model, we develop a formula to estimate the tail distribution of the packet delay for an arbitrary user under the joint scheduling. Numerical results exhibit that under the joint scheduling, the ratio of the number of slots assigned for the WRR scheduling to that for the KH scheduling dominates the characteristics of the delay performance.
Publisher
WILEY-BLACKWELL
Issue Date
2008-09
Language
English
Article Type
Article
Keywords

WIRELESS PACKET NETWORKS; SUPPORT; PERFORMANCE; CAPACITY; SYSTEMS; SERVICE; QUALITY; DESIGN

Citation

WIRELESS PERSONAL COMMUNICATIONS, v.46, no.4, pp.397 - 411

ISSN
0929-6212
DOI
10.1007/s11277-007-9442-5
URI
http://hdl.handle.net/10203/23942
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
000257496600002.pdf(369.62 kB)Download
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0