Abstract
Channel assignment techniques are used extensively in frequency reuse systems to assign time-frequency resources to each user. There are many methods of allocating a channel upon a new call arrival or handoff attempt. A good channel allocation algorithm is the one that yields high spectral efficiency for a specified quality of service (including link quality, probability of new call blocking, and the probability of forced termination) and given degree of computational complexity and decentralization of control. It keeps the planned cell boundaries intact, allocates a channel to a MS quickly, maintains the best service quality for the MS at any instant, and relieves undesired network congestion. This chapter first discusses basic channel assignment techniques, then presents the details of some techniques. These include centralized dynamic channel assignment techniques such as the optimal maximum packing scheme. Afterwards, decentralized and fully decentralized dynamic channel assignment techniques are discussed. Borrowing schemes are discussed as well, where radio resources from neighboring cells can be borrowed to improve spectral efficiency and performance. The chapter goes on to discuss directed retry and moving direction based handoff schemes. The chapter concludes with some examples of dynamic channel assignment schemes for TDMA based cellular systems.
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.
