Bounds and Performance Networks of Reuse Partitioning in Cellular

In this paper we study a scheme that allows asmooth increase of the capacity of a cellular system forcircuit switching by applying cell partitioning andusing dynamic channel allocation techniques. A bound is computed for this reuse partitioningscheme that gives the maximum theoretical gainaccomplished in the system bandwidth. The performance ofthe proposed scheme in terms of blocking probability is evaluated both when the position of themobiles remains unchanged and when mobility is takeninto account. The numerical results show that thecapacity of the proposed scheme is sensibly higher than that of a fixed allocation scheme.