• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.99-100
• /
• 2010

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.357-357
• /
• 2007

• Journal of Plant Biology
• /
• v.18 no.2
• /
• pp.59-85
• /
• 1975

With a view to obtaining basic informations on the morphological, physiological and ecological aspects of hop in Korea, this experiments were conducted in 4 locations (Suwon, Hongchun, Pyungchang and Hoengsung) from 1972 to 1974. The varieties used in this experiments were Hallertau, Saaz, Shinshuwase and Cascade. the results obtained are summarized as follows.

• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.294-300
• /
• 2010

In this paper, We analysis of effective coverage extension for Tri-sector cellular systems using Multi-hop Relay based on IEEE802.16j system. In the proposed international standard of IEEE 802.16j MMR (Mobile Multi-hop Relay) use of the omni-directional antenna, 3-sector and 6-sector antenna is considered to Base Station and Relay Station. Omni-directional antenna service can offer as all directions but a throughput decreases due to the signal interference of near Relay Stations. In the directional antenna, cause of an interference with the base station which it arranges an antenna so that a beam can have the direct and does with neighbor Base Station and Relay Station can be reduced interference, therefore the effective throughput is higher than the omni-directional antenna system. But, In case of Base Station and Relay Station use the directional antenna, the efficiency which the directional antenna has the Co-channel interference due to in the different cell by the channel reuse is decreased. In this study, we propose the structure of arranging the Base Station and Relay Station having the directional antenna in the NBTC, WBTC antenna in a multi-tier. It compared and analyzed with the mode that the multi-hop Relay Station has the omni-directional antenna, Relay Station are used the NBTC antenna and the WBTC antenna system also, We analyze a relation between the performance degradation and the cell coverage extension which it follows because the number of hop in the multi-hop Relay Station.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.39-45
• /
• 2012

In this paper, a distributed 2-hop routing algorithm is proposed. The main purpose of the proposed algorithm is to reduce the overall power consumption of each sensor node so that the lifetime of WSN(wireless sensor network) is prolonged. At the beginning of each round, the base station transmits a synchronization signal that contains information on the priority table that is used to decide whether each sensor node is elected as a cluster head or not. The priority table is constructed so that sensor nodes closer to half energy distance from the base station get the higher priority. 2-hop routing is done as follows. Cluster heads inside half energy distance from the base station communicate with the base station directly. Those outside half energy distance have to decide whether they choose 2-hop routing or 1-hop routing. To do this, each cluster head outside half energy distance calculates the energy consumption needed to communicate with the base station via 1-level cluster head or directly. If less energy is needed when passing through the 1-level cluster head, 2-hop routing is chosen and if not, 1-hop routing is chosen. After routing is done each sensor nodes start sensing data.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.558-564
• /
• 2013

Wireless sensor networks (WSNs) contain limited energy resources and are left in open environments. Since these sensor nodes are self-operated, attacks such as sinkhole attacks are possible as they can be compromised by an adversary. The sinkhole attack may cause to change initially constructed routing paths, and capture of significant information at the compromised node. A localized encryption and authentication protocol (LEAP) has been proposed to authenticate packets and node states by using four types of keys against the sinkhole attack. Even though this novel approach can securely transmits the packets to a base station, the packets are forwarded along the constructed paths without checking the next hop node states. In this paper, we propose the next hop node selection method to cater this problem. Our proposed method evaluates the next hop node considering three factors (i.e., remaining energy level, number of shared keys, and number of filtered false packets). When the suitability criterion for next hop node selection is satisfied against a fix threshold value, the packet is forwarded to the next hop node. We aim to enhance energy efficiency and a detour of attacked areas to be effectively selected Experimental results demonstrate validity of the proposed method with up to 6% energy saving against the sinkhole attack as compared to the LEAP.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.8
• /
• pp.191-200
• /
• 2019

In an Ad-hoc network, a method of time synchronizing all the nodes in a network centering on one reference node can be used. A representative algorithm based on a reference node is Flooding Time Synchronization Protocol (FTSP). In the process of sending and receiving messages, predictable and unpredictable delays occur, which should be removed because it hinders accurate time synchronization. In multi-hop communications, hop delays occur when a packet traverses a number of hops. These hop delays significantly degrade the synchronization performance among nodes. Therefore, we need to find a method to reduce these hop delays and increase synchronization performance. In the FTSP scheme, hop delays can be greatly increased depending on the position of a reference node. In addition, in FTSP, a node with the smallest node ID is elected as a reference node, hence, the position of a reference node is actually arbitrarily determined. In this paper, we propose an optimal reference node election algorithm to reduce hop delays, and compare the performance of the proposed scheme with FTSP using the network simulator OPNET. In addition, we verify that the proposed scheme has an improved synchronization performance, which is robust to topology changes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.307-309
• /
• 2012

노드의 위치인식은 M2M 무선센서네트워크에서의 위치에 기반을 둔 여러 응용들을 위해 매우 중요한 문제이다. 센서 네트워크에서의 위치인식은 거리 정보가 사용되느냐 그렇지 않느냐에 따라 range-free와 range-based 기법으로 분류될 수 있는데, 센서노드 특성상 제한된 하드웨어로 동작해야 한다는 점에서 range-free 위치인식 기법이 range-based 기법에 비해 효율적인 방법이라 할 수 있다. DV-Hop은 range-free 위치인식 기법 중 대표적인 것으로서 홉 수와 거리 간 추정을 사용한다. 본 논문에서는 홉 수와 거리 간 추정을 위해 홉 수보다 거리와의 상관도가 높은 홉 수 평균을 사용하여 DV-Hop 에 비해 정확도를 향상시킨 DV-ANHC 알고리즘을 제시한다.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.84-92
• /
• 2015

Multi-hop relay networks have been widely considered as a promising solution to extend the coverage area and to reduce the deployment cost by deploying the relay stations (RSs) in mobile communication systems. Suitable deployment for the RSs is one of the most important features of the demand nodes (DNs) to obtain a high data transmission rate in such systems. Considering a tradeoff among the network throughput, the deployment budget, and the overall coverage of the systems, efficient RS deployment schemes and corresponding algorithms must be developed and designed. A novel cluster-based RS deployment scheme is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. To make an ideal cluster distribution, the distances between the DNs are calculated when deploying the RSs. We take into account the traffic demands and adopt a uniform cluster concept to reduce the data transmission distances of the DNs. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the RSs. A better network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the network throughput and the coverage ratio. Additionally, a suitable deployment budget can be implemented in multi-hop relay networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.7
• /
• pp.566-572
• /
• 2014

We propose a two-way multi-hop relaying scheme improving the throughput as well as enlarging the coverage for ship-to-ship communications in multi-ship marine networks. The proposed scheme reduces the time slots required for the data exchange by designing data transmission and network coding procedures in a sophisticated way based on two-phase digital network coding. Simulation results show that the proposed two-way multi-hop relaying scheme improves the throughput of the conventional one about 5/3 times.