Abstract
This paper describes an efficient heuristic algorithm for the channel assignment problem (CAP) in cellular mobile systems. The channel assignment scheme proposed here is based on repetitive ordering of requirements in sequences. The performance of the proposed algorithm is verified by several benchmark problems and found to be superior than other existing methods. The study show that the proposed algorithm yields optimal assignment in most of the cases and near-optimal assignment in other cases.
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.
