By Topic

Dynamic channel assignment in TDMA mobile cellular systems using hybrid discrete binary differential evolution algorithm

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

3 Author(s)
Deepak Kumar Singh ; Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute, Agra, Uttar Pradesh, India, 282110 ; K. Srinivas ; D. Bhagwan Das

Dynamic Channel Assignment (DCA) assigns the channels to the cells dynamically according to traffic demand, and hence, can provide higher capacity (or lower call blocking probability), fidelity and quality of service than the fixed assignment schemes. The objective of a Channel Assignment Problem (CAP) is to assign appropriate number of required channels to each cell in a way to achieve both efficient frequency spectrum utilization and minimization of interference effects (by satisfying a number of channel reuse constraints). Channel assignment algorithms are formulated as combinatorial optimization problems and are NP-hard. Devising a DCA, that is practical, efficient, and which can generate high quality assignments, is challenging. Though Metaheuristic Search techniques like Evolutionary Algorithms, Differential Evolution, Particle Swarm Optimization prove effective in the solution of Fixed Channel Assignment (FCA) problems but they still require high computational time and therefore may be inefficient for DCA. A number of approaches have been proposed for the solution of DCA problem but the high complexity of these proposed approaches makes them unsuitable/less efficient for practical use. Therefore, this paper presents an effective and efficient Hybrid Discrete Binary Differential Evolution Algorithm (HDB-DE) for the solution of DCA Problem.

Published in:

Information Systems and Technologies (CISTI), 2012 7th Iberian Conference on

Date of Conference:

20-23 June 2012