By Topic

An efficient technique for dynamic channel allocation (DCA) in mobile 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
$33 $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

2 Author(s)
S. Mandal ; Sch. of Manage., XLRI Jamshedpur, India ; D. Saha

The scarcity of radio channels is the main bottleneck in the enhancement of system capacity while maintaining quality of service (QoS) in mobile cellular networks. A channel allocation scheme, which can adapt the varying load of a network, may help to overcome that bottleneck to some extent. Thus, dynamic channel allocation (DCA) is an important problem in mobile cellular networks. In this paper, we have formulated the DCA problem as a state space search problem and solved it by using a heuristic search technique, which is a variant of the well-known depth first branch and bound (DFBB) search technique. We have compared the performance of this technique with two other existing meta-heuristic techniques, namely simulated annealing (SA), and tabu search (TS) with respect to the call blocking probability for varying load in a network. From experimental results, it is found that the proposed technique performs better than TS and SA in this problem domain.

Published in:

2005 IEEE International Conference on Personal Wireless Communications, 2005. ICPWC 2005.

Date of Conference:

23-25 Jan. 2005