DocumentCode
449473
Title
Optimal packet scheduling over correlated Nakagami-m channels with different diversity-combining techniques
Author
Karmokar, Ashok K. ; Bhargava, Vijay K.
Author_Institution
Dept. of Electr. & Comput. Eng., British Columbia Univ., Vancouver, BC, Canada
Volume
3
fYear
2005
fDate
28 Nov.-2 Dec. 2005
Abstract
We study two cross-layer optimization problems for M-QAM systems that adapt transmission rate with channel state and buffer occupancy. We formulate both problems as constrained Markov decision process problem and give linear programming technique based solutions. In first problem, our objective is to minimize average transmission power under constraint on average delay and packet dropping probability. We minimize average bit error rate (BER) with average delay and packet dropping probability constraints in second problem. The Nakagami-m fading channel with diversity-combining is described as finite state Markov channel. Simulation results show that the system performances can be improved by adapting rate with buffer state and hence delaying packet in the buffer in addition to employing diversity-combining at the receiver.
Keywords
Markov processes; Nakagami channels; diversity reception; error statistics; linear programming; packet radio networks; scheduling; BER; Markov decision process; bit error rate; buffer occupancy; correlated Nakagami-m fading channels; cross-layer optimization problems; diversity-combining techniques; linear programming technique; optimal packet scheduling; packet dropping probability; transmission power; Bit error rate; Delay; Fading; Linear programming; Quality of service; Rayleigh channels; Scheduling algorithm; System performance; Throughput; Transmitters;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE
Print_ISBN
0-7803-9414-3
Type
conf
DOI
10.1109/GLOCOM.2005.1577846
Filename
1577846
Link To Document