Achievable performance of dynamic channel assignment schemes under varyingreuse constraints

,We introduce a reward paradigm to derive novel bounds for the performance of dynamic channel assignment (DCA) schemes, In the case of uniform reuse, our bounds closely approach the performance of maximum packing (MP), which is an idealized DCA scheme, This suggests not only that the bounds are extr emely tight, hut also that no DCA scheme, however sophisticated, mill be ab le to achieve significant capacity gains beyond those obtained from MP. Our bounds extend to varying reuse scenarios which may arise in the case of reuse partitioning techniques, measurement-based DCA schemes, or micro-cel lular environments. In these cases, the bounds slightly diverge from the pe rformance of MP, which inflicts higher blocking on outer calls than inner c alls, but not to the extent required to maximize carried traffic. This refl ects the inherent tradeoff that arises in the case of varying reuse between efficiency and fairness. Asymptotic analysis confirms that schemes which m inimize blocking intrinsically favor inner calls over outer calls, whereas schemes which do not discriminate among calls inevitably produce higher net work-average blocking, Comparisons also indicate that DCA schemes are cruci al in fully extracting the potential capacity gains from tighter reuse.