DocumentCode :
2332179
Title :
QRP07-1: Throughput Guarantees for Wireless Networks with Opportunistic Scheduling
Author :
Hassel, Vegard ; Oien, Geir E. ; Gesbert, David
Author_Institution :
Dept. of Electron. & Telecommun., Norwegian Univ. of Sci. & Technol., Trondheim
fYear :
2006
fDate :
Nov. 27 2006-Dec. 1 2006
Firstpage :
1
Lastpage :
6
Abstract :
In this paper we analyze achievable throughput guarantees in wireless time-division multiplexing (TDM) networks. Approximations of the throughput guarantee violation probability (TGVP) for users communicating in time-slotted systems are obtained for any scheduling algorithm with a given mean and variance of the number of bits transmitted in a time- slot and a distribution for the number of time-slots allocated to a user within a time-window. We investigate the corresponding TGVPs for three scheduling algorithms, namely (i) Round Robin Scheduling, (ii) Maximum Carrier-to-Noise Ratio Scheduling, and (iii) Opportunistic Round Robin Scheduling, when the users´ channels are independently and identically distributed.
Keywords :
channel allocation; radio networks; scheduling; time division multiplexing; carrier-to-noise ratio scheduling; channel allocation; opportunistic round Robin scheduling; throughput guarantee violation probability; time-slotted system; wireless time-division multiplexing network; Batteries; Genetic expression; Quality of service; Resource management; Round robin; Scheduling algorithm; Stochastic processes; Telecommunication traffic; Throughput; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE
Conference_Location :
San Francisco, CA
ISSN :
1930-529X
Print_ISBN :
1-4244-0356-1
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2006.452
Filename :
4151082
Link To Document :
بازگشت