An adaptive call admission algorithm for cellular networks

Authors:
Hamid Beigy;M. R. Meybodi
Affiliations:
Department of Computer Engineering, Sharif University of Technology, Hafez Avenue, Tehran 15914, Iran and Institute for Studies in Theoretical Physics and Mathematics (IPM), School of Computer Sci ...;Institute for Studies in Theoretical Physics and Mathematics (IPM), School of Computer Science, Tehran, Iran and Department of Computer Engineering, Amirkabir University of Technology, Tehran, Ira ...
Venue:
Computers and Electrical Engineering
Year:
2005

Citing 14
Cited 7

Nonstationary models of learning automata routing in data communication networks

IEEE Transactions on Systems, Man and Cybernetics
Reinforcement learning and its application to control

Reinforcement learning and its application to control
On optimal call admission control in cellular networks

Wireless Networks
Continuous Learning Automata Solutions to the Capacity Assignment Problem

IEEE Transactions on Computers
Graph Partitioning Using Learning Automata

IEEE Transactions on Computers
A New Approach to the Design of Reinforcement Schemes for Learning Automata: Stochastic Estimator Learning Algorithms

IEEE Transactions on Knowledge and Data Engineering
Hierarchical Discretized Pursuit Nonlinear Learning Automata with Rapid Convergence and High Accuracy

IEEE Transactions on Knowledge and Data Engineering
A new fractional channel policy

Journal of High Speed Networks
Continuous and discretized pursuit learning schemes: variousalgorithms and their comparison

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Varieties of learning automata: an overview

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Generalized pursuit learning schemes: new families of continuous and discretized learning automata

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On the use of learning automata in the control of broadcast networks: a methodology

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Learning automata-based bus arbitration for shared-medium ATM switches

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Discretized learning automata solutions to the capacity assignment problem for prioritized networks

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Brief paper: Asynchronous cellular learning automata

Automatica (Journal of IFAC)
A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks

International Journal of Systems Science
A team of continuous-action learning automata for noise-tolerant learning of half-spaces

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata

Computer Networks: The International Journal of Computer and Telecommunications Networking
Exploring load balancing in heterogeneous networks by rate distribution

International Journal of Autonomous and Adaptive Communications Systems
A note on the learning automata based algorithms for adaptive parameter selection in PSO

Applied Soft Computing
Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.