Low complexity power and scheduling policies for wireless networks to provide quality of service

Author

Kumar, V. Satya ; Sharma, Vishal

Author_Institution

Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India

fYear

2014

fDate

9-14 Feb. 2014

Firstpage

1

Lastpage

6

Abstract

We consider optimal power allocation policies for a single server, multiuser system. The power is consumed in transmission of data only. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity.

Keywords

computational complexity; fading channels; multi-access systems; multipath channels; quality of service; queueing theory; radio networks; resource allocation; scheduling; computational complexity; data queue; delay constraints; multipath fading; multiuser system; optimal power allocation policies; quality of service; scheduling policies; transmission channel; wireless networks; Approximation methods; Complexity theory; Delays; Fading; Optimization; Quality of service; Upper bound; Average queue constraint; Fading channels; Optimal average power policies;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory and Applications Workshop (ITA), 2014

Conference_Location

San Diego, CA

Type

conf

DOI

10.1109/ITA.2014.6804250

Filename

6804250