By Topic

Observations on using genetic-algorithms for channel allocation in mobile computing

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

2 Author(s)
Zomaya, A.Y. ; Sch. of Inf. Technol., Sydney Univ., NSW, Australia ; Wright, M.

This paper highlights the potential of using genetic algorithms to solve cellular resource allocation problems. The objective in this work is to gauge how well a GA-based channel borrower performs when compared to a greedy borrowing heuristic. This is needed to establish how suited GA-like (stochastic search) algorithms are for the solution of optimization problems in mobile computing environments. This involves the creation of a simple mobile networking resource environment and design of a GA-based channel borrower that works within this environment. A simulation environment is also built to compare the performance of the GA-based channel-borrowing method with the heuristic. To enhance the performance of the GA, extra attention is paid to developing an improved mutation operator. The performance of the new operator is evaluated against the heuristic borrowing scheme. For a real-time implementation, the GA needs to have the properties of a micro GA strategy. This involves making improvements to the crossover operator and evaluation procedure so the GA can converge to a "good" solution rapidly.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:13 ,  Issue: 9 )