By Topic

Optimal Routing and Traffic Scheduling for Multihop Cellular Networks Using Genetic 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
$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)
Lorenzo, B. ; Dept. of Commun. Eng., Univ. of Oulu, Oulu, Finland ; Glisic, S.

When considering a multicell scenario with nonuniform traffic distribution in multihop wireless networks, the search for the optimum topology becomes an NP-hard problem. For such problems, exact algorithms based on exhaustive search are only useful for small toy models, so heuristic algorithms such as genetic algorithms (GA) must be used in practice. For this purpose, we present a novel sequential genetic algorithm (SGA) to optimize the relaying topology in multihop cellular networks aware of the intercell interference and the spatial traffic distribution dynamics. We encode the topologies as a set of chromosomes and special crossover and mutation operations are proposed to search for the optimum topology. The performance is measured by a fitness function that includes the throughput, power consumption and delay. Improvement in the fitness function is sequentially controlled as newer generations evolve and whenever the improvement is sufficiently increased the current topology is updated by the new one having higher fitness. Numerical results show that SGA provides both high performance improvements in the system and fast convergence (at least one order of magnitude faster than exhaustive search) in a dynamic network environment. We also demonstrate the robustness of our algorithm to the initial state of the network.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:12 ,  Issue: 11 )