• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.8
• /
• pp.85-90
• /
• 2010

In this paper, a blind hop timing and duration estimation scheme for FHSS (Frequency Hopping Spread Spectrum) systems based on digital frequency discriminator and wavelet transform is proposed. The proposed scheme not only requires the lower hardware complexity but also shows superior estimation performance compared to the previously proposed temporal correlation function based hop timing estimation scheme.

• Proceedings of the Korean Society of Plant Pathology Conference
• /
• 2003.10a
• /
• 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.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.3
• /
• pp.87-95
• /
• 2013

In this paper, the outage probability of efficient partial relay selection(EPRS) using only one-hop channel information in multi-hop systems is analyzed in Rayleigh fading channels. In particular, we derive an exact and closed-form expression for the outage probability of decode-and-forward relaying based EPRS. In order to prove the usefulness of EPRS in multi-hop systems, we also analyze the correlation between the end-to-end signal-to-noise ratio(SNR) and the SNR for each hop at an arbitrary relaying path. Furthermore, through numerical investigation, we compare the outage performances for EPRS and the best relay selection using all channel information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.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.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.385-389
• /
• 2009

Multi-hop wireless mesh networks (WMNs) suffer from significant packet losses due to insufficient available bandwidth and high channel error probability. To conquer packet losses, end-to-end (E2E) error control schemes have been proposed. However, in WMNs, E2E error control schemes are not effective in adapting to the time-varying network condition due to large delay. Thus, in this paper, we propose a network-adaptive error control for video streaming over WMNs that flexibly operates E2E and hop-by-hop (HbH) error control according to network condition. Moreover, to provide lightweight support at intermediate nodes for HbH error control, we use path-partition-based adaptation. To verify the proposed scheme, we implement it and evaluate its transport performance through MPEG-2 video streaming over a real IEEE 802.11a-based WMN testbed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.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 Research Journal of the Costume Culture
• /
• v.14 no.1
• /
• pp.153-167
• /
• 2006

The hip-hop, which began with subculture of black people in Harlem, have changed variously in musical history after the times, which has become the culture phenomenon that had controlled dancing, fashion, and further consciousness of the new generation around the world in 1990s. Since Jean Patou first used Graffiti on clothing in 1920s, graffiti art has been expressed through various methods in many designers' works. The purpose of this study is to develop 'The Hip-Hop' clothing design which express major images in works of Jean-Michel Basquiat, a representative painter of Graffiti art in modern fashion. The concept is Jean Casual Look representing Young Street Culture. Breaking from existing strong legitimate hip-hop styles, clothing design expresses funny, healthy, comfortable, and active feelings. Adobe Illustrator and Adobe Photoshop program were used to design Hip-Hop clothing. With the result that the images on Basquiat's works applied to the hip-hop clothing design, it is suggested that the works of artists are worthy of practical use as factors of a high value-added design, which corresponds with collaboration appearing in modern design variously.

• Korean Journal of Environmental Agriculture
• /
• v.12 no.1
• /
• pp.59-67
• /
• 1993

This study was conducted to clarify the translocation and the phytotoxicity of soil treated Heptachlor (0.1ppm) and Heptachlor epoxide (0.1ppm) on Hop plants and Hansam vine. Residues in the soils and the plants were analyzed and phytotoxic patterns were investigated at the different growing stages. Photosynthetic rate and chlorophyll contents were measured. The results were summarized as follows: 1. At the second growing stage, 40 days after transplanting, severe damages by Heptachlor were observed on root of Hop. Growth rate on top and root parts of Hop was retarded from the third growing stage, 70 days after transplanting. The damages seemed to be caused by Heptachlor epoxide rather than by Heptachlor. 2. Residues of Heptachlor and Heptachlor epoxide in the plants, Hops and Hansam vine, were high at the second growing stage in comparison with those at the other stages. Residual levels in the plant parts were in order of root> stem> leaf. 3. Inhibition of photosynthetic rate was more serious in Hop plants than those in Hansam vine. The photosynthetic rate was suppressed at the second growing stage by Heptachlor epoxide and greatly reduced at the third growing stage. 4. Chlorophyll contents were not significantly changed in Hops and Hansam vine. Decreasing trends of the chlorophyll contents in both plants treated with the pesticides were similar to those of control plants.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.267-272
• /
• 2012

In this paper, we study multi-hop cooperative transmission protocols using fountain codes. The proposed protocols can reduce the end-to-end delay and number of stages compared to those in conventional multi-hop transmission. VariousMonte-Carlo simulations are presented to evaluate and compare performance of the protocols over Rayeigh fading channels.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.27-37
• /
• 2004

The existing ad hoc network protocols suffer the scalability problem due to the inherent characteristics of node mobility. Cluster-based routing protocols divide the member nodes into a set of clusters and perform a hierarchical routing between these clusters. This hierarchical feature help to improve the scalability of ad hoc network routing. However, previous k-hop cluster-based routing protocols face another problems, that is, control overhead of the cluster headers. This paper proposes a novel k-hop cluster-based routing scheme with delegation functions for mobile ad hoc networks. The scheme employs is based on tree topology to manage cluster members in effectively. The cluster headers do not manage the routing table for whole members, while the header keeps the routing table for its neighbor members and the member list for one hop over nodes within k-hop cluster. Then the in-between leveled nodes manage the nested nodes which is structured in the lower level. Therefore, the proposed mechanism can reduce some control overhead of the cluster leaders.