Distance edge coloring and collision‐free communication in wireless sensor networks

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 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.

Joint Link Scheduling and Routing for Load Balancing in STDMA Wireless Mesh Networks

“…Therefore the proposed routing algorithms for load balancing in ad hoc networks are inappropriate in WMNs In WMNs, routing algorithms should reflect that the MP's mobility is less frequent and must consider interferences between MPs in the wireless environment. In this paper, we suggest link scheduling using ݈-distance edge coloring [13] to consider interference between MPs and also propose a routing algorithm which can find a path to distribute available resource evenly. A detailed description of ݈ -distance edge coloring is discussed in section 3.…”

“…This coloring scheme can guarantee interference-free transmission and packet collision does not occur. In this paper, we use an ݈-distance edge coloring scheme proposed in [13]. First, we define ݈-distance as the number of links between any two links when the minimum path is decided between them.…”

“…is formulated as the total as shown in equation (13). So, should be less than or equal to the maximum available…”

“…can be determined by solving an LP problem which has the objective function in equation ( 4) ( 6) to (13). Then, we of each link using the derived ‫ݔ‬ , and also a new algorithm to n each link evenly and to by applying the previously scheduling and routing algorithm in section 3.2 and…”

Cross-layer Design of Joint Routing and Scheduling for Maximizing Network Capacity of IEEE 802.11s based Multi-Channel SmartGrid NAN Networks

“…(TV White Space) 등이 있다 [6] . 가정한 'strong edge coloring [7] '이라 불리우는 '1-거리 간선 채색(1-distance edge coloring)' [8] …”