• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.475-491
• /
• 2009

This paper is primarily concerned with multi-path routing in Mobile Ad hoc Networks (MANETs). We propose a novel associativity-based on-demand source routing protocol for MANETs that attempts to establish relatively stable path(s) between the source and the destination. We introduce a new notion for gauging the temporal and spatial stability of nodes, and hence the paths interconnecting them. The proposed protocol is compared with other unipath (DSDV and AODV) and multi-path (AOMDV) routing protocols. We investigate the performance in terms of throughput, normalized routing overhead, packet delivery ratio etc. All on-demand protocols show good performance in mobile environments with less traffic overhead compared to proactive approaches, but they are prone to longer end-to-end delays due to route discovery and maintenance.

• 한국추진공학회지
• /
• 제10권3호
• /
• pp.82-89
• /
• 2006

최근 가스 터빈 엔진의 설계에 있어서 엔진 운용 및 정비에 소요되는 비용은 중요한 설계변수로 대두되었다. 이에 따라 엔진의 유지 및 보수가 조립상태에서 이루어져야 한다는 개념이 확대되고 있으나, 실제로 이것은 엔진의 상태를 정확히 예측할 수 있을 때에만 가능한 것이다. 따라서 본 연구에서는 항공기에 장착/운용 중인 각 성능요소들을 측정하고 분석하여 엔진 성능을 진단하는 가스경로해석과 퍼지로직을 적용한 엔진 성능진단 코드를 개발하였으며, 이를 스마트 무인기용 터보축 엔진에 적용하여 지상 정지 상태에서의 엔진의 단일 성능저하를 정량적으로 예측하였다.

• 한국구조물진단유지관리공학회 논문집
• /
• 제5권3호
• /
• pp.233-244
• /
• 2001

Stress-strain behaviour of soil varies based on stress path and stress history. There has been few study on the characteristics of yielding curve which has anisotropic compression stress history in decomposed granite soil. During this study, various stress path tests in previous anisotropic compression stress history are performed on compacted decomposed granite soil sampled at Iksan, Chonbuk. Yielding points are determined from various stress-strain curves (${\eta}-{\varepsilon}$, ${\eta}$-v, and ${\eta}$-k, ${\eta}$-W curves). Stress-strain curve is certified which shows yielding point very clearly. The shape and characteristics of anisotropic compression yielding curves are examined. The main results are summarized as follows : 1) p' constant and compressive direction in stress paths, which has experienced previous anisotropic compression stress history, shows relatively dear yielding points. 2) Yielding curves defined from ${\eta}$-k and ${\eta}$-W curve show almost perfect ellipse. 3) Directions of plastic strain incremental vector($dv^p/d{\varepsilon}^p$) are not perpendicular to yielding curve.

• 정보처리학회논문지C
• /
• 제14C권1호
• /
• pp.73-80
• /
• 2007

기존의 이동 Ad Hoc On-demand 라우팅 알고리즘은 단지 경로의 손실이 발생할 경우에만 경로 발견을 시작하며, 단절된 경로를 발견하고 새로운 경로 확립하는데 막대한 경비와 시간이 소요된다. 본 논문에서는 기존 라우팅 알고리즘에서 사전 활성화 경로 선택과 관리유지 방식을 추가하는 것을 제안한다. 본 연구의 핵심 아이디어는 수신되는 패킷의 신호파워 세기가 손실되기 전의 최적 임계치 신호파워 세기까지 근접하게 되면 경로는 손실될 경향이 높다고 간주하는 것과 수신되는 패킷의 신호파워 세기가 최적 임계치 이하로 떨어졌을 경우, 사전경고 패킷을 발생하는 것이다. 사전경고 패킷을 발생 후에, 송신 노드는 계속적으로 패킷이 전송하는 동안 사전에 경로 발견을 시작하기 때문에, 모든 경로의 단절에 대한 잠재적인 가능성을 피할 수 있다. 성능평가 연구를 위하여 네트워크 시뮬레이토(NS2)가 사용된다. 결과에 의하면 된 알고리즘은 기존의 DSR과 AODV 프로토콜보다 패킷 전달율과 평균 지연시간 그리고 오버헤드 측면에서 성능이 우수한 경향을 나타낸다.

