Referenced Items are not available for this document.
An efficient heuristic algorithm is proposed for the channel assignment problem in cellular mobile systems. The merit of the algorithm is the improved repetitive ordering of requirements in sequences using the deterministic assignment difficulties. Benchmark problems are employed to validate the performance merit of the proposed algorithm and five other well-known channel assignment schemes. The relative merit of performance is measured in terms of the number of required channels, the percentage of assignment for a fixed number of available channels and the computational time. The study shows that the proposed algorithm is superior to the other investigated algorithms. It yields the optimal assignment for most of the benchmark problems and near-optimal assignment for other cases.
Published in:
Communications, IEE Proceedings
(Volume:146
,
Issue:
3
)
Date of Publication: June 1999
- Page(s):
- 196 - 200
- ISSN :
- 1350-2425
- INSPEC Accession Number:
- 6315150
- Digital Object Identifier :
- 10.1049/ip-com:19990396
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- June 1999
- Sponsored by :
- IET
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
