DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Tcha, Dong-Wan | - |
dc.contributor.advisor | 차동완 | - |
dc.contributor.author | Choi, Taek-Jin | - |
dc.contributor.author | 최택진 | - |
dc.date.accessioned | 2011-12-27T04:17:14Z | - |
dc.date.available | 2011-12-27T04:17:14Z | - |
dc.date.issued | 1996 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=108864&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/53256 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 산업경영학과, 1996.2, [ v, 97 p. ] | - |
dc.description.abstract | This thesis is concerned with some optimization models for frequency resource management in a cellular system. Frequency resource management includes frequency channel assignment and operation. First, we consider the Frequency Assignment Problem (FAP) for a system with nonhomogeneous traffic distribution and the interference-related constraints. Most of the heuristic algorithms for the FAP have adopted sequential assignment algorithms developed for the Graph Coloring Problem (GCP). In this study, we consider two representative frequency assignment strategies, the frequency exhaustive strategy (FES) and the requirement exhaustive strategy (RES), which are adopted by most of such heuristic algorithms for the FAP. We first show that there always exists an order of the requirement list which provides an optimal assignment with the FES, while the RES doesn``t always have such an order. We will also present two polynomial time heuristic algorithms, one for each strategy. Our second model deals with the so-called Perturbation-Minimizing Frequency Assignment Problem (PMFAP), the objective of which is to assign the available frequency channels for newly generated channel requirements at the minimum reassignment of the preassigned frequencies while meeting the compatibility constraints. For developing the heuristic algorithm for the PMFAP, we adopt the rearrangement technique, which rearranges some of the already assigned frequencies in order to assign frequencies into some more of the new requirements. Generally, subscriber mobility in cellular mobile system is controlled through location updating based on the so-called location area (LA), the basic area unit for paging which consists of a number of cells. There is a tradeoff relation between the two kinds of signalling traffic: paging and location updating. As LAs become bigger consisting of a larger number of cells, the traffic volume for paging increases while that for location updating decreases. This realization... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Paging | - |
dc.subject | Location area | - |
dc.subject | Frequency assignment | - |
dc.subject | Cellular system | - |
dc.subject | Location updating | - |
dc.subject | 위치갱신 | - |
dc.subject | 페이징 | - |
dc.subject | 위치영역 | - |
dc.subject | 주파수할당 | - |
dc.subject | 셀룰라시스템 | - |
dc.title | Otimization models for frequency channel management in a cellular system | - |
dc.title.alternative | 셀룰러시스템에서의 주파수채널 관리를 위한 최적화 모형에 관한 연구 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 108864/325007 | - |
dc.description.department | 한국과학기술원 : 산업경영학과, | - |
dc.identifier.uid | 000895522 | - |
dc.contributor.localauthor | Tcha, Dong-Wan | - |
dc.contributor.localauthor | 차동완 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.