A practical heterogeneous network optimisation algorithm based on reinforcement learning
by Zhiyong Feng, Li Tan, Wei Li, T. Aaron Gulliver, Litao Liang
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 6, No. 4, 2011

Abstract: Owing to the increasing and diversifying service requirements of wireless communications, wireless networks must coexist with heterogeneous radio systems. To realise the interconnection between different networks, it is important for the radio access network elements, such as the cellular network base stations (BSs) and the wireless local area network (WLAN) access points (APs) to be reconfigurable based on the real-time network environment. In this paper, we propose an efficient distributed reconfiguration algorithm for heterogeneous networks: the dynamic network self-optimisation algorithm (DNSA). This algorithm is based on the Q-learning algorithm and the self-optimisation of each network entity acting as independent agents. In the proposed algorithm, multiple agents perform the optimisation cooperatively to reduce the system blocking rate and improve network revenue. The dynamic network self-optimisation problem is transformed into a multiple-agent reinforcement learning problem which has much lower complexity and better performance.

Online publication date: Thu, 26-Feb-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com