By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ozcan, M.K. ; Dept. of Electr. & Electron. Eng., Hacettepe Univ., Ankara, Turkey ; Toker, C.

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.

Published in:

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

Date of Conference:

Aug. 31 2009-Sept. 3 2009