By Topic

Automatic channel allocation for small wireless local area networks using graph colouring algorithm approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mahonen, P. ; Dept. of Wireless Networks, Aachen Univ., Germany ; Riihijarvi, J. ; Petrova, M.

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.

Published in:

Personal, Indoor and Mobile Radio Communications, 2004. PIMRC 2004. 15th IEEE International Symposium on  (Volume:1 )

Date of Conference:

5-8 Sept. 2004