Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

14 years 4 months ago

Download www.win.tue.nl

Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network.

Christopher L. Barrett, V. S. Anil Kumar, Madhav V

Real-time Traffic

Edge Coloring Graphs | PERCOM 2006 | Strong Edge Coloring | Wireless Networks |

claim paper

» EndtoEnd ThroughputAware Channel Assignment in MultiRadio Wireless Mesh Networks

» FAST CASH FAir and STable Channel ASsignment on Heterogeneous Wireless Mesh Network

» Globally Optimal Channel Assignment for NonCooperative Wireless Networks

» Fair bandwidth allocation framework for heterogeneous multiradio Wireless Mesh Networks

» Leveraging Cognitive Radios for Effective Communications over Water

» Deploying Wireless Networks with Beeps

» A Note on Uniform Power Connectivity in the SINR Model

Post Info
More Details (n/a)

Added	24 Dec 2009
Updated	24 Dec 2009
Type	Conference
Year	2006
Where	PERCOM
Authors	Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate

Comments (0)

Sciweavers

Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

Edge Coloring Graphs | PERCOM 2006 | Strong Edge Coloring | Wireless Networks |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers