• 한국식물병리학회:학술대회논문집
• /
• 한국식물병리학회 2003년도 정기총회 및 추계학술발표회
• /
• pp.143.1-143
• /
• 2003

Hop stunt viroid(HSVd) is a plant pathogen which infect a number of hosts such as grapevine, Citrus and Prunus plants. Sequence variants of HSVd have been divided into three types(i. grapevine and hop, ii. citrus, iii. plum, peach, apricot and almond). Purified RNAs from plum trees were used for the synthesis of cDNA with reverse transcription and amplified by polymerase chain reaction. Cloned cDNAs were sequenced and two different consensus sequence variants were detected. A neighbor-joining analysis was carried out on the sequence variants together with 62 previously described variants of HSVd from hop, plum and other species. Sequence variants from plum trees cultivated in Korea were clustered in HSVd-plum subtype and not in HSVd-hop subtype which were two Korean isolates belongs. These relationship between sequence variants from plum and two Korean isolates in HSVd-hop type supports the other origin for hop stunt disease.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.61-80
• /
• 2018

Location information of individual nodes is important in the implementation of necessary network functions. While extensive studies focus on localization techniques in 2D space, few approaches have been proposed for 3D positioning, which brings the location closer to the reality with more complex calculation consumptions for high accuracy. In this paper, an effective range-free localization scheme is proposed for 3D space localization, and the sensitivity of parameters is evaluated. Firstly, we present an improved algorithm (MDV-Hop), that the average distance per hop of the anchor nodes is calculated by root-mean-square error (RMSE), and is dynamically corrected in groups with the weighted RMSE based on group hops. For more improvement in accuracy, we expand particle swarm optimization (PSO) of intelligent optimization algorithms to MDV-Hop localization algorithm, called PMDV-hop, in which the parameters (inertia weight and trust coefficient) in PSO are calculated dynamically. Secondly, the effect of various localization parameters affecting the PMDV-hop performance is also present. The simulation results show that PMDV-hop performs better in positioning accuracy with limited energy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2499-2522
• /
• 2017

Multi-hop networks are a low-setup-cost solution for enlarging an area of network coverage through multi-hop routing. Carrier sense multiple access with collision avoidance (CSMA/CA) is frequently used in multi-hop networks. Multi-hop networks face multiple problems, such as a rise in contention for the medium, and packet loss under heavy-load, saturated conditions, which consumes more bandwidth due to re-transmissions. The number of re-transmissions carried out in a multi-hop network plays a major role in the achievable quality of service (QoS). This paper presents a statistical, analytical model for the end-to-end delay of contention-based medium access control (MAC) strategies. These strategies schedule a packet before performing the back-off contention for both differentiated heterogeneous data and homogeneous data under saturation conditions. The analytical model is an application of Markov chain theory and queuing theory. The M/M/1 model is used to derive access queue waiting times, and an absorbing Markov chain is used to determine the expected number of re-transmissions in a multi-hop scenario. This is then used to calculate the expected end-to-end delay. The prediction by the proposed model is compared to the simulation results, and shows close correlation for the different test cases with different arrival rates.

• The Journal of Korean Physical Therapy
• /
• 제28권4호
• /
• pp.254-258
• /
• 2016

Purpose: This study was conducted to identify the effects of dual task training on balance and functional performance in high school soccer players with functional ankle instability. Methods: Twenty high school soccer players with functional ankle instability were randomly assigned to a single task training group and a dual task training group. One participant who did not participate regularly in the training was excluded. The single task training group (n=9) received balance training on an unstable surface. The dual task training group (n=10) received balance training on an unstable surface and had to catch thrown balls during the balance training. Both groups were trained for 4 weeks, 3 days a week. The balance and functional performance of both groups was measured before and after training. Balance was measured using an anterior-posterior and medio-lateral balance. Functional performance was measured based on a figure-of-8 hop test, up-down hop test, and a single hop test. All data were analyzed by repeated two-way ANOVA tests. Results: A time by group interaction effect was not observed in the medio-lateral balance test, figure-of-8 hop test, or single hop test (p>0.05). A time by group interaction effect was observed in the anterior-posterior balance and up-down hop test (p<0.05). Conclusion: These results suggest that dual task training improved balance and functional performance better than single task training for some items.

• Journal of information and communication convergence engineering
• /
• 제5권3호
• /
• pp.205-208
• /
• 2007

