Clique packing in cellular mobile communication systems
Keisuke Nakano, M. Sengoku, Shoji Shinoda, Takeo Abe · 2002
Clique packing, which is a model of an idealized dynamic channel assignment (DCA) method with complete optimization, is considered. Blocking probability of clique packing can be calculated by using a simple approximate formula based on the Erlang B formula. In this paper, it is shown that: modeling clique packing into practical DCA methods is possible; blocking probabilities of the practical DCA methods can be also calculated by using the simple formula for clique packing; analytical results of traffic characteristics of DCA in a cellular system which employs reuse-partitioning.