It is known that the spectrum efficiency is improved by the reuse partitioning of a channel. This paper proposes a dynamic channel assignment algorithm in which each base station achieves the channel reuse partitioning autonomously while using channels. The principle of the proposed method is to assign the channel with a larger (or smaller) number to the mobile station closer to the base station. The proposed algorithm realizes autonomously the channel reuse partitioning in a distributed way, without the information exchange among the base stations. The in formation needed in determining the channel priority is derived by the base station by learning. The proposed method and other channel assignment methods are compared by a computer simulation, and it is shown that the large-capacity, the low interference rate, and the fast channel search can simultaneously be achieved.
|Number of pages||9|
|Journal||Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)|
|Publication status||Published - Jan 1 1997|
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering