Self-organized reuse partitioning: A distributed dynamic channel assignment method in cellular systems

Hiroshi Furukawa, Yoshihiko Akaiwa

研究成果: ジャーナルへの寄稿記事

2 引用 (Scopus)

抄録

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.

元の言語英語
ページ(範囲)67-75
ページ数9
ジャーナルElectronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)
80
発行部数5
DOI
出版物ステータス出版済み - 1 1 1997

Fingerprint

Base stations
Computer simulation

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

これを引用

@article{fc9d00c670bf4b31bb8d32d99c4719b4,
title = "Self-organized reuse partitioning: A distributed dynamic channel assignment method in cellular systems",
abstract = "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.",
author = "Hiroshi Furukawa and Yoshihiko Akaiwa",
year = "1997",
month = "1",
day = "1",
doi = "10.1002/(SICI)1520-6424(199705)80:5<67::AID-ECJA7>3.0.CO;2-4",
language = "English",
volume = "80",
pages = "67--75",
journal = "Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)",
issn = "8756-6621",
publisher = "John Wiley and Sons Inc.",
number = "5",

}

TY - JOUR

T1 - Self-organized reuse partitioning

T2 - A distributed dynamic channel assignment method in cellular systems

AU - Furukawa, Hiroshi

AU - Akaiwa, Yoshihiko

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031145396&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031145396&partnerID=8YFLogxK

U2 - 10.1002/(SICI)1520-6424(199705)80:5<67::AID-ECJA7>3.0.CO;2-4

DO - 10.1002/(SICI)1520-6424(199705)80:5<67::AID-ECJA7>3.0.CO;2-4

M3 - Article

AN - SCOPUS:0031145396

VL - 80

SP - 67

EP - 75

JO - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

JF - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

SN - 8756-6621

IS - 5

ER -