In mobile communication systems using Dynamic Channel Assignment, channels are possible to be rearranged so that blocking probability can be made low. The smaller the number of cells where channels are rearranged, the smaller the load on the base stations in the cells. Also, we can reduce the deterioration of communication quality caused by reassingning a new channel to a call instead of the channel already assigned. In this paper, we consider not only how to rearrange channels but also which channel should be rearranged and assigned to a new call in rearrangement, and propose very simple but effective methods for rearrangement. The ways to select a candidate channel to be rearranged and assigned to a new call in the new methods make the number of cells where a channel is rearranged smaller. We also examine the relations between characteristics and the number of cells where a channel is rearranged. Using computer simulation results, the properties of the new rearrangement methods are compared with those of the traditional methods.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Keisuke NAKANO, Masakazu SENGOKU, Toshihiko TAKAHASHI, Yoshio YAMAGUCHI, Shoji SHINODA, Takeo ABE, "Rearrangement Methods of Dynamic Channel Assignment in Cellular Mobile Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E75-A, no. 12, pp. 1660-1666, December 1992, doi: .
Abstract: In mobile communication systems using Dynamic Channel Assignment, channels are possible to be rearranged so that blocking probability can be made low. The smaller the number of cells where channels are rearranged, the smaller the load on the base stations in the cells. Also, we can reduce the deterioration of communication quality caused by reassingning a new channel to a call instead of the channel already assigned. In this paper, we consider not only how to rearrange channels but also which channel should be rearranged and assigned to a new call in rearrangement, and propose very simple but effective methods for rearrangement. The ways to select a candidate channel to be rearranged and assigned to a new call in the new methods make the number of cells where a channel is rearranged smaller. We also examine the relations between characteristics and the number of cells where a channel is rearranged. Using computer simulation results, the properties of the new rearrangement methods are compared with those of the traditional methods.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_12_1660/_p
Copy
@ARTICLE{e75-a_12_1660,
author={Keisuke NAKANO, Masakazu SENGOKU, Toshihiko TAKAHASHI, Yoshio YAMAGUCHI, Shoji SHINODA, Takeo ABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Rearrangement Methods of Dynamic Channel Assignment in Cellular Mobile Systems},
year={1992},
volume={E75-A},
number={12},
pages={1660-1666},
abstract={In mobile communication systems using Dynamic Channel Assignment, channels are possible to be rearranged so that blocking probability can be made low. The smaller the number of cells where channels are rearranged, the smaller the load on the base stations in the cells. Also, we can reduce the deterioration of communication quality caused by reassingning a new channel to a call instead of the channel already assigned. In this paper, we consider not only how to rearrange channels but also which channel should be rearranged and assigned to a new call in rearrangement, and propose very simple but effective methods for rearrangement. The ways to select a candidate channel to be rearranged and assigned to a new call in the new methods make the number of cells where a channel is rearranged smaller. We also examine the relations between characteristics and the number of cells where a channel is rearranged. Using computer simulation results, the properties of the new rearrangement methods are compared with those of the traditional methods.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Rearrangement Methods of Dynamic Channel Assignment in Cellular Mobile Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1660
EP - 1666
AU - Keisuke NAKANO
AU - Masakazu SENGOKU
AU - Toshihiko TAKAHASHI
AU - Yoshio YAMAGUCHI
AU - Shoji SHINODA
AU - Takeo ABE
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 1992
AB - In mobile communication systems using Dynamic Channel Assignment, channels are possible to be rearranged so that blocking probability can be made low. The smaller the number of cells where channels are rearranged, the smaller the load on the base stations in the cells. Also, we can reduce the deterioration of communication quality caused by reassingning a new channel to a call instead of the channel already assigned. In this paper, we consider not only how to rearrange channels but also which channel should be rearranged and assigned to a new call in rearrangement, and propose very simple but effective methods for rearrangement. The ways to select a candidate channel to be rearranged and assigned to a new call in the new methods make the number of cells where a channel is rearranged smaller. We also examine the relations between characteristics and the number of cells where a channel is rearranged. Using computer simulation results, the properties of the new rearrangement methods are compared with those of the traditional methods.
ER -