Clique packing and dynamic channel assignment in cellular mobile communication systems
โ Scribed by Keisuke Nakano; Masakazu Sengoku; Shoji Shinoda; Takeo Abe
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 986 KB
- Volume
- 79
- Category
- Article
- ISSN
- 8756-6621
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper discusses the communication traffic characteristics of Dynamic Channel Assignment (DCA) in cellular mobile communication systems. In general, it is difficult theoretically to analyze the communication traffic characteristics of DCA. This paper proposes an approximate method called clique packing, for analyzing the bloclung probability performance of an idealized DCA. For calculating the blocking probability of clique packing, an approximate formula is derived which is based on the Erlang B formula and is in a simple form. It is shown that the numerical results of the approximate method agree with computer simulation results. blocking rate of the practical DCA methods, the simple formula for clique packing is used after modeling the practical DCA methods as clique packing. It is shown that the modeling is appropriate. This modeling enables the blocking rate of the practical DCA methods to be calculated by using the approximate formula for clique packing.
๐ SIMILAR VOLUMES
Transmitter power control is an effective technique to reduce co-channel interference and increase system capacity for cellular radio networks. Dynamic channel assignment can also be used to improve spectrum efficiency and thus increases the system capacity. This paper investigates channel assignmen
## Abstract In this paper, a new channel assignment strategy named compact dynamic channel assignment (CDCA) is proposed. The CDCA differs from other strategies by consistently keeping the system in the utmost optimal state, and thus the scheme allows to determine a call succeeding or failing by lo