Channel dependent interference and decentralized colouring

Clifford, P. and Leith, D. J. (2007) Channel dependent interference and decentralized colouring. In: Proceedings of the First EuroFGI International Conference, NET-COOP 2007, Avignon, France, June 5-7, 2007. Lecture Notes in Computer Science, 4465 . Springer Berlin / Heidelberg, pp. 95-104. ISBN 978-3-540-72708-8

[img] Download (201kB)
Official URL:

Share your research

Twitter Facebook LinkedIn GooglePlus Email more...

Add this article to your Mendeley library


We consider channel allocation to mitigate interference be- tween wireless LANs. The channel allocation task is often formulated in the literature as finding a proper colouring of a single graph. We show that the interference between WLANs can be channel dependent in which case a different conflict graph is associated with each channel. Channel allocation then corresponds to a multi-graph colouring problem. This potentially has profound implications as the behaviour of many proposed colouring-based algorithms for channel allocation is unclear in a multi-graph context. We prove that a recently proposed decentralized colouring algorithm performs correctly in the multi-graph setting. We also present a new, extended version of this algorithm suited to a wide range of multi-radio architectures.

Item Type: Book Section
Additional Information: The original publication is available at
Keywords: Channel allocation; Channel dependent interference; Wireless local area networks; WLANS; Access-points; Base-stations; NET-COOP 2007; Hamilton Institute.
Academic Unit: Faculty of Science and Engineering > Computer Science
Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID: 1710
Identification Number: 10.1007/978-3-540-72709-5
Depositing User: Hamilton Editor
Date Deposited: 02 Dec 2009 10:50
Publisher: Springer Berlin / Heidelberg
Refereed: Yes

Repository Staff Only(login required)

View Item Item control page

Document Downloads

More statistics for this item...