By Topic

Optimal algorithms for channel assignment in a class of wireless cellular 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

4 Author(s)
Zi-ming Duan ; Coll. of Sci., China Univ. of Min. & Technol., Xuzhou, China ; Ping-li Lv ; Lian-ying Miao ; Zheng-ke Miao

Wireless cellular networks are often modelled as different regular grids and the channel assignment problem for interference avoidance is formulated as a coloring problem of the grid graph, where channels assigned to interfering stations at distance i must be at least δi apart, while the same channel can be reused in stations whose distance is at least σ. In this paper, we consider the channel assignment problem in a class of wireless cellular networks modelled as such regular grids which can be obtained by adding two edges to connect two pair of diagonal vertices of every square cell in the square grids. We confine our discussion to the case that the co-channel reuse distance σ is 4. We present one channel assignment algorithm for the case where the minimum channel separation δi is 1 for all but adjacent stations and δ1 ≥ 3 for adjacent stations, which is proved to be optimal. Also we present one potential optimal algorithm for the case that the minimum channel separation δi is σ-i.

Published in:

Computer Engineering and Technology (ICCET), 2010 2nd International Conference on  (Volume:3 )

Date of Conference:

16-18 April 2010