• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.37-42
• /
• 2012

LED is just a semiconductor which can produce light. Currently, there are active research works on LED lighting technologies according to the growth of energy-saving environmental industry. Especially, LED communication is one of the active research works in these fields. In this paper, we design a LED communication-based multi-hop transmission wireless network system. The designed system consists of a transmission circuit system(transmitter) using LED and a receiving circuit system(receiver) using PD(photo detector) and OP-Amp, and relay system which can support multi-hop wireless network service with PD, OP-Amp, and LED, respectively. The experiments for the designed system are performed as follows. One computer is connected at the end of transmitter and receiver, respectively. There are two relays between transmitter and receiver, and text files are transmitted continuously by using text transmission programming. In this experiment, we test the performance with various baud rates, transmission ranges.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.291-296
• /
• 2012

In this Paper, we propose a multi-hop transmission in cognitive underlay network. In Secondary network, We assume that a secondary source S attempts to transmit D its signal to a secondary destination via N+1 hops with help of N relays $R_1$, $R_2$, ${\ldots}$, $R_N$. At hop k between relay $R_k$ and relay $R_{k+1}$. we assume that there is a primary user $PU_k$. In this paper, we assume that these channels are Rayleigh fading channels. In underlay network, the secondary transmitter has to adapt its power so that the interference caused at the primary user is less than a maximum interference threshold. considering the hop transmission between the transmitter and the repeater, we find transmit power and signal-to-noise ratio(SNR). Between the transmitter from the receiver depending on the number of relay in the underlay network, we compared to find the transmit power and signal-to-noise ratio(SNR). Finally we find optimal number of relay and optimal threshold value.

• Korean Journal of Applied Biomechanics
• /
• v.21 no.5
• /
• pp.621-629
• /
• 2011

The purpose of this study was to analyze the kinematics of the women's triple jump event at the 2011 Daegu World a Chmpionships by comparing them to those of the 2009 Berlin World Championships. The kinematic data were gathered from two steps before take off to the landing using a 7-camera panorama system. The data were then divided into 3 phases for each of the 8 participants. Similar average results were found the final contestants in the Daegu and Berlin championships, 14.58 m and 14.51 m, respectively. The first step had a relatively short length percentage (29%) compared to the hop and jump (36% and 35%, respectively). At the take off, the horizontal velocity was the lowest for the step, followed by the hop and jump. These results were different from the results for the men, who had an order of hop, step, and jump. Overall, in a comparison of the Daegu and Berlin participants, the vertical speed at take off for the three events was reduced compared to the horizontal speed.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.3
• /
• pp.317-324
• /
• 2016

WiMedia provides the data rate of up to 1Gbps, but the transmission range is restricted to approximately 10 meters. When constructing a multi-hop WiMedia network to extend its coverage, conventional hop-based routing may not guarantee satisfactorily the required QoS. We propose two QoS routing techniques for the WiMedia-based wireless mesh network. The proopsed QoS routing reflects the characteristics of TDMA-based WiMedia MAC and develops QoS extensions separately for on-demand routing and table-driven routing. Through simulations, we identify that the QoS routing shows better performance than the hop-based routing. It also turns out that the QoS on-demand routing and the QoS table-driven routing show conflicting performance results depending on the transmission power.

• The Journal of the Korea Contents Association
• /
• v.13 no.2
• /
• pp.52-61
• /
• 2013

In wireless sensor networks, the geographical positioning scheme is one of core technologies for sensor applications such as disaster monitoring and environment monitoring. For this reason, studies on range-free positioning schemes have been actively progressing. The density probability scheme based on central limit theorem and normal distribution was proposed to improve the location accuracy in non-uniform sensor network environments. The density probability scheme measures the final positions of unknown nodes by estimating distance through the sensor node communication. However, it has a problem that all of the neighboring nodes have the same 1-hop distance. In this paper, we propose an efficient sensor positioning scheme that overcomes this problem. The proposed scheme performs the second positioning step through the sensing range control after estimating the 1-hop distance of each node in order to minimize the estimation error. Our experimental results show that our proposed scheme improves the accuracy of sensor positioning by about 9% over the density probability scheme and by about 48% over the DV-HOP scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.567-574
• /
• 2013

Recently, many researches on P2P overlay network-based multimedia streaming services have been actively performed because of their high scalability and cost-efficiency advantages. However, P2P overlay networks also have the shortcoming of generating higher traffic owing to their unicast-based one-to-many multimedia deliveries. In order to reduce the traffic generated by the P2P streaming overlay network, we propose an ISP and locality-based parent node discovery method and check its feasibility through an implementation of a prototype streaming system. The measurement of RTTs and hop counts for random nodes having different ISPs and localities shows the proposed method to be able to shorten about 32% RTTs and about 17% Hop counts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.1030-1037
• /
• 2008

This paper presents an algorithm for the path-finding problem in unknown environments with cooperative and commutative multi-robots. To verify the algorithm, we investigate the problem of escaping through the exit of a randomly generated maze by muti-robots. For the purpose, we adopt the so called frontier cells and cell utility functions, which were used in the exploration problem for the multi-robots. For the wireless communications among the mobile robots, we modify and utilize the so called the random basket routing, a kind of hop-by-hop opportunistic routing. A mobile robot, once it finds the exit, will choose its next action, either escape immediately or stay-and-relay the exit information for the others, where the robot takes one action based on a given probability. We investigate the optimal probability that minimizes the average escaping time (out of the maze to the exit) of a mobile robot.

• The Plant Pathology Journal
• /
• v.28 no.4
• /
• pp.423-427
• /
• 2012

Pseudomonas syringae pv. actinidiae strains, the causal agents of bacterial canker on kiwifruit, were isolated from Korea and Italy in 2011. Among 87 isolates, a total of six representative strains, three from Korea and three from Italy, were identified on the basis of biochemical and physiological tests. Identities were confirmed by PCR using P. syringae pv. actinidiae-specific primers PsaF1/R2, which amplified a 280-bp DNA fragment. The strains isolated from Korea in this study displayed BOX-PCR patterns similar to those isolated from Italy but different from those isolated previously in Korea or the pathotype P. syringae pv. actinidiae strain. The effector hopA1 and hopH1 genes, which are known to be present in strains isolated recently from France and Italy, were also present in P. syringae pv. actinidiae strains, SYS1, SYS2 and SYS4, isolated from Korea in this work. However, no amplicons of the expected size were obtained from strains previously isolated from Korea and Japan. In addition, the Korean strains isolated in this work belonged to haplotype I for the cts gene identical to those strains isolated from recent outbreaks in Italy. These results suggest that P. syringae pv. actinidiae strains isolated from Korea and examined in this work are a new type of strain similar to those found from recent outbreaks in Italy. This is the first report on the occurrence of cts haplotype I strains of P. syringae pv. actinidiae affecting kiwifruit plants in Korea.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3176-3182
• /
• 2009

The PBNM on MANET is being researched to ensure the reliability and efficiency between mobile nodes. Therefore, it is essential to determine the cluster effectively which will perceive the movements of nodes and distribute the policies. In PBNM mechanism, to determine the node cluster for PDP and manage PEP nodes, Active PDP Discovery Protocol is proposed as a mechanism which is more efficient than preexistent techniques. While k-hop cluster selects the PEP nodes which PDP node manages, Active PDP Discovery actively selects the PDP node among the moving PEP node. This method prevents orphan nodes that are not connected to PDP and reduces continual broadcasting messages. This paper implements Active PDP Discovery which determines cluster in the real networks and analyzes its capability, expanding COPS-PR to detect the movement of nodes and adding MNL to PDP node.