• 산업공학
• /
• 제18권4호
• /
• pp.382-389
• /
• 2005

Location management is very important issue in wireless communication system to trace mobile users' exact location. In this study, we propose a dynamic location area management scheme which determines the size of dynamic location area considering each user's characteristics. In determining the optimal location area size, we consider the measurement data as well as the historical data, which contains call arrival rate and average speed of each mobile user. In this mixture of data, the weight of historical data is derived by linear searching method which guarantees the minimal cost of location management. We also introduce the regularity index which can be calculated by using the autocorrelation of historical data itself. Statistical validation shows that the regularity index is the same as the weight of measurement data. As a result, the regularity index is utilized to incorporate the historical data into the measurement data. By applying the proposed scheme, the location management cost is shown to decrease. Numerical examples illustrate such an aspect of the proposed scheme.

• 한국정보과학회논문지:정보통신
• /
• 제30권1호
• /
• pp.48-64
• /
• 2003

최근 이동 단말 사용자의 폭발적인 증가로 인해 이동 통신 시스템에서 이동 단말 사용자의 위치 추적을 위한 위치 관리가 중요해지고 있다. 그러나, 이전의 위치 관기 기법들은 사용자의 이동 방향에 대한 고려 없이 정적인 이동 정보만을 사용하고 있다. 이러한 기법들은 불필요한 페이징을 초래하고, 결과적으로 위치 관리 비용을 증가시켰다. 본 논문에서는 이동 단말 사용사의 이동 특성을 고려한 새로운 위치 관리 기법을 제안한다. 제안하는 기법에서는 사용자의 이동성을 표현하는 방향 벡터를 정의하고 위치 등록이 발생한 셀로부터의 거리를 계산하기 위해 방향 벡터를 사용된다. 또한 방향 벡터의 상쇄 연산에 의해서 위치 등록의 수행 여부를 결정한다. 따라서, 사용자의 이동 방향 특성에 따라 사용자의 위치 영역이 동적으로 생성되며 페이징 영역의 폭도 동적으로 결정된다. 게다가, 본 논문에서는 제안하는 기법의 분석 모델을 제시한다. 비교를 위해서 거리 기반 기법을 또한 분석하였다. 수치적 분석 결과는 매우 낮은 CMR의 경우를 제외한 대부분의 경우에서 거리-기반 기법보다 효율적임을 보여준다. 특히, 사용자가 특정 방향으로 이동할수록, 제안하는 기법은 거리-기반 기법보다 낮은 위치 관리 비용을 갖는다.

• 한국정보통신학회논문지
• /
• 제13권9호
• /
• pp.1935-1940
• /
• 2009

WSN(Wireless Sensor Network)의 기술 요소 중의 하나는 센서 노드의 위치 관리이다. GPS, 초음파 센서, RSSI 등이 전형적인 노드의 위치 관리 방법이다. 본 논문에서는 센서 노드 위치 측정의 정확성을 향상시키기 위해 RSSI 측정에 회귀분석을 적용한 새로운 위치 관리 방식을 제안한다. 또한 기존 방식의 실험적인 결과와의 비교를 통해 제안된 방식의 성능을 평가한다. 결과에 따르면 우리 의 제안된 방식인 LM-RAR은 RSSI와 Friis 공식을 사용한 기존의 위치 관리 방식보다 향상된 정확성을 보인다.

• International Journal of Computer Science & Network Security
• /
• 제21권12spc호
• /
• pp.399-408
• /
• 2021

Information security reports four types of basic attacks on information. One of the attacks is named as fabrication. Even though mobile devices and applications are showing its maturity in terms of performance, security and ubiquity, location-based applications still faces challenges of quality of service, privacy, integrity, authentication among mobile devices and hence mobile users associated with the devices. There is always a continued fear as how location information of users or IoT appliances is used by third party LB Service providers. Even adversary or malicious attackers get hold of location information in transit or fraudulently hold this information. In this paper, location information fabrication scenarios are presented after knowing basic model of information attacks. Peer-to-Peer broadcast model of location privacy is proposed. This document contains introduction to fabrication, solutions to such threats, management of fabrication mitigation in collaborative or peer to peer location privacy and its cost analysis. There are various infrastructure components in Location Based Services such as Governance Server, Point of interest POI repository, POI service, End users, Intruders etc. Various algorithms are presented and analyzed for fabrication management, integrity, and authentication. Moreover, anti-fabrication mechanism is devised in the presence of trust. Over cost analysis is done for anti-fabrication management due to nature of various cryptographic combinations.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1090-1093
• /
• 2002

