Strong edge coloring for channel assignment in wireless radio networks

被引：37

作者：

Barrett, CL ^{[1
]}

Istrate, G

Kumar, VSA

Marathe, MV

Thite, S

Thulasidasan, S

机构：

[1] Los Alamos Natl Lab, CCS5, Los Alamos, NM 87545 USA

[2] Virginia Tech, Virginia Bio Informat Inst, Dept Comp Sci, Blacksburg, VA 24061 USA

[3] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands

来源：

FOURTH ANNUAL IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS WORKSHOPS, PROCEEDINGS | 2006年

关键词：

D O I：

10.1109/PERCOMW.2006.129

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：106 / +

页数：2

共 19 条

[1]

[Anonymous], P ACM MOBICOM

[2] The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks [J].