• 경영과학
• /
• 제25권2호
• /
• pp.73-80
• /
• 2008

The location area planning is to assign cells to the location areas of a wireless communication network in an optimum manner. The two important cost components are cost of location update and cost of paging that are of conflicting in nature; i.e., minimizing the registration cost might increase the search cost. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. In fact this is shown to be an NP-complete problem in an earlier study. In this paper, we use an ant colony optimization method to obtain the best/optimal group of cells for a given a network.

• 한국정보처리학회논문지
• /
• 제3권5호
• /
• pp.1179-1186
• /
• 1996

셀룰라 이동 통신 시스템에서 기존의 위치 영역 할당 기법은 이동 가입자의 이동 속도와 호 설정 요구율에 따라 최적의 위치 등록 비용과 페이징 비용을 갖는 위치 영역 크기를 할당하여 이동 통신시스템의 부담을 줄이고 있다. 그러나 이것은 시스 템의 일정 패턴에 따라 모든 가입자의 위치 영역을 할당하기 때문에 개개의 이동 가입 자의 다른 이동 패턴을 고려하지 못하고 있다. 또한 속도가 빠른 이동 가입자의 경우, 위치등록 빈도수를 줄이기 위해 큰 위치 영역을 할당하기 때문에 호 설정 요구 시 큰 페이징 비용을 초래할 수밖에 없다. 본 논문에서는 각 이동 가입자의 이동도에 따라 현재의 위치를 중심으로 동적으로 위치 영역을 할당해 주는 방안을 제안하였다. 그 결과 새로운 위치 등록 후 이루어지는 이동의 경우, 위치 등록 빈도가 줄어들며 이동도가 높은 가입자에게는 넓은 위치 영역을 할당하여 위치 등록 부담을 줄이고 실제 페이징은 적은 영역에만 페이징함으로써 성능을 높였다.

• 대한산업공학회지
• /
• 제28권4호
• /
• pp.425-434
• /
• 2002

Mobility of service users makes location update and paging (L/P) procedures indispensable features in mobile communication networks. Importance of optimizing the configuration of L/P areas has been increased by the growth of L/P related signaling. In this study, we deal with the L/P configuration which an LA (Location Area) may contain multiple PAs (Paging Areas). Given the network topology, L/P related parameters, and traffics generated by each cell, is provided the problem of finding optimal LA/PA configuration minimizing the amount of L/P related signaling. The optimization problem is solved using a simulated annealing, and detailed computational results are conducted to capture the effects of mobility, call arrival patterns and boundary crossing rate on the LA and PA configurations.

• 한국항행학회논문지
• /
• 제10권4호
• /
• pp.291-298
• /
• 2006

본 논문에서는 이동통신의 무선망 구간에서 페이징(paging) 용량을 최대화하기 위한 지능형 페이징 기법을 제안하였다. 한정된 무선 자원을 효율적으로 이용하기 위하여 지능형 페이징 기법들이 연구되어 왔는데 이 방식에서는 위치 영역을 여러 개의 작은 페이징 영역들로 나누어서 순차적으로 찾아나간다. 기존의 지능형 페이징 방식에서는 주로 페이징 대상 단말의 위치 확률 분포를 이용하여 페이징 영역들을 도출한다. 하지만, 이러한 접근 방식들은 각 셀마다 페이징 트래픽이 불균등하게 분포되는 문제를 가진다. 이에 따라서 전체적으로 낮은 페이징 부하 상황에서도 페이징 트래픽이 병목인 셀이 존재하고 이 셀의 기지국 페이징 메시지 큐가 넘침으로써 페이징 메시지가 손실되는 문제가 발생하게 된다. 제안하는 방식에서는 각 셀의 페이징 트래픽 분포 상황을 감안하여 페이징 트래픽을 가능하면 셀마다 균등하게 분포하도록 페이징 영역을 결정한다. 성능 평가 결과 제안하는 방식은 페이징 처리 용량 측면에서 기존 방식들에 비해서 월등히 좋은 성능을 보임을 확인할 수 있었다.

• 경영과학
• /
• 제26권3호
• /
• pp.23-35
• /
• 2009