Location management schemes dealing with location information of moving terminals play an important role in the personal communications systems (PCS). Since the location management involves heavy signaling traffics to update the location information, reducing the location update cost becomes a critical research issue. This paper proposes a location management scheme which reduces the location update cost by employing the hierarchical structure in PCS environment. The paper also develops analytical models to evaluate the performance of the proposed scheme. The results obtained from the performance evaluation shows that the proposed scheme outperforms the conventional schemes in terms of the location update rates. Also, the difference in the performance becomes larger as the size of the location area (LA) becomes smaller and as the residual time of the mobile user becomes smaller.

• 경영과학
• /
• 제28권2호
• /
• pp.53-62
• /
• 2011

The objective of this paper is to propose a Binary Particle Swarm Optimization(BPSO) for design of reporting cell management system. The assignment of cells to reporting or non-reporting cells is an NP-complete problem having an exponential complexity in the Reporting Cell Location Management(RCLM) system. The number of reporting cells and which cell must be reporting cell should be determined to balance the registration(location update) and search(paging) operations to minimize the cost of RCLM system. Experimental results demonstrate that BPSO is an effective and competitive approach in fairly satisfactory results with respect to solution quality and execution time for the optimal design of location management system.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 I
• /
• pp.169-173
• /
• 2003

In this paper, we analyze a time-based update method in location management and calculate the optimal time-interval. We obtain the probability that an MT is j rings away from the center cell. And using these values, an exact analysis is made for the time-based location management cost. From the result, when the time-based method is applied to location update, we can get the optimal time-interval which minimizes the location management cost.

• 산업경영시스템학회지
• /
• 제39권2호
• /
• pp.46-53
• /
• 2016

In mobile communication systems, location management deals with the location determination of users in a network. One of the strategies used in location management is to partition the network into location areas. Each location area consists of a group of cells. The goal of location management is to partition the network into a number of location areas such that the total paging cost and handoff (or update) cost is a minimum. Finding the optimal number of location areas and the corresponding configuration of the partitioned network is a difficult combinatorial optimization problem. This cell grouping problem is to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking is a minimum in location area wireless network. In fact, this is shown to be an NP-complete problem in an earlier study. In this paper, artificial bee colony (ABC) is developed and proposed to obtain the best/optimal group of cells for location area planning for location management system. The performance of the artificial bee colony (ABC) is better than or similar to those of other population-based algorithms with the advantage of employing fewer control parameters. The important control parameter of ABC is only 'Limit' which is the number of trials after which a food source is assumed to be abandoned. Simulation results for 16, 36, and 64 cell grouping problems in wireless network show that the performance of our ABC is better than those alternatives such as ant colony optimization (ACO) and particle swarm optimization (PSO).

• 한국멀티미디어학회논문지
• /
• 제4권2호
• /
• pp.161-170
• /
• 2001

미래 이동 통신 시스템에서 중요한 기술적인 문제 중의 하나는 사용자와 단말기의 위치 관리 기술과 핸드오프 기술을 포함하는 이동성 관리 기술이다 본 논문에서는 IMT-2000 환경에 적합한 계층적 분산 동적 위치 관리 방법을 제안한다. 제안하는 방법에서는 위치 레지스터들로 클러스터를 구성하고, 그 클러스터들을 계층구조로 형성한다. 각 계층별 협동하는 다른 위치 관리 정책을 사용할 뿐만 아니라 다른 셀의 이동 단말기로부터의 국부 이동 단말기의 위치 질의 빈도를 고려한 위치 갱신 알고리즘을 사용한다. 그리고 분석적 모델을 통하여 제안하는 방법의 성능을 평가한다.

• 경영과학
• /
• 제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.