• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1299-1303
• /
• 2005

Over the last decade the research of end-to-end behavior on computer network has grown by orders but it has few researching in hop-by-hop behavior. We think if we know hop-by-hop behavior it can make better understanding in network behavior. This paper represent ICMP time stamp request and time stamp reply as tool of network study for learning in hop-by-hop behavior to estimate link bandwidth and link structure. We describe our idea, experiment tools, experiment environment, result and analysis, and our discussion in our observative.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.215-236
• /
• 2017

Obtaining accurate location information is important in practical applications of wireless sensor networks (WSNs). The distance vector hop (DV-Hop) is a frequently-used range-free localization algorithm in WSNs, but it has low localization accuracy. Moreover, despite various improvements to DV-Hop-based localization algorithms, maintaining a balance between high localization accuracy and good stability and convergence is still a challenge. To overcome these shortcomings, we proposed an improved DV-Hop localization algorithm based on the bat algorithm (IBDV-Hop) for WSNs. The IBDV-Hop algorithm incorporates optimization methods that enhance the accuracy of the average hop distance and fitness function. We also introduce a nonlinear dynamic inertial weight strategy to extend the global search scope and increase the local search accuracy. Moreover, we develop an updated solutions strategy that avoids premature convergence by the IBDV-Hop algorithm. Both theoretical analysis and simulation results show that the IBDV-Hop algorithm achieves higher localization accuracy than the original DV-Hop algorithm and other improved algorithms. The IBDV-Hop algorithm also exhibits good stability, search capability and convergence, and it requires little additional time complexity and energy consumption.

• The Research Journal of the Costume Culture
• /
• v.9 no.5
• /
• pp.747-758
• /
• 2001

The purpose of this study was to make hip-hop clear as a comprehensive cultural factor, and to analyze how it was reflected and shown in the modern fashion. The fashion influenced by hip-hop consisted of music(mcing), dance(b-boying), art(graffiti), technology(djing), and clothing(hip-hop style) was as follows; 1. Each music, dance, and art factor was expressed as multiethnic style, a oversized sportive style, and a graffiti look. 2. Oversized-Sportive style was the most peculiarity in Old School's hip-hop fashion. 3. Sportive style was changed into Multiethnic-Baggy style in New School's hip-hop fashion.

• Korean Journal of Food Science and Technology
• /
• v.52 no.3
• /
• pp.296-303
• /
• 2020

Hop-resistant lactic acid bacteria (LAB) are well-known, major beer-spoilage bacteria. The hop-gradient agar containing ethanol (c-HGA+E) method has been used to examine hop-resistance of beer-spoilage LAB. However, the selection of beer-spoilage bacteria by the c-HGA+E method is either too selective or too inclusive. Furthermore, it is accompanied by a complicated experimental procedure, high-cost and time. To overcome these disadvantages, the modified hop-gradient agar with ethanol (m-HGA+E) method was developed. The most remarkable modifications were the shape of the petri dish and the inoculation method for bacteria. The efficiency and validation of the m-HGA+E approach were proven by the formation of colonies at different hop concentrations in the bottom layer, co-culture with the bacteriocin producer and by PCR detection of hop-resistant genes. This study demonstrated that m-HGA+E is a rapid, economical, and easy method to monitor potential hop-resistant beer-spoilage LAB during the beer brewing process.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.1
• /
• pp.16-27
• /
• 2012

In multi-interface multi-channel(MIMC) based tactical ad hoc networks, QoS support for required operational capacity is one of the main challenging issues for multi-hop transmissions. To support QoS in such a harsh environment, we propose a novel MAC scheme to minimize multi-hop as well as per-hop delay. The current IEEE 802.11 MAC protocols should contend to reserve the channel resource at every hop by each sender. The every-hop channel contention results in a degradation of end-to-end delay for multi-hop transmissions. The basic idea of our scheme is to make a "multi-hop reservation" at the MAC layer by using the modified RTS frame. It contains additional information such as destination information, packet priority, and hop count, etc. In addition, we differentiate the contention window area according to the packet priority and the number of hops to deliver packets in the predefined allowed latency. Our scheme can minimize the multi-hop delay and support the QoS of the critical data in real time(i.e., VoIP, sensing video data, Video conference between commanders). Our simulation study and numerical analysis show that the proposed scheme outperforms the IEEE 802.11 MAC.

