Abstract
In this paper, a dynamic channel assignment scheme is proposed. In this scheme, when a call originates in a high capacity network cell, and if all the channels in it are busy, it looks for a channel to be borrowed from the neighboring cell, which has most number of idle channels. If the cell has to borrow a channel from any of its neighboring cell then the particular channel has to be blocked in the re-use cells. But geographically it is enough if it blocks the channel in two co-channel cells, where the co-channel interference is pronounced. This deals to the concept of Borrowed Channel allocation with Directional Locking. The aim of the paper is to find the difficulties in lending a channel to a neighboring cell and thus develop an algorithm which overcomes the restrictions imposed by this new channel allocation scheme.
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.
