The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2003 vol.14)
pp: 222-235
Cristina M. Pinotti , IEEE Computer Society
ABSTRACT
<p><b>Abstract</b>—Given an integer <tmath> \sigma > 1 </tmath>, a vector <tmath> (\delta_1, \delta_2, \ldots, \delta_{\sigma-1}) </tmath> of nonnegative integers, and an undirected graph <tmath> G=(V,E) </tmath>, an <tmath> L(\delta_1, \delta_2, \ldots,\delta_{\sigma-1}){\hbox{-}}\rm coloring </tmath> of <tmath> G </tmath> is a function <tmath> f </tmath> from the vertex set <tmath> V </tmath> to a set of nonnegative integers such that <tmath> | f(u) -f(v) | \ge \delta_i </tmath>, if <tmath> d(u,v) = i, \ 1 \le i \le \sigma-1 </tmath>, where <tmath> d(u,v) </tmath> is the distance (i.e., the minimum number of edges) between the vertices <tmath> u </tmath> and <tmath> v </tmath>. An optimal <tmath> L(\delta_1, \delta_2, \ldots,\delta_{\sigma-1}){\hbox{-}}\rm coloring </tmath> for <tmath> G </tmath> is one using the smallest range <tmath> \lambda </tmath> of integers over all such colorings. This problem has relevant application in channel assignment for interference avoidance in wireless networks, where channels (i.e., colors) assigned to interfering stations (i.e., vertices) at distance <tmath> i </tmath> must be at least <tmath> \delta_i </tmath> apart, while the same channel can be reused in vertices whose distance is at least <tmath> \sigma </tmath>. In particular, two versions of the coloring problem—<tmath> L(2,1,1) </tmath> and <tmath> L(\delta_1, 1, \ldots,1) </tmath>—are considered. Since these versions of the problem are <tmath> NP{\hbox{-}}\rm hard </tmath> for general graphs, efficient algorithms for finding optimal colorings are provided for specific graphs modeling realistic wireless networks, including rings, bidimensional grids, and cellular grids.</p>
INDEX TERMS
Wireless networks, channel assignment, interferences, rings, cellular grids, bidimensional grids, L(2, 1, 1){\hbox{-}}\rm coloring, L(\delta_1, 1, \ldots, 1){\hbox{-}}\rm coloring .
CITATION
Cristina M. Pinotti, Richard B. Tan, "Channel Assignment with Separation for Interference Avoidance in Wireless Networks", IEEE Transactions on Parallel & Distributed Systems, vol.14, no. 3, pp. 222-235, March 2003, doi:10.1109/TPDS.2003.1189581
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool