• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.325-336
• /
• 2005

Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.103-113
• /
• 2010

In this paper, a tradeoff between the total energy consumption-per-bit and the end-to-end rate under spatial reuse in wireless multi-hop network is developed and analyzed. The end-to-end rate of the network is the number of information bits transmitted (end-to-end) per channel use by any node in the network that is forwarding the data. In order to increase the bandwidth efficiency, spatial reuse is considered whereby simultaneous relay transmissions are allowed provided there is a minimum separation between such transmitters. The total energy consumption-per-bit includes the energy transmitted and the energy consumed by the receiver to process (demodulate and decoder) the received signal. The total energy consumption-per-bit is normalized by the distance between a source-destination pair in order to be consistent with a direct (single-hop) communication network. Lower bounds on this energy-bandwidth tradeoff are analyzed using convex optimization methods. For a given location of relays, it is shown that the total energy consumption-per-bit is minimized by optimally selecting the end-to-end rate. It is also demonstrated that spatial reuse can improve the bandwidth efficiency for a given total energy consumption-per-bit. However, at the rate that minimizes the total energy consumption-per-bit, spatial reuse does not provide lower energy consumption-per-bit compared to the case without spatial reuse. This is because spatial reuse requires more receiver energy consumption at a given end-to-end rate. Such degraded energy efficiency can be compensated by varying the minimum separation of hops between simultaneous transmitters. In the case of equi-spaced relays, analytical results for the energy-bandwidth tradeoff are provided and it is shown that the minimum energy consumption-per-bit decreases linearly with the end-to-end distance.

• Korean Journal of Plant Tissue Culture
• /
• v.28 no.6
• /
• pp.335-339
• /
• 2001

Grapevine leafroll-associated 3 closterovirus (GLRaV-3) is phloem limited virus, and one of the most severe viral diseases found in Korea. However, nonhomogenous distribution and low concentration and seasonal variations of GLRaV-3 in grapevines remain as main problems which prevent the introduction and molecular biology or serology experiments. Virus-infected plantlet in vitro was obtained from node tissue cuttings, which was GLRaV-3 infected 'kyoho' vines. The amount of purified virus was highest in vitro plantlet. Moreover, viruses seem to be relatively homogeneously distributed in all organs including leaf, stem and callus derived from in vitro plantlets. RT-PCR detection using in vitro plantlet tissue as template was most effective. When comparing ELISA to RT-PCR, RT-PCR detection was 1,000 times as effective as ELISA. These results can be explained by improved quality such as tenderness or less tannins in plantlet in vitro. In conclusion, until infected herbaceous host will be available, tissue culture can be usefully adopted as a technique for a good source of GLRaV-3 closterovirus for further studies.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.10 no.1
• /
• pp.25-33
• /
• 1986

In this paper, the frontal method based elastic-plastic F.E.M. program for mini-computer was developed. Since, the executable source program size was restricted by the system core memory size on the mini-computer, the active variables were memorized by the element base and the nonactive varables were memorized to the external disc file. The active variables of the finally developed program were reduced enough to execute about 1,000 freedom finite element on the mini-computer on which available variables were restricted as 32,767 integers. A modified CT fracture test specimen was examined to test the developed program. The calculated results were compared with experimental results concerning on the crack tip plastic deformation zone. Recrystallization technique was adopted to visualize the intensive plastic deformation regions. The Von-Mises criterion based calculation results were well agreed with the experimental results in the intensive plastic region which was over than 2% offset strain. The F.E.M. results using the developed program were well agreed with the theoritical plastic boundary which was calculated by the stress intensity factor as r$_{p}$=(K$_{1}$$^{2}$/2.pi..sigma.$_{y}$$^{2}$).f(.theta.).).).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.7
• /
• pp.1-8
• /
• 2011

Vehicular Ad-hoc Network (VANET) is a special form of Mobile Ad-hoc Network designed to provide communications among nearby vehicles without communications infrastructure. Some characteristics in VANET environment such as high mobility, dynamic topology and selfishness of nodes can cause degradation of network quality. In this paper, we propose an adaptive incentive/topology control scheme to improve network quality in VANET by stimulating real time data forwarding and reporting changes of network topology. In the proposed scheme, an incentive suggested by the source node is updated in real time simultaneously with data transmission to stimulate real time data forwarding. In addition, when the order of the nodes in the path is changed, nodes which report the changes of network topology will get an additional incentive. By computer simulation, it is shown that the proposed incentive/topology control scheme outperforms the conventional schemes with respect to data delivery time and data delivery ratio.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.5 no.5
• /
• pp.35-45
• /
• 2001

