Abstract
This paper proposes a sequential trellis search algorithm for solving channel assignment problem in cellular radio networks. Traffic channels are assigned using a step-by-step procedure that minimizes the bandwidth required while satisfying the interference constraints. Minimum bandwidth is achieved by the sequential trellis search algorithm through the removal of redundant assignments (measured by a metric called excess frequency factor) from further consideration and keeping only the survivors after each step of channel assignment. Application of the proposed algorithm to nineteen benchmark problems show bandwidth requirements that closely match or sometimes are better than those of the existing channel assignment algorithms and with fast execution time.
Sign-in/Register to access full text options 
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.
