Abstract
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 Gbe a graph modeling a sensor network. An l-distance edge coloring of Gis a coloring of the edges of Gsuch that any two edges within distance lof each other are assigned different colors. The parameter lis chosen, so that the links corresponding to two edges that are assigned the same color do not interfere. We investigate the l-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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.