Locality in distributed graph algorithms
SIAM Journal on Computing
A constructive proof of Vizing's Theorem
Information Processing Letters
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
On the computational complexity of strong edge coloring
Discrete Applied Mathematics
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
IEEE/ACM Transactions on Networking (TON)
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms
Local edge colouring of Yao-like subgraphs of unit disk graphs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
| Hi-index | 5.23 |
In this paper, we consider two problems: the edge coloring and the strong edge coloring problems on unit disk graphs (UDGs). Both problems have important applications in wireless sensor networks as they can be used to model link scheduling problems in such networks. It is well known that both problems are NP-complete, and approximation algorithms for them have been extensively studied under the centralized model of computation. Centralized algorithms, however, are not suitable for ad hoc wireless sensor networks whose devices typically have limited resources, and lack the centralized coordination. We develop local distributed approximation algorithms for the edge coloring and the strong edge coloring problems on unit disk graphs. For the edge coloring problem, our local distributed algorithm has approximation ratio 2 and locality 50. For the strong edge coloring problem on UDGs, we present two local distributed algorithms with different tradeoffs between their approximation ratio and locality. The first algorithm has ratio 128 and locality 22, whereas the second algorithm has ratio 10 and locality 180.