By Topic

Using a New Heuristic Algorithm to Solve Channel Assignment Problems in Cellular Radio 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

1 Author(s)
Shirazi, S.A.G. ; Inf. & Commun. Technol. Fac., Tehran

In the channel assignment problem (CAP), frequencies are assigned to requested calls in a cellular mobile network subject to co-channel, adjacent channel and co-site constraints such that required bandwidth is minimized. In this paper, a new heuristic algorithm is proposed to solve the CAP and node-color and node-degree ordering of cells and row-wise and column-wise ordering of calls are used. The performance of proposed method is evaluated by solving 12 CAPs. Results show that this method can find more and better solutions with minimum required bandwidth in comparison with the other algorithms investigated in the paper. Other advantages of this method are convergence and simplicity

Published in:

Vehicular Technology Conference, 2006. VTC 2006-Spring. IEEE 63rd  (Volume:2 )

Date of Conference:

7-10 May 2006