By Topic

Strong edge coloring for channel assignment in wireless radio networks

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
$33 $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

6 Author(s)
C. L. Barrett ; Basic & Appl. Simulation Sci. (CCS-5), Los Alamos Nat. Lab., NM, USA ; G. Istrate ; V. S. A. Kumar ; M. V. Marathe
more authors

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

Published in:

Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)

Date of Conference:

13-17 March 2006