Distance edge coloring and collision‐free communication in wireless sensor networks. Issue 1 (7th January 2013)

• Record Type: Journal Article
• Authors: Drira, Kaouther; Seba, Hamida; Effantin, Brice; Kheddouci, Hamamache
• Is Part Of: Networks. Volume 62:Issue 1(2013:Aug.)
• Page Start: 35
• Page End: 47
• Publication Date: 2013-01-07
• Subjects: Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21491
• Languages: English
• ISSNs: 0028-3045

Abstract

<abstract abstract-type="main" xml:lang="en"> <title>Abstract</title> <p>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 <italic>G</italic>be a graph modeling a sensor network. An <italic>ℓ</italic>‐distance edge coloring of <italic>G</italic>is a coloring of the edges of <italic>G</italic>such that any two edges within distance <italic>ℓ</italic>of each other are assigned different colors. The parameter <italic>ℓ</italic>is chosen, so that the links corresponding to two edges that are assigned the same color do not interfere. We investigate the <italic>ℓ</italic>‐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</p> </abstract>