DocumentCode
3320277
Title
Strong edge coloring for channel assignment in wireless radio networks
Author
Barrett, Christopher L. ; Istrate, Gabriel ; Kumar, V. S Anil ; Marathe, Madhav V. ; Thite, Shripad ; Thulasidasan, Sunil
Author_Institution
Basic & Appl. Simulation Sci. (CCS-5), Los Alamos Nat. Lab., NM
fYear
2006
fDate
13-17 March 2006
Lastpage
110
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
Keywords
approximation theory; channel allocation; distributed algorithms; graph colouring; radio networks; channel assignment; distributed approximation; sequential approximation; strong edge coloring graphs; wireless radio networks; Approximation algorithms; Computational modeling; Computer science; Frequency; Intelligent networks; Interference; Media Access Protocol; Radio network; Radio networks; Transceivers;
fLanguage
English
Publisher
ieee
Conference_Titel
Pervasive Computing and Communications Workshops, 2006. PerCom Workshops 2006. Fourth Annual IEEE International Conference on
Conference_Location
Pisa
Print_ISBN
0-7695-2520-2
Type
conf
DOI
10.1109/PERCOMW.2006.129
Filename
1598948
Link To Document