The coexistence of different heterogeneous Radio Access Technologies (RATs) is a significant feature of current wireless networks. Thus, it is important for network elements, such as the Base Stations (BSs) of cellular networks or access points (APs) of wireless local area networks (WLANs) to be reconfigurable according to the real-time network environment. This will enable interconnection between different networks. In this paper, we propose an efficient distributed reconfiguration algorithm: the Dynamic Network Self-optimization Algorithm (DNSA). This algorithm is based on the widely used Q-learning algorithm and regards the network self-optimization entity of each radio access network as an independent intelligent agent. Multiple agents perform the optimization cooperatively to reduce the system blocking rate and improve network revenue. In the proposed algorithm, the dynamic network self-optimization problem is transformed into a multi-agent reinforcement learning problem, which has much lower complexity and better performance.
[1]
Panagiotis Demestichas,et al.
Reconfigurations Selection in Cognitive, Beyond 3G, Radio Infrastructures
,
2006,
2006 1st International Conference on Cognitive Radio Oriented Wireless Networks and Communications.
[2]
Wang Zhan-quan.
Reinforcement Learning Theory,Algorithms and Application
,
2006
.
[3]
Sebastian Thrun,et al.
A Review of Reinforcement Learning
,
2000,
AI Mag..
[4]
Chen Jie.
Autonomic Joint Session Admission Control Using Reinforcement Learning
,
2007
.
[5]
G. Dimitrakopoulos,et al.
Dynamic planning and management of reconfigurable systems
,
2005,
First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..