• 대한임베디드공학회논문지
• /
• 제15권1호
• /
• pp.25-33
• /
• 2020

Multipath routing protocols with unmanned aerial vehicles have been proposed to improve reliability in tactical ad hoc networks. Most of existing studies tend to establish the paths with multiple metrics. However, these approaches suffer from link loss and congestion problems according to the network condition because they apply same metric for both ground and air path or employ the simple weight value to combine multiple metrics. To overcome this limitation, in this study, we propose new routing metrics for path over unmanned aerial vehicles and use the multi-criteria decision making (MCDM) method to determine the weight factors between multiple metrics. For the case studies, we extend the ad-hoc on-demand distance vector protocol and propose a strategy for modifying the route discovery and route recovery procedure. The simulation results show that the proposed mechanism is able to achieve high end-to-end reliability and low end-to-end delay in tactical ad hoc networks.

• 대한치과교정학회지
• /
• 제8권1호
• /
• pp.27-37
• /
• 1978

In order to know the variation of the associated craniofacial skeletal angle and linear distance according to the change of gonial angle, the roentgenographic cephalo metric study was undertaken in Korean normal cephalometric analysis and eletric computer. The fallowing results were optained. 1) The size of gonial angle is mainly depend on the lower gonial angle. The mean of upper gonial gngle is almost same in normal occlusion group$^*$ and malocclusion group. 2) It was resulted on normal group and malocclusion group by F test that the number of parameters that were significant at 5% level of confidence were 14 parameters in normal occlusion group and 22 parameters in malocclusion group. 3) Ramus height and mandibular body length increased and facial ratio is decreased as gonial angle decreased. 4) MP-T, overbite depth and Y-axis angle is not related to gonial angle in normal occlusion group, but in moloclusion group, as gonial angle decreased, MP-T and overbite depth is increased and Y-axis angle is decreased. 5) SN-MP, OP-MP, PP-MP is increased as gonial anglel increased, it was mainly depend on the lower gonial angle.

• 한국항행학회논문지
• /
• 제16권2호
• /
• pp.271-277
• /
• 2012

본 논문에서는 재난모니터링, 환경감시 및 재난구호 등의 정보 수집 및 정찰 등의 임무를 수행하는 다수의 UAV들로 구성된 편대비행 네트워크를 위해 동적 트리 형성 프로토콜을 제안하였다. 특히 무선 동적 환경에 적응한 최적의 트리를 구성하기 위한 링크 비용을 구하기 위해 거리에 따른 무선 신호 감쇄현상을 적용하여 Hop-LQI Weight 알고리즘을 고안하였으며 이를 MSP430 K-mote 센서 플랫폼에 TinyOS 코드를 구현하였다. 이를 무선 통신에서 링크 비용 산출 기법인 Minimum LQI 방법과 노드 수에 따른 평균 경로 설정시간을 비교를 통하여 성능을 검증하였다.

• 한국멀티미디어학회논문지
• /
• 제11권9호
• /
• pp.1195-1203
• /
• 2008

한글 문서에서 의성어는 자연적 혹은 인공적 소리를 인간의 언어로 표현하는 것으로서, 대상과 가장 가깝게 느껴지는 의성어 단어로 표현할 수 있으며 또한 음향 도서관구축 등 멀티미디어 데이터를 분류하는 기준으로 활용할 수 있다. 이 연구에서 우리는 말뭉치에서 의성어들의 출현빈도를 구하고, 실험에서 사용할 의성어 100개를 선별하였다. 의성어의 관계를 분류하기 위하여 유사도 및 거리 매트릭스의 특징을 추출하고, 이후에 주성분 분석 방법(PCA)을 사용하여 의성어 특성의 차원을 낮추었으며 의성어들의 관계를 벡터 공간에 표현하였다. 비계층적 클러스터링 방법 들을 비교하여 k-means 알고리즘을 사용하였다. 결과로 의성어를 분류하였고 분류 결과를 통해 의성어들의 특성을 반영할 수 있었다.

• 한국정보통신학회논문지
• /
• 제13권6호
• /
• pp.1077-1082
• /
• 2009

무선 메쉬 네트워크는 네트워크 구성의 용이성과 비용적인 장점으로 각광받고 있는 무선 백본 네트워크 기술이다. 최근 상용화된 제품이 출시되고 있지만, 대부분의 기존 연구 기술은 시뮬레이션을 통해 성능을 분석하였다. 본 논문에서는 실제 상황을 고려하여 무선 메쉬 네트워크 테스트베드를 구축하였다. 본 테스트 베드는 무선 분산 시스템(Wireless Distribution System)과 브릿지를 응용하여 멀티채널 멀티 인터페이스와 동적인 위치기반 라우팅 프로토콜을 지원한다. 위치기반 라우팅 프로토콜은 링크 채널 변화와 물리적 거리를 고려한 메트릭을 이용하여 무선 간섭에 강하게 설계하였다. 그리고 메쉬 클라이언트들은 중앙 집중 주소 관리 서버를 통해 주소를 할당 받아 통신하며, 간이 망 네트워크 관리 프로토콜을 통해 망을 관리하도록 설계 및 구현하였다.

