Genetic inspired channel assignment schemes for cellular systems

Harilaos G. Sandalidis, Peter Stavroulakis and Joe Rodriguez-Tellez

Mathematics and Computers in Simulation (MATCOM), 2000, vol. 51, issue 3, 273-286

Abstract: Channel allocation schemes in a cellular network can be modeled as combinatorial optimization problems. Genetic algorithms (GAs) have been shown to be effective and robust tools in providing adequate solutions of such problems. This paper investigates the application of GAs to two common assignment strategies from the field of cellular communications: the dynamic (DCA) and the borrowing channel assignment (BCA). In both schemes, channel allocation is formulated as a discrete energy minimization problem and can be put in proper genetic representation. A computer simulation model examines the performance of the proposed GA-DCA and GA-BCA schemes for uniform and non-uniform traffic distributions under the effect of cochannel and adjacent channel interference constraints.

Keywords: Cellular communications; Genetic algorithms (GAs); Combinatorial optimization; Channel assignment (search for similar items in EconPapers)
Date: 2000
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475499001238
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:51:y:2000:i:3:p:273-286

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().