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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