• Journal of Communications and Networks
• /
• 제17권4호
• /
• pp.370-383
• /
• 2015

Effective link quality estimation is a vital issue for reliable routing in wireless networks. This paper studies the performance of expected transmission count (ETX) under different traffic loads. Although ETX shows good performance under light load, its performance gets significantly worse when the traffic load is high. A broadcast packet storm due to new route discoveries severely affects the link ETX values under high traffic load, which makes it difficult to find a good path. This paper presents the design and implementation of a variation of ETX called high load - ETX (HETX), which reduces the impact of route request broadcast packets to link metric values under high load. We also propose a reliable routing protocol using link quality metrics, which is called link quality distance vector (LQDV). We conducted the evaluation of the performance of three metrics - HETX, ETX and minimum hop-count. The simulation results show that HETX improves the average route throughput by up to 25% over ETX under high traffic load. Minimum hop-count has poor performance compared with both HETX and ETX at all of the different traffic loads. Under light load, HETX and ETX show the same performance.

• Ecology and Resilient Infrastructure
• /
• 제5권2호
• /
• pp.94-104
• /
• 2018

The Soyangho Reservoir in Korea has a large drawdown zone, with an annual maximum water level fluctuation of 37 m due to dam operations to maintain a stable water supply and control flooding, especially during the monsoon period. The floristic composition, distribution and biomass of the major plant communities in the drawdown zone of the Soyangho Reservoir were assessed in order to understand their responses to the wide water level fluctuation. Species richness of vascular plants was low, and species composition was dominated by herbaceous annuals. Principal coordinates analysis using both flora and environmental data identified slope angle and the distance from the dam as important factors determining floristic composition. The species richness was low in the steep drawdown zone close to the dam, where much of the soil surface was almost devoid of vegetation. In shallower slopes, distant from the dam plant communities composed of mainly annuals were found. The large fluctuation in water level exposed soil where these annuals could establish. An overall biomass of 122 t (metric tons) Dry Matter was estimated for the reservoir, containing ca 3.6 t N (nitrogen) and ca 0.3 t P (phosphorus); the role of the vegetation of the drawdown zone in carbon sequestration and water pollution were briefly discussed.

• Asia pacific journal of information systems
• /
• 제13권1호
• /
• pp.103-118
• /
• 2003

Software project planning is usually represented by a project activity network that is composed of stages of tasks to be done and precedence restrictions among them. The project network is very complex and its construction requires a vast amount of field knowledge and experience. So this study proposes a case-based reasoning approach that can generate the project network automatically based on the past cases and modification knowledge. For the case indexing, we have adopted 17 factors, each with a few alternative values. A special structure of this problem is that the modification effort can be identified by each factor independently. Thus it is manageable to identify 85 primitive modification actions(add and delete activities) and estimate its modification efforts in advance. A specific case requires a combination of primitive modifications. Based on the modification effort knowledge, we have adopted the Least Modification approach as a metric of similarity between a new project and past cases. Using the Least Modification approach and modification knowledge base, we can automatically generate the project network. To validate the performance of Least Modification approach, we have compared its performance with an ordinary minimal distance approach for 21 test cases. The experiment showed that the Least Modification approach could reduce the modification effort significantly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5209-5228
• /
• 2016

Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1790-1806
• /
• 2015

Utility-based routing is a special type of routing approach using a composite utility metric when making routing decisions in ad hoc and sensor networks. Previous studies on the utility-based routing all use fixed retry limit and a very simple distance related energy model, which makes the utility maximization less efficient and the implementation separated from practice. In this paper, we refine the basic utility model by capturing the correlation of the transmit power, the retry limit, the link reliability and the energy cost. A routing algorithm based on the refined utility model with adaptive transmit power and retry limit allocation is proposed. With this algorithm, packets with different priorities will automatically receive utility-optimal delivery. The design of this algorithm is based on the observation that for a given benefit, there exists a utility-maximum route with optimal transmit power and retry limit allocated to intermediate forwarding nodes. Delivery along the utility-optimal route makes a good balance between the energy cost and the reliability according to the value of the packets. Both centralized algorithm and distributed implementations are discussed. Simulations prove the satisfying performance of the proposed algorithm.