This study deals with the location management in WCDMA (Wideband Code Division Multiple Access) networks. The new location management method is the one of the many techniques used to provide the packet switched (PS) services effectively in WCDMA networks. WCDMA introduces RA (routing area) for the PS services in addition to LA (location area) for the circuit switched (CS) services. WCDMA system also adopts the cooperative paging and the combined area update which are to decrease signaling traffic using the PS network resources for the CS services. Considering the characteristics of the WCDMA networks, this study formulate into the mathematical programming problem for the location management. Rather than the existing researches which consider the single MSC/SGSN networks, we deal with the multi MSC/SGSN networks, where both MSC area and SGSN area should be determined as well. Fairness between traffic loads of MSC/SGSN and the system cost incurred to MSC/SGSN are also incorporated into our model, which make the model more realistic. We propose greedy algorithms for the problems, which consists of the merger of two neighboring areas and the movement of an area. Extensive experiment has been done based on the realistic problem examples. Followed by the analysis of parameter effect on the final solutions and the quality of final solutions obtained by our greedy algorithms. Our proposed model and analysis result can be used to determine WCDMA system areas and to predict the system performance measures by the determination.

• 한국시뮬레이션학회논문지
• /
• 제14권4호
• /
• pp.77-86
• /
• 2005

[ $IP^2$ ] (IP-based IMT Network Platform) is a ubiquitous platform supporting mobility using two step If address IPha (IP host address) and IPra (IP routing address) - in a backbone network. MN (Mobile Node) in $IP^2$ maintains either Active or Dormant state, which is transferred to Active state through Paging process when communication is required. In this paper, we proposed a Paging method using proxy to resolve the problem of the conventional Paging method which transmits the Paging messages to all cells in LA (Location Area) resulting in the excessive use of network resources. Performanceevaluation of the proposed method using NS-2 showed that the usage of network resources becomes more efficient by reducing paging loads, especially under the condition of increased nodes.

• 대한산업공학회지
• /
• 제29권4호
• /
• pp.292-303
• /
• 2003

An efficient mobility management for mobile stations plays an important role in mobile communication network. Two basic operations of mobility management are location registration and paging. A zone-based registration (ZBR) is implemented in most of mobile communication systems and we consider the mobility management scheme that combines a zone-based registration and a selective paging (SP). We propose new analytical model that can reflect on the characteristics of the ZBR based on 2-dimensional random walk mobility model and more efficient paging schemes considering the proposed model. We evaluate the performance of the mobility management scheme with our mobility model to determine the optimal size of location area that will result in the minimum signaling traffic on radio channels. Numerical results are provided to demonstrate that our mobility model is useful to evaluate the ZBR more exactly.

• 한국멀티미디어학회논문지
• /
• 제13권6호
• /
• pp.901-910
• /
• 2010

$IP^2$, as an extended concept of the next generation IMT network, is a concept of basically supporting mobility using two steps of IP address (i.e. IPha (IP Host address) and IPra (IP routing address)) in IP backbone network. Current $IP^2$system has a shortcoming of excess usage of network resources caused by sending paging messages to all cells in LA (Location Area) in paging procedure. Considering the evolving direction of network, which is taking mobility with various speed and integration of devices into consideration, this shortcoming must be overcome. In this paper, we proposed a method to reduce time and memory for paging by maintaining current information of MN (Mobile Node) not in Active state with proxy server. Performance evaluation based on NS-2 simulations has shown that the efficiency of network resources is improved in the proposed method.

• 정보처리학회논문지C
• /
• 제8C권5호
• /
• pp.677-682
• /
• 2001

가입자의 셀 간 이동이 빈번해지는 마이크로 셀 환경에서는 위치 갱신 등의 처리를 위해 신호 트래픽의 양이 급격히 증가한다. 이러한 오버헤드를 줄이기 위한 한 방법으로서, 본 논문은 각 가입자의 이동 특성에 따라 각 가입자에게 크기 및 모양이 다른 위치영역과 페이징 영역을 동적으로 할당해 주는 알고리즘을 제시한다. 수학적 분석 결과, 이 방식을 사용할 경우 기존 영역 관리 방식의 사용에 비해 영역 관리 비용의 절감을 가져옴을 알 수 있다.

• 한국경영과학회지
• /
• 제28권3호
• /
• pp.67-79
• /
• 2003

An efficient mobility management for mobile stations plays an important role in mobile communication networks. Even though many a mobility management schemes have been proposed, most of mobile communication networks adopt the mobility scheme based on zone-based registration. This paper studies the mobility management scheme that combines zone-based registration and 2-step selective paging. We assume cell by cell registration area, not ring by ring registration area of previous studies, and set up a new mobility model based on 2-dimensional random walk model considering the characteristic of zone-based registration to evaluate its performance exactly. We provide numerical results using proposed model to demonstrate the performance of zone-based registration and 2-step selective paging under various circumstances.