Abstract

In this paper, a new family of distributed dynamic channel assignment (DDCA) algorithms is presented, the DDCA with violation to the reuse pattern (DDCA with VRP). The DDCA algorithms with VRP allow to use carriers with at most one violation to the reuse pattern, under the restriction that both cells using simultaneously the same carrier must be the bound cells of their interference neighborhoods. Simulation and analytical results show the use of carriers with VRP is an effective strategy to increase the system capacity at the expense of an insignificant degradation of the quality of service. We evaluated five DDCA with VRP schemes, and all of them overcome the performance of the maximum packing (MP) algorithm, without the need of centralized coordination and global rearrangements.

Full Text
Published version (Free)

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