• Journal of Plant Biology
• /
• v.17 no.4
• /
• pp.11-17
• /
• 1974

The present investigation dealt with observation and experiments concerning the growth and differentiation of hop plant, using the varieties of Cascade(C), Shinshuwase(Sh), and Hallertau(H). The results were as follows: (1) Life cycle of hop plants. The annual growth period of hop plant was devided chiefly into 3 phases, dormant, vegetative and reproductive. (2) Growth of main stem. The hop vine begun to grow in the middle of May and grow vigorousely in the middle and latter of June, then gradually decline or stops at the middle of July and the early of August. (3) Growth of lateral vines. By the statistical analysis, it is judged that the varieties of H and Sh were more grown than that of C. H and Sh were not significant, but H and Sh from C were significant in 5% level. (4) Fresh weight and water content of hop cone. Hop cone in fresh weight of C variety was higher than those of other two varieties and water content of hop cone was decreased with time elapse in three races together. (5) Growing point. Histological view of hop varities in each was different. C showed form of sweet potato, H showed form of round, and Sh showed form of ellipse. (6) Shape of the leaf. C and H were 3 lobes, but Sh is 3∼5 lobes. Generally, the color is dark green. (7) Hop cones. Hop cones are as follows.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.65-75
• /
• 2009

In Wireless Sensor Network, the sensor node localization is important issue for information tracking, event detection, routing. Generally, in wireless sensor network localization, the absolute positions of certain anchor nodes are required based on the use of global positioning system, then all the other nodes are approximately localized using various algorithms based on a coordinate system of anchor DV-Hop is a localized, distributed, hop by hop positioning algorithm in wireless sensor network where only a limited fraction of nodes have self positioning capability. However, instead of uniformly distributed network, in anisotropic network with possible holes, DV-Hop's performance is very low. To address this issue, we propose Group based DV-Hop (GDV-Hop) algorithm. Best contribution of GDV-Hop is that it performs localization with reduced error compared with DV-Hop in anisotropic network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.442-445
• /
• 2006

In Wireless Sensor Networks(WSNs), a sensor node broadcasts an acquisited data to neighboring other nodes and it makes serious data duplication problem that increases network traffic loads and data loss. This problem is concerned with the conflict condition for supporting both the reliability of data transfer and avoidance of network congestion. To solve the problem, a reliable congestion control protocol is necessary that considers critical factors affecting on data transfer reliability such as reliable data transmission, wireless loss, and congestion loss for supporting effective congestion control in WSNs. In this paper, we proposes a reliable congestion protocol, ratted HRCCP, based on hop-hop sequence number, and DSbACK by minimizing useless data transfers as an energy-saved congestion control method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.595-605
• /
• 2012

DV-Hop is one of the well known range-free localization algorithms. The algorithm works well in case of isotropic network since the sensor and anchor nodes are placed in the entire area. However, it results in large errors in case of anisotropic networks where the hop count between nodes is not linearly proportional to the Euclidean distance between them. Hence, we proposed a novel range-free algorithm for anisotropic networks to improve the localization accuracy. In the paper, the Euclidean distance between anchor node and unknown node is estimated by the average hop distance calculated at each hop count with hop count and distance information between anchor nodes. By estimating the unknown location of nodes with the estimated distance estimated by the average hop distance calculated at each hop, the localization accuracy is improved. Simulation results show that the proposed algorithm has more accuracy than DV-Hop.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1022-1025
• /
• 2008

Session Initiation Protocol (SIP) has become the call control protocol of choice for Voice over IP (VoIP) networks because of its open and extensible nature. However, the integrity of call signaling between sites is of utmost importance, and SIP is vulnerable to attackers when left unprotected. Currently a herby-hop security model is prevalent, wherein intermediaries forward a request towards the destination user agent sewer (UAS) without a user agent client (UAC) knowing whether or not the intermediary behaved in a trusted manner. This paper presents an integrated security model for SIP-based VoIP network by combining hop-by-hop security and end-to-end security.