On call admission control in DS/CDMA cellular networks
Analytical models are proposed for various direct sequence code-division multiple-access (DS/CDMA) call admission control schemes. Many mathematical call admission models for DS/CDMA cellular networks have been proposed. However, they have shortcomings. First, by ignoring the stochastic traffic load...
Saved in:
Published in | IEEE transactions on vehicular technology Vol. 50; no. 6; pp. 1328 - 1343 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.11.2001
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Analytical models are proposed for various direct sequence code-division multiple-access (DS/CDMA) call admission control schemes. Many mathematical call admission models for DS/CDMA cellular networks have been proposed. However, they have shortcomings. First, by ignoring the stochastic traffic load variation or call blocking effect, they failed to sufficiently characterize the second moment of other-cell interference. This leads to inaccurate analysis of a real network. Second, the optimal control parameters were often obtained through an exhaustive search which was very time consuming. Finally, the estimation of system capacity in previous models was obtained by using a simple one-slope path-loss propagation model. However, it is well known that a two-slope path loss propagation model is needed in a line-of-sight (LOS) microcell propagation environment. We propose an analytical model for call admission to overcome these drawbacks. In addition, we combine a modified linear programming technique with the built analytical model to find better call admission control schemes for a DS/CDMA cellular network. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0018-9545 1939-9359 |
DOI: | 10.1109/25.966566 |