A low complexity algorithm based on geometric programming for call admission control in wireless networks

Author

Özcan, Murat Kaan ; Toker, Cenk

Author_Institution

Dept. of Electr. & Electron. Eng., Hacettepe Univ., Ankara, Turkey

fYear

2009

Firstpage

285

Lastpage

288

Abstract

In this paper, the problem of maximizing the number of users that can be served in a wireless network under QoS requirements and transmitter power limitations is studied. This problem is mathematically defined and then transformed into a novel form which is solvable by geometric programming. A suboptimum solution is proposed and the performance of this method is investigated by simulations.

Keywords

computational complexity; geometric programming; quality of service; radio networks; telecommunication congestion control; QoS requirements; call admission control; geometric programming; low complexity algorithm; suboptimum solution; transmitter power limitations; wireless networks; Call admission control; Fading; Intelligent networks; Mathematical programming; Performance analysis; Power engineering and energy; Power system modeling; Signal to noise ratio; Transmitters; Wireless networks; call admission control; cognitive networks; geometric programming; optimization; power allocation; wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Statistical Signal Processing, 2009. SSP '09. IEEE/SP 15th Workshop on

Conference_Location

Cardiff

Print_ISBN

978-1-4244-2709-3

Electronic_ISBN

978-1-4244-2711-6

Type

conf

DOI

10.1109/SSP.2009.5278584

Filename

5278584