An Admission Control Algorithm for CDMA Networks
Resource
IEEE ICONU_U03.
Journal
The 11th IEEE International Conference on Networks 2003 ICON2003
Pages
647-652
Date Issued
2003
Date
2003
Author(s)
Chu, K.C.
Lin, F.Y.S.
Wang, S.F.
Abstract
This paper proposes an admission control algorithm for CDMA networks, from which a revenue optimization problem is formulated as a mixed integer problem. The objective of the optimization problem is to maximizing total system revenue subject to capacity as well as QoS constraints. The approach for solving revenue optimization problem is Lagrangean relaxation in conjunction with a heuristic. The experiments consider total system revenue with respective to voice activity factor WAF) and signal-tointerference (SIR) on 500 test cases which are within 9 base stations, 50 existing mobile stations, as well as 50 new mobile stations. Computational results illustrate that the solution quality of error gap less than 5.0% is with percentile 0.99. Proposed algorithm is calculated with near-optimal solution. Index Termsadmission control algorithm, CDMA networks, Lagrangean relaxation, mathematical formulation, optimization model
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
75.pdf
Size
23.53 KB
Format
Adobe PDF
Checksum
(MD5):e1f31490a6e989f041603eb487108d85