Dynamic decision making for candidate access point selection

Authors:
Burak Simsek;Katinka Wolter;Hakan Coskun
Affiliations:
Institut für Informatik, HU Berlin, Berlin;Institut für Informatik, HU Berlin, Berlin;ETS, TU Berlin, Berlin
Venue:
AN'06 Proceedings of the First IFIP TC6 international conference on Autonomic Networking
Year:
2006

Citing 3
Cited 0

KnightCap: A Chess Programm That Learns by Combining TD(lambda) with Game-Tree Search

ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
An analysis of cooperative coevolutionary algorithms

An analysis of cooperative coevolutionary algorithms
FHCF: a simple and efficient scheduling scheme for IEEE 802.11e wireless LAN

Mobile Networks and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we solve the problem of candidate access point selection in 802.11 networks, when there is more than one access point available to a station. We use the QBSS (quality of service enabled basic service set) Load Element of the new WLAN standard 802.11e as prior information and deploy a decision making algorithm based on reinforcement learning. We show that using reinforcement learning, wireless devices can reach more efficient decisions compared to static methods of decision making which opens the way to a more autonomic communication environment. We also present how the reinforcement learning algorithm reacts to changing situations enabling self adaptation.