Recently, the floor systems those require large open space may have low inherent damping due to the decline of the use of curtain walls. Furthermore, the use of the high strength materials has resulted in more flexible and longer spanning in floor systems. The long span structures such as shopping malls, offices and large assembly rooms may lead to significant dynamic response due to human activities. Excessive vibrations make the occupants uncomfortable and deteriorate the serviceability of buildings. It is now proved that footfall loading is the major source of floor vibrations. The common method of application of walking loads for the vibration analysis of structures subjected to walking loads is to inflict measured walking loads and periodic function at a node. But this method could not account for the moving effect of walking. In this study, natural frequency and damping ratio of example structure are evaluated by heel drop tests. And the application of equivalent walking loads is used for on efficient vibration analysis of the plate structures subjected to walking loads.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.1088-1099
• /
• 2003

The syntax-directed translation using semantic actions is frequently used in construction of compiler for text programming languages. it is very useful for the language designers to develop compiler back-end using a syntax structure of a source programming language. Due to the lack of the integrated representation method for a parse tree node and modeling method of syntax structures, it is very hard to construct compiler using syntax-directed translation in visual languages. In this Paper, we propose a visual language compiler generation method for constructing a visual languages compiler automatically, using syntax-directed translation. Our method uses the Picture Layout Grammar as a underlying grammar formalism. This grammar allows our approach to generate parser efficiently u sing And-Or-Waiting Graph and encapsulating syntax definition as one unit. Unlike other systems, we suggest separating the specification and the generation of semantic actions. Because of this, it provides a very efficient method for modification.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1541-1548
• /
• 2012

This paper proposes a new multipath-based routing protocol on MANETs with Fast-Recovery of failures. The proposed protocol establishes the primary and secondary paths between a source and a destination considering the end-to-end packet reception reliability of routes. The primary path is used to transmit messages, and the secondary path is used to recover the path when detecting failures on the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to recover locally the route failure, the proposed protocol can reduce the number of packet loss and the amount of control packets for setting up new paths. The simulation result using QualNet simulator shows that the proposed protocol was about 10-20% higher than other protocols in terms of end-to-end message delivery ratio and the fault recovery time in case of link fault was about 3 times faster than the other protocols.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.713-716
• /
• 2007

This paper suggests One-time Password key exchange authentication technique for a strong authentication based on Ad-hoc Networks and through identify wireless environment security vulnerabilities, analyzes current authentication techniques. The suggested authentication technique consists of 3 steps: Routing, Registration, and Running. The Routing step sets a safe route using AODV protocol. The Registration and Running step apply the One-time password S/key and the DH-EKE based on the password, for source node authentication. In setting the Session key for safe packet transmission and data encryption, the suggested authentication technique encrypts message as H(pwd) verifiers, performs key exchange and utilizes One time password for the password possession verification and the efficiency enhancement. EKE sets end to end session key using the DH-EKE in which it expounds the identifier to hash function with the modula exponent. A safe session key exchange is possible through encryption of the H(pwd) verifier.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.165-174
• /
• 2006

Data dissemination using either flooding or legacy ad-hoc routing protocol is not realistic approach in the wireless sensor networks, which are composed of sensor nodes with very weak computing power, small memory and limited battery. In this paper, we propose the ELF(Energy-efficient Localized Flooding) protocol. The ELF is energy-efficient data dissemination protocol for wireless sensor networks. In the ELF protocol, there are two data delivery phases between fixed source and mobile sink node. The first phase, before the tracking zone, sensing data are forwarded by unicasting. After that, within the tracking zone, sensing data are delivered by localized flooding. Namely, the ELF Properly combines advantages from both unicasting and flooding. According to evaluation results by simulation, the proposed ELF protocol maintains very high data delivery ratio with using a little energy. Also, the property of average delay is better than others. From our research results, the ELF is very effective data dissemination protocol for wireless sensor networks.