• Journal of Communications and Networks
• /
• 제7권3호
• /
• pp.325-336
• /
• 2005

Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권4호
• /
• pp.1911-1930
• /
• 2017

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. The key to overlay routing is the placement and maintenance of the overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality can provide more optimal routes for a large number of node pairs, we propose a resilient routing overlay network construction method by introducing Super-Relay nodes. In detail, we present the K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), in which we focus on the selection and connection of Super-Relay nodes to optimize the routing quality in a resilient and scalable manner. For the simultaneous path failures between the default physical path and the overlay backup path, we also address the selection of recovery path. The objective is to select a proper one-hop recovery path with minimum cost in path probing and measurement. Simulations based on a real ISP network and a synthetic Internet topology show that our approach can provide high-quality overlay routing service, while achieving good robustness.

• 로봇학회논문지
• /
• 제5권2호
• /
• pp.120-126
• /
• 2010

This paper presents to study the path tracking method of AGV(autonomous guided vehicle) which has a laser guidance system. An existing automatic guided vehicles(AGVs) which were able to drive on wired line only had a automatic guidance system. However, the automatic guidance systems that those used had the high cost of installation and maintenance, and the difficulty of system change according to variation of working environment. To solve such problems, we make the laser guidance system which is consisted of a laser navigation and gyro, encoder. That is robust against noise, and flexible according to working environment through sensor fusion. The laser guidance system can do a perfect autonomous driving. However, the commercialization of perfect autonomous driving system is difficult, because the perfect autonomous driving system must recognize the whole environment of working space. Hence, this paper studied the path tracking of AGV using laser guidance system without wired line. The path tracking method is consisted of virtual path generation method and driving control method. To experiment, we use the fork-type AGV which is made by ourselves, and do a path tracking experiments repeatedly on same experimental environment. In result, we verified that proposed system is efficient and stable for actual fork-type AGV.

• 품질경영학회지
• /
• 제28권3호
• /
• pp.145-154
• /
• 2000

Effective management of knowledge is essential to keep up with demands of this challenging information age. The first step for this kind of management would be to define indicators to evaluate the quality of knowledge. In this paper, we use five latent variables (intrinsic quality, representational quality, ease of use of quality, maintainable quality, usage of quality) as basis for a preliminary path analysis for knowledge management. Preliminary study results showed that high intrinsic quality does not necessarily guarantee high frequency of use. A modified questionnaire is made and is used for SERVQUAL. The result of SERVQUAL shows that customers are not relatively happy about both intrinsic quality and its ease of use. Additional path analyses are done for both expected and observed quality indicators. The path model based on the expectation indicated that the presentation method of knowledge would induce its easy maintenance while that based on observation did not back up the same phenomenon.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.765-766
• /
• 2008

In this paper, It has been emphasized of important path access during transmit of node when each node transmit broadcast service which one's of new MANET (Mobile Ad hoc Networks) of autonomy and mobility network structures. It has proposed analysis methods are hierarchical path structure of transmit which experience context aware through confidence to network connectivity alone as issue which can be reduce duplicate of beam forming on networks and maintenance one's of method got to optimized of transmission network that status information of context awareness using ad hoc ODDMRP(Ontology Doppler effect Dynamic Multicast Routing Protocol) path method.

• 한국재난정보학회 논문집
• /
• 제5권1호
• /
• pp.30-44
• /
• 2009

Asphalt concrete pavements are often destroyed within the intended design life due to the increasement in traffic volume. The most common types of asphalt concrete pavement damages are permanent deformation and fatigue cracking, and so on. In this research, characteristics of traffic loadings and lateral wheel path distributions are analyzed using the field survey on traffic flow. The obtained traffic characteristics can be used to the decision making for the maintenance policy of roads. According to the traffic lane analysis for the 2nd and 3rd lanes, inner lane vehicles tended to pass to the right side to avoid the opposite side vehicles. In addition, the outside lane vehicles were deviated to the left side to avoid passengers. It is also noted that the lateral wheel path distributions was close to the normal distribution.