(A) study on channel assignment policies in cellular mobile telephone systems이동통신 시스템의 주파수채널 할당정책에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 496
  • Download : 0
A channel assignment problem is to develop efficient channel assignment policies that can maximize the number of calls served in cellular mobile systems. This problem is one of the most important problems in the design and operation of cellular mobile systems. In the future, the number of subscribers will increase more rapidly and hence the number of cells will also increase more rapidly. Thus this problem will be much more important. Channel assignment policies can be roughly classified into two categories: fixed channel assignment (FCA) and dynamic channel assignment (DCA). FCA is to assign a fixed channel to a call appearing in each cell, where the fixed channel is one of channels allocated to the cell in advance. In FCA, it counts how channels are allocated to each cell in advance. On the other hand, DCA is to assign a fixed or dynamic channel to a call, where the dynamic channel is one of channels allocated to common pools and used in several cells. In DCA, it is interesting how dynamic channels are assigned to calls in each cell. In this thesis, we have dealt with a minimum span problem for FCA, and a hybrid channel assignment (HCA) problem and a borrowing channel assignment (BCA) problem for DCA. MSP is to minimize the span, i.e., the number of channels which are required to satisfy a given grade of service for a cellular system, subject to the channel separation constraints. To solve the problem, we have suggested how to reduce a considered system to a smaller system by using a clustering concept, and how to partition the reduced system into several parts, and then a heuristic algorithm based on these two methods. A basic idea of solving a partitioned problem is to maximize the separation between channels assigned to any two nearest cells. We have compared the computational results of our algorithm with those of existing algorithms. In HCA, each cell has more than two types of channel sets, where one type of channel set consists of fixed channels and...
Advisors
Kim, Se-Hunresearcher김세헌researcher
Description
한국과학기술원 : 경영과학과,
Publisher
한국과학기술원
Issue Date
1995
Identifier
101795/325007 / 000835710
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 경영과학과, 1995.8, [ vi, 128 p. ]

Keywords

Hybrid Channel Assignment; Minimum Span Problem; Cellular Mobile System; Channel Borrowing Assignment; 차용채널할당; 혼합채널할당; 최소스팬문제; 이동통신시스템

URI
http://hdl.handle.net/10203/43673
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=101795&flag=dissertation
Appears in Collection
MG-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0