Premium
Distance edge coloring and collision‐free communication in wireless sensor networks
Author(s) -
Drira Kaouther,
Seba Hamida,
Effantin Brice,
Kheddouci Hamamache
Publication year - 2013
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21491
Subject(s) - edge coloring , graph coloring , fractional coloring , greedy coloring , computer science , list coloring , enhanced data rates for gsm evolution , wireless sensor network , complete coloring , scheduling (production processes) , generalization , graph , combinatorics , topology (electrical circuits) , mathematics , theoretical computer science , computer network , mathematical optimization , telecommunications , line graph , graph power , mathematical analysis
Motivated by the problem of link scheduling in wireless sensor networks where different sensors have different transmission and interference ranges and may be mobile, we study the problem of “distance edge coloring” of graphs, which is a generalization of proper edge coloring. Let G be a graph modeling a sensor network. An ℓ ‐distance edge coloring of G is a coloring of the edges of G such that any two edges within distance ℓ of each other are assigned different colors. The parameter ℓ is chosen, so that the links corresponding to two edges that are assigned the same color do not interfere. We investigate the ℓ ‐distance edge coloring problem on several families of graphs that can be used as topologies in sensor deployment. We focus on determining the minimum number of colors needed and optimal coloring algorithms. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013