• Title, Summary, Keyword: Location Management

Search Result 2,638, Processing Time 0.063 seconds

A Taxonomy of Location Management in Mobile Ad Hoc Networks

  • Galluccio, Laura;Palazzo, Sergio
    • Journal of Communications and Networks
    • /
    • v.6 no.4
    • /
    • pp.397-402
    • /
    • 2004
  • Location management is difficult in ad hoc networks due to many features such as the lack of a wired infrastructure, the scarce energy, memory and processing capabilities of nodes, and nodes’ movement which leads to a dynamic topology. These characteristics make the location management schemes designed for mobile cellular networks inefficient for ad hoc networks. New solutions for location management have therefore been proposed in the literature in the recent past. In this paper, a taxonomy of location management strategies is presented; some of the more interesting approaches proposed in the literature are critically discussed, highlighting their advantages and disadvantages.

Implementation of GPS Based Location Management System (GPS를 이용한 위치관리시스템 구현)

  • Choi, Jae-Myeong;Kang, Heau-Jo;Lee, Sang-Heon
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.1
    • /
    • pp.15-21
    • /
    • 2008
  • In this paper, person monitoring and personal identification information management by using the location positioning device and the location management system based on GPS is analysed and developed. Mobile HTE(Mobile HTE : Mobile Home Terminal Equipment) of the developed system uses the module for transmitting PID(Personal Identification Device) information and the module based on GPS's location information. HTE transmits the received information from Mobile HTE to the Location Management System through the internet system. The Location Management System is developed for person location management and information management.

  • PDF

An Efficient Location Management Scheme based on Individual and Group Location Managements with Different Sized Location Areas in Mobile Communication Networks (이동통신 네트워크에서 서로 다른 크기의 위치 영역을 가지는 개별 및 그룹 위치 관리에 기반한 효과적인 위치 관리 기법)

  • Chung, Yun-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1B
    • /
    • pp.1-7
    • /
    • 2008
  • In group location management, when a transportation system(TS) with multiple mobile subscribers(MSs) changes location area(LA), location management is performed by group location registration by TS, instead of individual location registrations by MSs. In previous works, although it is assumed that LA in group location management is the same as that in individual location management, it is not appropriate to assume the same sized LAs since MSs in a TS have different characteristics from MSs which are not in a TS from the aspect of the speed and aggregate call arrival rates. Thus, in this paper, we propose an efficient location management scheme based on individual and group location managements with different sized LAs, and the performance of the proposed scheme is analyzed from the aspect of signaling cost at the wireless interface. Results reveal that the proposed scheme outperforms the conventional scheme by selecting an appropriate sized LA for group location management.

Hierarchical Structured Multi-agent for Distributed Databases in Location Based Services

  • Mateo Romeo Mark A.;Lee Jaewan;Kwon Oh-Hyun
    • The Journal of Information Systems
    • /
    • v.14 no.3
    • /
    • pp.17-22
    • /
    • 2005
  • Location management is very important in location-based services to provide services to the mobile users like banking, city guides and many more. Ubiquitous and mobile devices are the source of data in location management and its significant operations are update and search method. Some studies to improve these were presented by using optimal sequential paging, location area scheme and hierarchical database scheme. In addition, not all location services have the same access methods on data and it lead to difficulties of providing services. A proposed location management of multi-agent architecture is presented in this study. It shows the coordination of the agents on the distributed database of location-based services. The proposal focuses on the location management of the mobile object presented in a hierarchical search and update. Also, it uses a nearest neighbor technique for efficient search method of mobile objects.

  • PDF

Dynamic Location Area Management Scheme Using the Historical Data of a Mobile User (이동통신 사용자의 이력 자료를 고려한 동적 위치영역 관리 기법)

  • Lee, J.S.;Chang, I.K.;Hong, J.W.;Lie, C.H.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • /
    • pp.119-126
    • /
    • 2004
  • 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 characteristic. 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.

  • PDF

Optimal Time-Interval for Time-based Location Update in Mobile Communications

  • Lee, Goo-Yeon
    • Journal of Industrial Technology
    • /
    • v.21 no.B
    • /
    • pp.85-89
    • /
    • 2001
  • In this paper, we analyze a time-based update method in location management and calculate the optimal time-interval. The probability that an MT is j rings away from the center cell is obtained by computer programming. 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.

  • PDF

Dynamic Location Management with Hierarchical Location Area (계층적 위치 지역을 이용한 동적 위치 관리 기법)

  • Lee, Chan-Oh;Kim, Myung-Il;Kim, Sung-Jo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.661-663
    • /
    • 2002
  • This paper introduces a dynamic location management with hierarchical location area, which helps in reducing location update(LU) and paging cost and hence total location management cost. Users are assigned to appropriate location area level utilizing the call-to-mobility ratio(CMR) value. CMR values are calculated each time a user enters a new cell by computing its mobility rate and incoming call rate, which are the two key factors for defining the size of the location area.

  • PDF

The Analysis of the Location Management Strategy Based on the Call Arrival Probability(CAP) in Mobile Communication (이동 통신에서 호 수신 확률에 근거한 위치 관리 기법의 분석)

  • Park, Sun-Young;Jang, Seong-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.7
    • /
    • pp.1-6
    • /
    • 2005
  • Now that the reduction of the cell size in order to serve the increasing subscribers has raised the frequency of the location update, it has increased the cost of location management. In this paper, we show that the location management strategy based on the call arrival probability(CAP) can reduce the cost of the location management by analyzing that cost in this strategy which was proposed in [1] to reduce the cost of the location management in mobile communication. And we compare the location management cost by analyzing with that by simulating.

Dynamic Location Area Management Scheme Using the Historical Data of a Mobile User (이동통신 사용자의 이력자료를 고려한 동적 위치영역 관리기법)

  • Lee, J.S.;Chang, I.K.;Hong, J.W.;Lie, C.H.
    • IE interfaces
    • /
    • v.18 no.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.

Optimal Design of Location Management Using Particle Swarm Optimization (파티클군집최적화 방법을 적용한 위치관리시스템 최적 설계)

  • Byeon, Ji-Hwan;Kim, Sung-Soo;Jang, Si-Hwan;Kim, Yeon-Soo
    • Korean Management Science Review
    • /
    • v.29 no.1
    • /
    • pp.143-152
    • /
    • 2012
  • Location area planning (LAP) problem is to partition the cellular/mobile network into location areas with the objective of minimizing the total cost in location management. The minimum cost has two components namely location update cost and searching cost. Location update cost is incurred when the user changes itself from one location area to another in the network. The searching cost incurred when a call arrives, the search is done only in the location area to find the user. 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. This partitioning problem is a difficult combinatorial optimization problem. In this paper, we use particle swarm optimization (PSO) to obtain the best/optimal group of cells for 16, 36, 49, and 64 cells network. Experimental studies illustrate that PSO is more efficient and surpasses those of precious studies for these benchmarking problems.