The IEEE 802.11 is a MAC protocol which has been standardized by IEEE for Wireless Local Area Networks (WLANs). In the IEEE 802.11 WLANs, network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. However, the BEB scheme suffers from a fairness problem; some nodes can achieve significantly larger throughput than others. This paper proposes a new backoff algorithm for the IEEE 802.11 DCF scheme. This algorithm uses the hop count for considering fairness. It causes flows with high hop count to generate short backoff interval than those with low hop count, thus getting high priority. Therefore, when a collision occurs, the modified IEEE 802.11 DCF assigns higher priority to flow to be close to a destination.

• Journal of Information Processing Systems
• /
• 제8권3호
• /
• pp.471-482
• /
• 2012

For disaster exploration and surveillance application, this paper aims to present a novel application of a multi-robot agent based on WSN and to evaluate a multi-hop communication caused by the robotics correspondingly, which are used in the uncertain and unknown subterranean tunnel. A Primary-Scout Multi-Robot System (PS-MRS) was proposed. A chain topology in a subterranean environment was implemented using a trimmed ZigBee2006 protocol stack to build the multi-hop communication network. The ZigBee IC-CC2530 modular circuit was adapted by mounting it on the PS-MRS. A physical experiment based on the strategy of PS-MRS was used in this paper to evaluate the efficiency of multi-hop communication and to realize the delivery of data packets in an unknown and uncertain underground laboratory environment.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 추계학술발표대회
• /
• pp.1058-1060
• /
• 2007

기존 무선 네트워크의 전송 거리 및 전송률의 단점을 극복하기 위한 방법으로 멀티 홉 네트워크에 대한 연구가 활발히 이루어지고 있다. 하지만 멀티 홉 네트워크 연구의 초점이 라우팅 프로토콜에 편중되어 있어 정작 ARQ와 같은 데이터 전송의 효율과 신뢰성에 영향을 미치는 부분의 연구는 미흡한 실정이다. 따라서 본 논문에서는 멀티 홉 환경에서의 가능한 2가지 ARQ 방식인 End-to-End ARQ와 Hop-by-Hop ARQ의 환경 및 거리에 따른 성능을 시뮬레이션을 통해 비교 분석하여 멀티 홉 환경에 적절한 ARQ 방법을 찾고자 한다. 성능 분석 결과 모든 경우에 대해서 Hop-by-Hop ARQ가 더 좋은 성능을 보임을 확인하였다.

• 한국통신학회논문지
• /
• 제32권11A호
• /
• pp.1120-1127
• /
• 2007

셀룰라 기반의 멀티홉 시스템에서 각 홉이 필요로 하는 자원의 양에 따라 동적으로 자원을 할당하는 GPS-DRA(Generalized Processor Sharing-Dynamic Resource Allocation) 기법을 제안하였다. 논문에서 가정한 하이브리드 분산식 시스템에서는 네트워크에 연결되어있는 중앙의 controller가 각 홉에 자원을 적절히 할당해 주어야 한다. 하지만 전송환경이 시간에 따라 수시로 변하기 때문에 홉 별로 필요한 자원의 양에 맞게 자원을 할당하기가 쉽지 않다. GPS-DRA 기법은 홉 별로 이전에 사용한 자원의 양을 근거로 하여 홉 별로 필요한 자원의 양에 맞게 동적으로 자원을 할당한다. 본 기법을 사용하면 중앙의 controller에서 자원할당에 필요한 링크 정보를 모두 수집할 필요가 없으므로, 이 기법을 적용하기 위하여 추가적으로 필요한 control overhead의 증가량을 매우 적게 할 수 있다. 제안한 기법을 적용하여 모의실험을 수행한 결과, 고정 자원할당 방식에 비해 채널사용효율이 약 16% 증가하고 셀 용량이 최대 약 65% 커지게 되는 것을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4967-4986
• /
• 2015

Multi-hop relaying communications have great potentials in improving transmission performance by deploying relay nodes. The benefit is critically dependent on the accuracy of the channel state information (CSI) of all the transmitting links. However, the CSI has to be estimated. In this paper, we investigate the channel estimation problem in one-way multi-hop MIMO amplify-and-forward (AF) relay system, where both the two-hop and three-hop communication link exist. Traditional point-to-point MIMO channel estimation methods will result in error propagation in estimating relay links, and separately tackling the channel estimation issue of each link will lose the gain as part of channel matrices involved in multiple communication links. In order to exploit all the available gains, we develop a novel channel estimation model by structuring different communication links using the PARAFAC and PARATUCK2 tensor analysis. Furthermore, a two-stage fitting algorithm is derived to estimate all the channel matrices involved in the communication process. In particular, essential uniqueness is further discussed. Simulation results demonstrate the advantage and effectiveness of the proposed channel estimator.

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.