Load Balancing in Heterogeneous Networks using an Evolutionary Algorithm

Files in This Item:
File Description SizeFormat 
Fenton M. Lynch D. Kucera S. Claussen H. O'Neill M. (2015) (preprint).pdf1.2 MBAdobe PDFDownload
Title: Load Balancing in Heterogeneous Networks using an Evolutionary Algorithm
Authors: Fenton, Michael
Lynch, David
Kucera, Stepan
Claussen, Holger
O'Neill, Michael
Permanent link: http://hdl.handle.net/10197/7297
Date: 28-May-2015
Abstract: Grammatical Evolution (GE) is applied to the problem of load balancing in heterogeneous cellular network deployments (HetNets). HetNets are multi-tiered cellular networks for which load balancing is a scalable means to maximise network capacity, assuming similar traffic from all users. This paper describes a proof of concept study in which GE is used in a genetic algorithm-like way to evolve constants which represent cell power and selection bias in order to achieve load balancing in HetNets. A fitness metric is derived to achieve load balancing both locally in sectors and globally across tiers. Initial results show promise for GE as a heuristic for load balancing. This finding motivates a more sophisticated grammar to bring enhanced Inter-Cell Interference Coordination optimisation into an evolutionary framework.
Funding Details: Science Foundation Ireland
Type of material: Conference Publication
Publisher: IEEE
Start page: 70
End page: 76
Copyright (published version): 2015 IEEE
Keywords: Grammatical evolutionLoad balancingCellular networks
DOI: 10.1109/CEC.2015.7256876
Other versions: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7256876
Language: en
Status of Item: Peer reviewed
Conference Details: 2015 IEEE Congress on Evolutionary Computation (IEEE CEC), Sendai, Japan, 25 - 28 May 2015
Appears in Collections:Business Research Collection
CASL Research Collection

Show full item record

Citations 50

Last Week
Last month
checked on Oct 11, 2018

Google ScholarTM



This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.