• 전기전자학회논문지
• /
• 제20권1호
• /
• pp.1-8
• /
• 2016

In this paper, we propose an effective time-of-arrival (TOA)-based localization method with adaptive bias computation in indoor environments. The goal of the localization is to estimate an accurate target's location in wireless localization system. However, in indoor environments, non-line-of-sight (NLOS) errors block the signal propagation between target device and base station. The NLOS errors have significant effects on ranging between two devices for wireless localization. In TOA-based localization, finding the target's location inside the overlapped area in the TOA-circles is difficult. We present an effective localization method using compensated distance with adaptive bias computation. The proposed method is possible for the target's location to estimate an accurate location in the overlapped area using the measured distances with subtracted adaptive bias. Through localization experiments in indoor environments, estimation error is reduced comparing to the conventional localization methods.

• 시스템엔지니어링학술지
• /
• 제15권1호
• /
• pp.9-15
• /
• 2019

DIRCM is a device that deception missiles by directing the light source to missile seeker with infra-red laser based turret. The effectiveness of the device is affected by changes of the turret's Field of View (FoV), and also influence of the interference devices determines the effect of the DIRCM's effectiveness. Therefore finding mounting location for DIRCM is critical parameter for the DIRCM's effectiveness. so we applied stiffness review, interference analysis, FoV analysis and simulation analysis method to Multi-purpose helicopter for the find DIRCM location. As a result, in case of 1 DIRCM mounted at helicopters bottom shows 30~40% survivability. case of 2 DIRCM mounted at both side shows 70~80% survivability.

• 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.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2006년도 추계 종합학술대회 논문집
• /
• pp.355-359
• /
• 2006

이동통신망 고도화와 유비쿼터스 센서 네트워크 기술 개발에 따라 상황인지 기반 신규 서비스 모델이 개발되고 있다. 이동통신사업자는 셀 기반의 위치정보를 이용한 친구찾기 서비스 GPS 위치정보를 이용한 텔레매틱스 서비스 등을 제공하고 있다. 최근에는 셀 기반의 위치정보 서비스를 이용한 114 서비스를 제공하고 있다. 본 논문에서는 이동통신망에서 위치정보를 이용한 상황인지 기반의 모바일 맛집 관광 서비스를 개발하였다. 상황인지 기반의 모바일 맛집 관광 서비스는 이동통신망의 LBSP(Location Based Service Platform)로부터 사용자 위치정보, 유선 웹 서버로부터 계절, 시간, 기상 등의 상황정보, 데이터베이스에 저장된 개인 선호 정보 등을 이용하여 최적의 관광 정보를 제공한다. 모바일 맛집 관광 서비스는 WIPI 플랫폼을 이용하여 개발하였다.

• 산업경영시스템학회지
• /
• 제5권7호
• /
• pp.9-15
• /
• 1982

The rectilinear-distance location problem combines the property of being a very appropriate distance measure for a large number of location problems and the property of being very simple to treat analytically. An obvious question to be asked at the optimal point which is obtained by the rectilinear distance method is, "what if the point is not available as a location site\ulcorner." The point may, for example, be inaccessible or may coincide with the location of another structure, a river, or a municipal park. In this case, one approach that may be employed is to construct contour lines (also called iso-cost or level curves) of the cost function. Contour lines provide considerable insight into the shape of the surface of the total cost function as well as a useful means of evaluating alternative locations for the new facility. But, when there is an obstacle which divides the application area into two. The optimal location(which is acquired by the rectilinear distance method) is not coincide with the minimal cost point and the contour line is occasionally of no use, this paper shows the method of finding a way to decide an optimal point of single facility location in this case.this case.

• 한국항공우주학회지
• /
• 제39권9호
• /
• pp.889-895
• /
• 2011

