Abstract

Various existing dynamic channel assignment (DCA) strategies are introduced first and a new distributed DCA algorithm is proposed in the paper. Based on local observations of the reuse cluster, the algorithm attempts to minimize the reuse distance of the allocated channels and to keep channel reassignments under control. System performance of the proposed algorithm is analysed and compared with other DCA algorithms. Simulation results show that, under certain conditions, the algorithm may approximate blocking performance of the centrally optimized maximum packing (MP) algorithm. >

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 call

Disclaimer: 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.