Loading...

An adaptive call admission algorithm for cellular networks

Beigy, H ; Sharif University of Technology | 2005

250 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.compeleceng.2004.12.002
  3. Publisher: 2005
  4. Abstract:
  5. In this paper, we first propose a new continuous action-set learning automaton and theoretically study its convergence properties and show that it converges to the optimal action. Then we give an adaptive and autonomous call admission algorithm for cellular mobile networks, which uses the proposed learning automaton to minimize the blocking probability of the new calls subject to the constraint on the dropping probability of the handoff calls. The simulation results show that the performance of the proposed algorithm is close to the performance of the limited fractional guard channel algorithm for which we need to know all the traffic parameters in advance. © 2005 Elsevier Ltd. All rights reserved
  6. Keywords:
  7. Algorithms ; Automata theory ; Automation ; Cellular telephone systems ; Communication channels (information theory) ; Convergence of numerical methods ; Learning systems ; Mobile telecommunication systems ; Probability ; Quality of service ; Telecommunication traffic ; Adaptive call admission control ; Continuous action learning automata ; Guard channel policy ; Learning automata ; Limited fractional guard channel policy ; Cellular neural networks
  8. Source: Computers and Electrical Engineering ; Volume 31, Issue 2 , 2005 , Pages 132-151 ; 00457906 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0045790605000480