Achievable Performance of Dynamic Channel Assignment Schemes Under Varying Re-Use Constraints

We introduce a reward paradigm to derive novel bounds for the performance of dynamic channel assignment (DCA) schemes. In the case of uniform re-use, our bounds closely approach the performance of Maximum Packing (MP), which is an idealized DCA scheme. This suggests not only that the bounds are extremely tight, but also that no DCA scheme, however sophisticated, will be able to achieve significant capacity gains beyond those obtained from MP.