A LOW COMPLEXITY ALGORITIIM BASED ON GEOMETRIC PROGRAMMING FOR CALL ADMISSION CONTROL IN WIRELESS NETWORKS


Ozcan M. K., TOKER C.

15th IEEE/SP Workshop on Statistical Signal Processing, Cardiff, United Kingdom, 31 August - 03 September 2009, pp.285-288 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume:
  • Doi Number: 10.1109/ssp.2009.5278584
  • City: Cardiff
  • Country: United Kingdom
  • Page Numbers: pp.285-288
  • Hacettepe University Affiliated: Yes

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.