By Topic

Channel assignment with separation for interference avoidance in wireless networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bertossi, A.A. ; Dept. of Comput. Sci., Bologna Univ., Italy ; Pinotti, C.M. ; Tan, R.B.

Given an integer σ>1, a vector (δ1, δ2,..., δσ-1), of nonnegative integers, and an undirected graph G=(V, E), an L(δ1, δ2,..., δσ-1)-coloring of G is a function f from the vertex set V to a set of nonnegative integers, such that |f(u)-f(v)|≥δi, if d(u,v)=i, for 11, δ2,..., δσ-1)-coloring for G is one using the smallest range λ 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 i must be at least δi apart, while the same channel can be reused in vertices whose distance is at least σ. In particular, two versions of the coloring problem - L(2, 1, 1) and L(δ1, 1,..., 1) - are considered. Since these versions of the problem are NP-hard 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.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:14 ,  Issue: 3 )