Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

Authors:
Christopher L. Barrett;V. S. Anil Kumar;Madhav V. Marathe;Shripad Thite;Gabriel Istrate
Affiliations:
Virginia Tech;Virginia Tech;Virginia Tech;Technische Universiteit Eindhoven, The Netherlands;Los Alamos National Laboratory, USA
Venue:
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Year:
2006

Citing 0
Cited 10

Local edge colouring of Yao-like subgraphs of Unit Disk Graphs

Theoretical Computer Science
A sequential approach for optimal broadcast scheduling in packet radio networks

IEEE Transactions on Communications
A probabilistic greedy algorithm for channel assignment in cellular radio networks

IEEE Transactions on Communications
Approximation algorithms for secondary spectrum auctions

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Local algorithms for edge colorings in UDGs

Theoretical Computer Science
Radio network distributed algorithms in the unknown neighborhood model

ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Novel 2-hop coloring algorithm for time-slot assignment of newly deployed sensor nodes without ID in wireless sensor and robot networks

Computer Communications
Scheduling and channel assignment algorithm for IEEE 802.16 mesh networks using clique partitioning technique

Computer Communications
On strong edge-colouring of subcubic graphs

Discrete Applied Mathematics
On channel-discontinuity-constraint routing in wireless networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

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.