Distributed dynamic channel allocation (DCA) algorithms for wireless cellular networks are considered. Two algorithm extremes are the baseline of the investigation, i.e., an aggressive algorithm, in which channel assignments of ongoing calls may be reconfigured to make room for a new access request, and a timid one, in which reconfiguration is not permitted. It is shown that a light traffic analysis can be tractable. For that realm, performance expressions are derived, showing significant reductions in access blocking probability, when an aggressive, rather than timid, access algorithm is used. The relative efficacy of various algorithms can be analytically probed in this range. Certain aggressive algorithms are observed to attain the best performance possible.< >
Leonard J. CiminiG.J. FoschiniI Chih‐LinZoran Miljanić
Leonard J. CiminiG.J. FoschiniI Chik-Lin
Leonard J. CiminiG.J. FoschiniI C.-L.