• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.49-58
• /
• 2006

When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.639-648
• /
• 2005

A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized ad-ministration. Numerous routing protocols have been developed for changing messages among the nodes in a wireless ad-hoc network. Some multi-path routing protocols have also been proposed to support load balancing and QoS for wireless ad-hoc networks. In this paper, we propose not only an efficient routing algorithm for wireless ad-hoc net-worts but also a protocol that can improve data transmission rate and reduce end-to-end delay. In our protocol, each mobile node need not broadcast routing messages periodically and the mobile node that wants to send data packets initiates route request and route establishment procedure. By simulation, we showed that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.694-699
• /
• 2014

In mobile ad-hoc networks (MANET), the network topology and neighboring nodes change frequently, since MANET is composed of nodes that have mobility without a fixed network infrastructure. The AODV routing protocol is advantageous for MANET, but AODV has a delay in the transmission of data packets because AODV can not transmit data during route recovery. This paper proposes solving the above problem of AODV by using a bypass generation mechanism for data transmission during route recovery. For further improvement, additional mechanisms that coordinate the reception threshold of a hello packet are proposed in order to improve the accuracy of the information obtained from the neighboring nodes when the bypass is generated due to a link failure and the immediacy of the route recovery. Simulation results show that the proposed technique improves the performance in terms of the delay in transmission compared to traditional AODV.

• Journal of The Korean Society of Clinical Toxicology
• /
• v.19 no.2
• /
• pp.93-99
• /
• 2021

Purpose: Nutritional status and support in critically ill patients are important factors in determining patient recovery and prognosis. The aim of this study was to analyze the early nutritional status and the methods of nutritional support in critically ill patients with acute poisoning and to evaluate the effect of nutritional status on prognosis. Methods: A retrospective study was conducted in tertiary care teaching hospital from January 2018 to December 2020. in an emergency department of university hospital, 220 patients who were stayed more than 2 days of poisoning in intensive care unit were enrolled. Results: 155 (70.5%) of patients with acute poisoning had low-risk in nutritional risk screening (NRS). Patients with malignancy had higher NRS (low risk 5.2%, moderate risk 18.5%, high risk 13.2%, p=0.024). Patients of 91.4% supplied nutrition via oral route or enteral route. Parenteral route for starting method of nutritional support were higher in patients with acute poisoning of herbicide or pesticide (medicine 3.2%, herbicide 13.8%, pesticide 22.2%, p=0.000). In multivariate logistic regression analysis, herbicide or pesticide intoxication, higher risk in NRS and sequential organ failure assessment over 4.5 were affecting factor on poor recovery at discharge. Conclusion: NRS in patients intoxicated with herbicide or pesticide were higher than that in patients intoxicated with medicine intoxication. Enteral nutrition in patients intoxicated with herbicide or pesticide was less common. Initial NRS was correlated with recovery at discharge in patient with intoxication. It is expected to be helpful in finding patients with high-risk nutritional status in acute poisoning patients and establishing a treatment plan that can actively implement nutritional support.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2B
• /
• pp.151-161
• /
• 2009

The PULSE protocol can greatly reduce power consumption using a node's sleep state. But this protocol does not consider movement of a sink node in a sensor network. In the mobile sensor network a routing protocol must recover path error by movement of a sink node as quickly as possible. Therefore we have to achieve fast path recovery and power saving to support movement of a sink node in a sensor network. This paper proposes the Mobile PULSE protocol which is a improved routing protocol for a mobile sink node. And we evaluate Mobile PULSE and show that the Mobile PULSE reduces the recovery time about 40% compared with original PULSE protocol. Mobile PULSE increases energy consumption than PULSE as a maximum of 0.8%, which means Mobile PULSE is similar to PULSE in energy consumption. This paper shows mobile PULSE's capability in the mobile sensor network through evaluation of path recovery time and power consumption.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.81-90
• /
• 2004

A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes dynamically self-organizing in arbitrary and temporary network topologies without the use of any existing network infrastructure. The AODV (Ad Hoc On-Demand Distance Vector) Protocol is one of the typical reactive routing protocols, in that mobile nodes initiate routing activities only in the presence of data packets in need of a route. In this paper, we focus upon the local repair mechanism of AODV. When a link is broken, the upstream node of the broken link repairs the route to the destination by initiating a local route discovery process. The process involves the flooding of AODV control messages in every node within a radius of the length from the initiating node to the destination. In this paper, we propose an efficient local repair scheme for AODV called AFLRS (AODV-based Fast Local Repair Scheme). AFLRS utilizes the existing routing information in the intermediate nodes which have been on the active route to the destination before a link break occurs. AFLRS can reduce the flooding range of AODV control messages and the route recovery time because it can repair route through the intermediate nodes. For the performance evaluation of the proposed AFLRS, we have simulated the local repair mechanisms by using NS2 and AODV-UU. The performance results show that AFLRS can achieve faster route recovery than the local repair mechanism of AODV.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.105-108
• /
• 2003

In the next generation backbone networks based on dense-wavelength division multiplexing (DWDM), the routing and wavelength assignment with quality-of-service (QoS) recovery is essentially needed to support a wide range of communication-intensive and real-time multimedia services. This paper proposes a new dpmic routing method called as MW-MIPR (MultiWavelength-Minimum Interference Path Routing), which chooses a route that does not interfere too much with many potential future connection requests. This paper also proposes a differentiated RWA mechanisms combined with MW-MIPR algorithm to provide QoS recovery for various multimedia applications in the next generation backbone networks based on DWDM.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.400-401
• /
• 2013

Mobility in a network causes link disconnections and link recovery is vital for reliability of a network. A link failure affects all the preceding nodes on a damaged routing path; creates communication delay, throughput degradation, and congestion. This paper proposes link recovery mechanisms in CCN based networks. Packet overhearing is used to update neighboring nodes information. The recovery is done by forwarding node resulting in low control overhead, and better efficiency. The proposed mechanisms increase overall performance of a typical CCN and simulation results show that our proposed scheme works very well in densely populated networks with high mobility.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.12 no.6
• /
• pp.483-490
• /
• 2007

The aim of the paper is to analysis on train propulsion system and to study for energy saving. For this study, we make the program that simulate actual operation of the train route. The train running simulation is performed from starting station to 4th station by using the route datas of Deajeon Metro Subway. The study for control method of electrical motor and energy recovery to save energy is selected. The train propulsion system is constituted as a M-G Set, which is realized via Space Vector Modulation(SVM) - Direct Torque Control(DTC), the energy consumption during train operation and energy recovery during breaking is simulated by Simplorer program, from this result, the energy consumption and recovery of train with SVM-DTC is studied.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.4
• /
• pp.781-787
• /
• 2007

Network Mobility (NEMO) basic support protocol doesn't execute the process of route optimization and has not presented the particular security mechanism in other blocks except hi-directional tunnel between Mobile Router (MR) and its Home Agent (HA). Therefore in this paper we process secure route optimization courses through authenticated binding update protocol between MR and its Correspondent Node (CN) and the protocol of the competency of mandate between MR and its Mobile Network Node (MNN); its block also uses an bi-directional tunnel as the block between MR and its HA. The address of each node are generated by the way of Cryptographically Generated Address (CGA) for proving the ownership of address. Finally we analyze the robustness of proposed protocol using security requirements of MIPv6 and existing attacks and the efficiency of this protocol using the connectivity recovery and end-to-end packet transmission delay time.