1 / 11

Channel Assignment in Wireless Networks: Graph Coloring

Channel Assignment in Wireless Networks: Graph Coloring. Presented by: Andrew Chickadel – Villanova University. What is Channel Assignment?. Selecting radio frequencies for: Enhanced security Reducing interference Keeping in mind: Radio frequency (RF) spectrum Network topologies.

bethany-walters
Download Presentation

Channel Assignment in Wireless Networks: Graph Coloring

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Channel Assignment in Wireless Networks: Graph Coloring Presented by: Andrew Chickadel – Villanova University

  2. What is Channel Assignment? • Selecting radio frequencies for: • Enhanced security • Reducing interference • Keeping in mind: • Radio frequency (RF) spectrum • Network topologies

  3. What is Graph Coloring? • Generally defined as: • Edge Coloring • NP-complete for determining class • Vertex Coloring • NP-hard for general graphs • Channels represented as “colors”

  4. Why Graph Coloring? • Practicality • Relevance • Reliability

  5. Interference

  6. Interference Solved by Edge Coloring How many colors do we need? It depends on the number of outgoing edges!

  7. Interference Solved by Vertex Coloring How many colors do we need? It depends on the overall complexity and connectivity of the graph!

  8. Coloring Implementations • Weighted coloring • Channel re-use algorithms • Dynamic channel assignment • RF spectrum boundary algorithms • Multi-step algorithms

  9. Dynamic Assignment • Almeroth et al.1 • Shortcomings • Dramatic topology changes • Security across the “default channel” • Future improvements • Dense settings 1 K.N. Ramachandran, E. M. Belding, K.C. Almeroth, M.M. Buddhikot, “Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks,” Apr. 2006; http://www.cs.ucsb.edu/~ebelding/txt/infocom06.pdf

  10. A Multi-step Algorithm • Hminmax: Arbaugh et al.2 • Shortcomings • “Greedy” step • Algorithmic complexity not improved, only numerical results • Future improvements • Overlapping 802.11b/g interference graphs • 802.11b/g in same coverage area 2 A. Mishra, S. Banerjee, W. Arbaugh, “Weighted Coloring Based Channel Assignment for WLANs,” ACM SIGMOBILE Mobile Computing and Communications Review, July 2005, vol. 9, no. 3, pp. 19-31.

  11. Looking Ahead • Improvement despite NP-hard and NP-complete • Rapid growth of Wi-fi and effects on the RF spectrum • Security must be maintained

More Related