• Title/Summary/Keyword: 최적거리

Search Result 1,135, Processing Time 0.026 seconds

An Analysis of Optimum Transmission Range in MANETs under various Propagation Models (다양한 전파 환경 하에서 MANET 최적 통달거리 분석)

  • Choi, Hyungseok;Lee, JaeYong;Kim, ByungChul
    • Journal of Internet Computing and Services
    • /
    • v.15 no.2
    • /
    • pp.1-7
    • /
    • 2014
  • This paper presents an analytical method for finding the optimum transmission range in mobile ad hoc networks(MANETs). The results are particularly useful for the operation of military networks, as the transmission range affects the throughput, delay, and battery consumption. Plus, the proposed method allows the optimum transmission range to be determined in advance when deploying combatants with mobile terminals. And we analyze the battery life-time and the optimum transmission range under various propagation scenarios based on Hata propagation model. The proposed method obtains the optimum transmission range in a MANET based on the operational conditions.

Design of the Current Segment Coil for Accelerating the Magnetic Materials (자성물질을 가속시키기 위한 전류 Segment 코일의 설계)

  • Chung, Byung-Tae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.861-866
    • /
    • 2012
  • The distance optimizing between coil and magnetic materials never be specified in the magnetic materials acceleration using the coil till now. We can know to be the distance which optimizes when being in the half position about the distance of intercoil by the result of the max point on the Differential calculus. Whether several top and bottom current segment coil structures were made and the steel ball in which the current segment coil structure is the magnetic materials could be accelerated in the optimizing distance or not confirmed. When the coil valley current about the mass of the steel ball was known as the experiment and it was but to be the nose consequently it applied to the magnetic materials and magnetic fluid, the optimal distance was solved between the coil and material.

Optimal distance exponent of inverse distance method (역거리법의 최적 거리 지수)

  • Yoo, Ju-Hwan
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.5
    • /
    • pp.451-459
    • /
    • 2018
  • We calculated the optimal exponent values based on the hourly rainfall data observed in South Korea by treating the exponent value as a variable without fixing it as a square in the inverse distance method. For this purpose, rainfall observation stations providing the data are classified into four groups which are located at the Han river upstream, downstream, the Geum river upstream, and the Nakdong river midstream area. A total of 52 cases were analyzed for seven stations in each group. The optimal exponent value of distance was calculated in a case including one base station and four surrounding stations in a group. We applied the golden section search method to calculating this optimum values using rainfall data for 10 years (2004~2013) and verified the optimum values for the last three years (2014~2016). We compared and analyzed two results of the conventional inverse distance method and the inverse distance method in this study. The optimal values of distance exponent obtained in this study were 3.280, 1.839, 2.181, and 2.005 respectively, in the four groups, and totally mean value was 2.326. It is shown the proposed inverse distance method applying the optimal exponent is superior to the conventional inverse distance method.

The Performance Evaluation of Method to Process Nearest neighbor Queries Using an Optimal Search Distance (최적탐색거리를 이용한 최소근접질의 처리 방법의 성능 평가)

  • Seon, Hwi-Jun;Kim, Hong-Gi
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.32-41
    • /
    • 1999
  • In spatial database system, the nearest neighbor query occurs frequently and requires the processing cost higher than other spatial queries do. The number of nodes to be searched in the index can be minimized for optimizing the cost of processing the nearest neighbor query. The optimal search distance is pr9posed for the measurement of a search distance to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we prove properties of the optimal search distance in N-dimensional. We show through experiments that the performance of query processing of our method is superior to other method using maximum search distance.

  • PDF

An Filtering Algorithm for Searching the Optimal Path Considering the Attributes and Distances of the Routing Objects According to Users' Preferences (사용자의 선호도에 따른 경유지의 속성과 거리를 고려한 최적경로 탐색을 위한 필터링 알고리즘)

  • Bao, Weiwei;Kim, Eunju;Park, Yonghun;Yoo, Jaesoo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2011.05a
    • /
    • pp.49-50
    • /
    • 2011
  • 본 논문에서는 출발지부터 목적지까지 가는 도중에 슈퍼, 주유소, 식당 등과 같은 특정 장소를 경유하면서 거리와 서비스 같은 다중 속성을 고려한 최적경로를 탐색 알고리즘을 제안한다. 제안하는 최적경로는 기존 연구와 다르게 거리와 같은 단일 속성만 고려하지 않고, 사용자가 지정하는 가중치를 적용하여 다중 속성을 고려해서 사용자 원하는 경유객체들을 하나씩 포함한다. 기존 알고리즘들은 다중 속성과 사용자의 선호도를 고려한 최적경로를 탐색하는 경우에는 적합하지 않다. 이 문제점을 해결하기 위해서 본 논문에서는 필터링 기법을 이용하여 경유객체를 될 수 없는 객체들을 제거하고 최적경로를 탐색하는 알고리즘을 제안한다. 제안하는 알고리즘의 우수성을 확인하기 위해 다양한 성능평가를 수행한다.

  • PDF

