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, Birleşik Krallık, 31 Ağustos - 03 Eylül 2009, ss.285-288 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1109/ssp.2009.5278584
  • Basıldığı Şehir: Cardiff
  • Basıldığı Ülke: Birleşik Krallık
  • Sayfa Sayıları: ss.285-288
  • Hacettepe Üniversitesi Adresli: Evet

Özet

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.