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

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Volumn 1, Issue , 2004, Pages 536-539

  Mähönen, Petri ^a   Riihijärvi, Janne ^a   Petrova, Marina ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Frequency assignment; Graph colouring; IEEE 802.11

Indexed keywords

ALGORITHMS; CARRIER SENSE MULTIPLE ACCESS; CODE DIVISION MULTIPLE ACCESS; GRAPHIC METHODS; MATHEMATICAL MODELS; NATURAL FREQUENCIES; WIRELESS TELECOMMUNICATION SYSTEMS;

FREQUENCY ASSIGNMENT; GRAPH COLORING; IEEE 802.11;

LOCAL AREA NETWORKS;

EID: 11244320642     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. K. K. Leung, B.-J. Kim, "Frequency Assignment for Multi-Cell IEEE 802.11 Wireless Networks", in Proceedings of VTC'03, Orlando, Florida, October 2003.
2. D. Brélaz, "New methods to color the vertices of a graph", Comm. ACM, vol. 22, pp. 251-256, 1979.
3. J. S. Turner, "Almost all κ-colorable graphs are easy to color", J. Algorithms, vol. 9, pp. 63-82, 1988.
4. R. Diestel, Graph Theory, Springer-Verlag, New York, 2000.
5. F. Gamba, J.-F. Wagen, D. Rossier, "A Simple Agent-based Framework for Adaptive WLAN Frequency Management", in Proceedings of MOBICOM'03, San Diego, California, September 2003.
6. L. Hu, "Distributed Code Assignments for CDMA Packet Radio Networks", IEEE/ACM Transactions on Networking, vol. 1, no. 6, 1993.