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

• 전자공학회논문지A
• /
• 제30A권11호
• /
• pp.21-28
• /
• 1993

Decoding algorithm of noncyclic Reed-Solomon codes consists of four steps which are to compute syndromes, to find error-location polynomial, to decide error-location, and to solve error-values. There is a decoding method by which the computation of both error-location polynomial and error-evaluator polynimial can be avoided in conventional decoding methods using Euclid algorithm. The disadvantage of this method is that the same amount of computation is needed that is equivalent to solve the avoided polynomial. This paper considers the division method on polynomial on GF(2$^{m}$) systematically. And proposes a novel method to find error correcting polynomial by simple mathematical expression without the same amount of computation to find the two avoided polynomial. Especially. proposes the method which the amount of computation to find F (x) from the division M(x) by x, (x-1),....(x--${\alpha}^{n-2}$) respectively can be avoided. By applying the simple expression to decoding procedure on RS codes, propses a new decoding algorithm, and to show the validity of presented method, computer simulation is performed.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 하계학술대회 논문집 A
• /
• pp.157-159
• /
• 2003

To improve power quality, it is important to find the location of disturbance source. This paper presents a method to find the location of disturbance source that leads to voltage sag. The relative location of the source is defined and the method to determine the relative location of voltage sag is proposed. With this method, this paper shows that the location of disturbance source can be identified under distributed monitoring system.

• ETRI Journal
• /
• 제37권6호
• /
• pp.1087-1095
• /
• 2015

Mobility management is important in mobile cellular networks. In this study, we considered an enhanced location-based registration (ELR) method. In the ELR method, even when a mobile phone enters a cell to find that the cell is already on its list (of visited cells) and then updates its main counter, it does not remove any cells from the list (memory space permitting), which gives better performance than the location-based registration (LR) method. However, the location registration cost of the ELR method is still high, and there is a lot of room for improvement with regards to this matter. We now propose an improved version of the ELR method; namely, the improved ELR (iELR). In the iELR method, when a mobile phone enters a cell to find that the cell counter value is less than the main counter value, or when a mobile phone enters a cell to register its location, it updates the main counter and the cell counter values as much as possible to reduce the future need for registrations. We show that our proposed iELR method provides better performance than the ELR method.

• 디지털콘텐츠학회 논문지
• /
• 제13권1호
• /
• pp.53-60
• /
• 2012

최근 수많은 모바일 어플리케이션이 개발되고 있는 가운데 위치기반 서비스(Location Based Service)를 이용하여 위치정보를 제공하는 어플리케이션들이 인기를 얻고 있다. 예를 들어 스마트폰은 기기 안에 장착된 GPS 칩을 이용하여 프로그램을 실행 시키는 것만으로 나의 위치를 찾을 수 있고 목적지의 위치를 쉽게 찾을 수 있다. 하지만 이러한 기존의 위치정보제공 어플리케이션은 기본적으로 사용자 개인 한명의 위치만 파악할 수 있으며 현재 위치에서 목적지 위치까지의 정확한 방향을 찾을 수 없다. 본 논문에서는 이러한 기존의 LBS를 이용하여 위치정보를 제공하는 어플리케이션의 문제점을 개선한 모바일 어플리케이션 시스템 개발 사례를 제안한다. 제안하는 시스템은 증강현실(AR: Augment Reality)을 이용하여 방향을 찾을 수 있도록 하였으며 다중 사용자간의 위치정보를 공유할 수 있도록 함으로써 일상생활에서 사람과 약속을 하고 서로의 위치가 엇갈려서 만나는데 어려움을 겪게 되는 경우 매우 효율적일 것이라 사료된다.

• International Journal of Computer Science & Network Security
• /
• 제24권1호
• /
• pp.45-51
• /
• 2024

The subject of navigation has drawn a large interest in the last few years. The navigation within a city is to find the path between two points, source location and destination location. In many cities, solving the routing problem is very essential as to find the route between different locations (starting location (source) and an ending location (destination)) in a fast and efficient way. This paper considers streets with diagonal streets. Such streets pose a problem in determining the directions of the route to be followed. The paper presents a solution for the path planning using the reconfigurable mesh (R-Mesh). R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents a solution that is very fast in computing the routes.

• 농촌지도와개발
• /
• 제5권1호
• /
• pp.93-102
• /
• 1998

The objectives of the study were 1) to make the reasonable standard, 2) to select the objective and scientific method and process for the location-allocation of a new provincial capital city. The Main standard of location-allocation were suggested as follows ; 1) Integration of province 2) Convenience of Administration service 3) Accomodations of new provincial capital city 4) Balanced development by region. The validity of location-allocation were reviewed the population potentials and nodal accessibilities. The population potential was examined to find the maximum point of administrative demand, and the locationallocation model was examined to find the minimum point of the aggregated travel-cost to a proposed provincial government office. The nodal accessibilities measured in travel-time distance and actual values. Two major concerns in locating public facilities are efficiency and equity.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1408-1412
• /
• 2004

This paper presents a method that a mobile robot finds location of doors in complex environments and safely traverses the door. A robot must be able to find the door in order that it achieves the behavior that is scheduled after traversing a door. PCA(Principal Component Analysis) algorithm using the vision sensor is used for a robot to find the location of door. Fuzzy controller using sonar data is used for a robot to avoid an obstacle and traverse the doors.

• 한국정보처리학회논문지
• /
• 제7권7호
• /
• pp.2169-2178
• /
• 2000

This paper proposes the structure of an agent and rules for fault detection and location on LAN. To find out a reason of critical fault incurred LAN, collision detection rule, error detection rule, broadcast detection rule, system location rule, and Internet application location rule ar shown. Also, the structure of multi-agent system and state transition diagram is portrayed to have connectivity with he set of rules. To verify availability of proposed rules, the process to find a faulty system is shown by monitoring and analyzing the LAN fault occurrences from the proposed set of rules. Such an rule based agent system is helpful to an Internet manager to solve a reason of fault and make ad decision from gathering management information.

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