๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Learning automata based dynamic guard channel algorithms

โœ Scribed by Hamid Beigy; M.R. Meybodi


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
556 KB
Volume
37
Category
Article
ISSN
0045-7906

No coin nor oath required. For personal study only.

โœฆ Synopsis


In this paper, we first propose two learning automata based decentralized dynamic guard channel algorithms for cellular mobile networks. These algorithms use learning automata to adjust the number of guard channels to be assigned to cells of network. Then, we introduce a new model for nonstationary environments under which the proposed algorithms work and study their steady state behavior when they use L Rร€I learning algorithm. It is also shown that a learning automaton operating under the proposed nonstationary environment equalizes its penalty strengths. Computer simulations have been conducted to show the effectiveness of the proposed algorithms. The simulation results show that the performances of the proposed algorithms are close to the performance of guard channel algorithm that knows all the traffic parameters.


๐Ÿ“œ SIMILAR VOLUMES


Adaptive quality of service-based routin
โœ Abdelhamid Mellouk; Saรฏd Hoceรฏni; Yacine Amirat ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 549 KB

## Abstract In this paper, we propose two adaptive routing algorithms based on reinforcement learning. In the first algorithm, we have used a neural network to approximate the reinforcement signal, allowing the learner to take into account various parameters such as local queue size, for distance e