최신의 항공기는 상대 항공기의 레이더에 검출되지 않기 위해 다양한 방법을 적용하고 있다. 레이더를 통해 감지가 어려운 적기의 존재 유무를 파악하고 적기와의 상대적인 거리 차이와 방위를 추정하기 위해 레이더 경보 수신기(RWR, Radar Warning Receiver)가 이용될 수 있다. 기존의 레이더 경보 수신기는 도달 각(AOA, Angle Of Arrival)을 구하고, 도달 각의 방향성으로 레이더 펄스가 발산된 위치를 추정하였다. 따라서 보다 정확한 위치를 추정하기 위해서 보다 정확한 도달 각을 구하는데 초점을 두었다. 반면 도달 각을 정확하게 구하더라도 레이더 펄스를 발산한 상대 항공기가 빠른 속도로 이동하는 경우 정확한 위치 추정은 어렵다. 본 논문에서는 레이더 펄스가 발산된 정확한 위치를 추정하기 위하여, 초고주파의 레이더 펄스 신호에서 저주파수 신호의 위상지연차를 이용하여, 관심 영역에 대한 스캐닝 기법으로 레이더 펄스가 발산된 위치를 추정하였다.

• 조명전기설비학회논문지
• /
• 제22권9호
• /
• pp.82-87
• /
• 2008

국내 택배시장은 과거 몇 개의 업체에서 독점해왔으나 현재는 대기업들과 수많은 중소기업들이 참여하고 있어 경쟁이 심화되고 있다. 우편물의 신속한 배송과 운송비용의 최소화는 매우 중요하며 이를 위하여 운송거리의 최단 거리화가 우선 필요하다. 본 논문은 전국의 주요 도시에 배치된 우편집중국을 기하적으로 가장 짧게 연결하는 교환 센터의 최적 위치를 찾는 방법을 제시한다. 송전계통의 routing, 배전선로망의 최적화 등에 이용되고 있는 Steiner Tree이론을 최단거리 우편물 운송망 구축에 적용하였다. Steiner Tree이론으로부터 선정된 위치에 교환센터를 설치할 경우, 운송비를 절감하여 경영수지를 개선할 뿐 아니라 신속한 배달을 최우선으로 하는 택배 시장에서 우위를 점할 수 있을 것으로 기대된다. Steiner Tree 이론은 차기 초고압 선로를 최단거리로 연결하는 전력소의 위치선정 등에도 활용될 수 있을 것으로 사료된다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.27-30
• /
• 1999

A spatio-temporal vector channel model is introduced for the position location (PL) estimation problem for CDMA cellular system environment. Two common ways for the PL make use of the AOA (Angle Of Arrival) and TDOA (Time Difference Of Arrival) from a subscriber to the multiple sensors (base stations). In this paper, we applied the derived vector channel to simulate the multipath channel for the angle of the signal arrival in CDMA systems. Cross-correlation method is a good candidate among other direction finding algorithms available in literature, especially in wideband modulation as in the CDMA system. The PL estimation errors are evaluated for different channels, which are obtained as a parameter of scattering radius of the suggested model. We noted that the number of sensors (base-stations) are related to the PL errors in favor of the available data.

• Journal of Information Processing Systems
• /
• 제10권4호
• /
• pp.618-627
• /
• 2014

Nowadays mobile users are using a popular service called Location-Based Services (LBS). LBS is very helpful for a mobile user in finding various Point of Interests (POIs) in their vicinity. To get these services, users must provide their personal information, such as user identity or current location, which severely risks the location privacy of the user. Many researchers are developing schemes that enable a user to use these LBS services anonymously, but these approaches have some limitations (i.e., either the privacy prevention mechanism is weak or the cost of the solution is too much). As such, we are presenting a robust scheme for mobile users that allows them to use LBS anonymously. Our scheme involves a client side application that interacts with an untrusted LBS server to find the nearest POI for a service required by a user. The scheme is not only efficient in its approach, but is also very practical with respect to the computations that are done on a client's resource constrained device. With our scheme, not only can a client anonymously use LBS without any use of a trusted third party, but also a server's database is completely secure from the client. We performed experiments by developing and testing an Android-based client side smartphone application to support our argument.

• 산업경영시스템학회지
• /
• 제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).