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

Full Text
Paper version not known

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