Computation of the Shortest distance and Forecasting movement distance for Y/T Multi-Cycle System (Multi-Cycle 작업을 위한 Y/T 최단거리 및 예상 이동거리 계산)

  • Park, Tae-jin;Kim, Han-soo;Kim, Cheeyong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.127-130
    • /
    • 2009
  • In this paper, we introduce a Y/T(Yard Tractor) Multi-Cycle System on the basis of RTLS that improves a low efficient loading and unloading. In the proposed approach, we apply the best suited algorithm looking for seeking of the optimum path and the shortest movement distance. In this paper, Our experiment results show that rate of a driving distance is reduced more than 12% compared to the average value, and that is reduced more than 23% compared to the maximum value.

  • PDF

The Method to Process Nearest Neighbor Queries Using an Optimal Search Distance (최적탐색거리를 이용한 최근접질의의 처리 방법)

  • Seon, Hwi-Joon;Hwang, Bu-Hyun;Ryu, Keun-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.9
    • /
    • pp.2173-2184
    • /
    • 1997
  • Among spatial queries handled in spatial database systems, nearest neighbor queries to find the nearest spatial object from the given locaion occur frequently. The number of searched nodes in an index must be minimized in order to increase the performance of nearest neighbor queries. An Existing approach considered only the processing of an nearest neighbor query in a two-dimensional search space and could not optimize the number of searched nodes accurately. In this paper, we propose the optimal search distance and prove its properties. The proposed optimal search distance is the measurement of a new search distance for accurately selecting the nodes which will be searched in processing nearest neighbor queries. We present an algorithm for processing the nearest neighbor query by applying the optimal search distance to R-trees and prove that the result of query processing is correcter than the existing approach.

  • PDF

Optimal Search Depth for the Sonar Systems in a Range-Dependent Ocean Environment (거리종속 환경에서 소나의 최적운용수심에 대한 연구)

  • Lee, Jae-Hoon;Kim, Jea-Soo;Yoo, Jin-Soo;Byun, Yang-Hun;Cho, Jung-Hong
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.1
    • /
    • pp.47-56
    • /
    • 2008
  • In the detection of an underwater target, there exists an optimal search depth for the sonar systems, at which the Probability of Detection is maximized. The optimal search depth is dependent on the depths of the target and sonar, the sound speed profile, and the bathymetry. In this paper, we address this question in range-dependent environments, particularly for the bathymetry with slope and with warm eddy. For range-dependent bathymetry, the typical sound profile in the East Sea of Korea was used. The detection range was greater when the sonar was located in deep water than in shallow water. As for the case of eddy, mesoscale warm eddy was used, and the detection range was greater when looking out of the warm eddy than when looking into the eddy.

Performance Evaluation of Routing Algorithms based on Optimum Transmission Range in Tactical MANETs (전술 MANET의 최적통달거리 기반 라우팅 알고리즘 성능 연구)

  • Choi, Hyungseok;Lee, JaeYong;Kim, ByungChul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.4
    • /
    • pp.10-17
    • /
    • 2014
  • This paper presents an analytical method for finding the optimum transmission range in mobile ad hoc networks(MANETs). The results are particularly useful for the operation of military networks, as the transmission range affects the traffic throughput of user & routing traffic, delay, and frequency interference. When the conditions of tactical environment are applied in our simulations and the above-mentioned performances are analyzed, we find the OLSR protocol is more excellent. Plus, we compare the results of MANETs performance when applying optimum transmission range and the default transmission range(10km), and analyze the reasonability of the calculation of optimum transmission range proposed by this paper.

Efficient object tracking algorithm based on multi-drone collaboration (드론을 활용한 협업기반의 효율적인 대상물 추적 알고리즘)

  • Yun, Hyun Kyoung;Choi, Kwang Hoon;Kim, Jai-Hoon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2016.04a
    • /
    • pp.42-45
    • /
    • 2016
  • 본 논문은 기동성은 있지만 한정된 비행시간과 비행거리를 가진 드론을 이용한 지능형 영상 보안 감시 시스템을 제안한다. 드론이 가지는 한계점을 보완하기 위해 그리드 기반으로 시스템을 구성하며 분할된 영역에서 다중 드론간 대상물의 효율적인 추적 및 감시 모니터링을 위해 연계 추적 방식을 이용한다. 먼저, 한정된 비행거리를 위해 각 드론스테이션 간의 최적 거리를 제안한다. 제안한 최적 거리를 통해 생성된 중첩 감시영역에서 효율적 연계 추적을 위해 드론의 전력상태와 대상물의 이동방향을 고려한 최적의 드론 선정 알고리즘을 제시한다. 제안한 알고리즘은 케이스 스터디를 통해 그 응용 가능성을 검토한다.