Skip to Main Content
Classical graph colouring and its generalisations have been used to model various frequency and channel allocation processes in different radio and wireless network contexts for some time now. However, most of this work has targeted cellular networks and graphs with a relatively large number of nodes. In this article we demonstrate how graph colouring can be used as a theoretical basis for a protocol to effectively assign channels to WLAN access points. We also give the outline of the protocol operation, and show its effectiveness with real-life wireless networks.