• Journal of Digital Contents Society
• /
• v.9 no.4
• /
• pp.785-790
• /
• 2008

Our Digital Carousel enables user to share media objects through media synchronization mechanism. We implemented the Digital Carousel so that the users participated in collaborative work may refer shared media or error objects as the same view to others. In this paper, we discuss a method for increasing reliability through fault tolerance. We describe the design and implementation of the ER running on distributed multimedia environment. ER is a system which is able to recover automatically a software error based on distributed multimedia. This paper explains a performance analysis of an error recovery system running on distributed multimedia environment using the rule-based DEVS modeling and simulation techniques. In DEVS, a system has a time base, inputs, states, outputs, and functions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1333-1341
• /
• 2010

The goal of this research is to enhance the maintenance and monitoring system of ship environment using sensor network. It is important to know the location information of sensor nodes to control the sensors and to obtain the sensor data from sensor network inside the ship. In this paper, we address the grouping and routing mechanism according to the relative distance of sensor nodes, based on LEACH and PEGASIS. We also consider the fault tolerant mechanism using the location information of sensor nodes.

• The Journal of the Korea Contents Association
• /
• v.12 no.1
• /
• pp.80-90
• /
• 2012

Medical data sampled through medical sensor nodes can provide services properly only when the data are not lost even during the fault of a home health gateway. The loss of medical data can be minimized if a sensor node, in which it is expected that there are the most saving spaces, is selected after medical sensor nodes tentatively conduct local save or communicate with each other during a fault when data cannot received. Furthermore, efficient saving techniques are necessary since the cycle for sampling information is different according to the type of medical data and a space for distributed saving is different for each apparatus. So, this research suggests an efficient distributed archiving protocol (DAP) for medical data sensor nodes, each of which has a diverse sampling cycle. In order to confirm the usefulness of DAP, DAP between sensor node and gateway was designed and materialized. An experiment was conducted using the materialized program and earned a high level of recovery rate (99.3%) and of accuracy rate, which confirms that sensor nodes can play their role during a temporary fault.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.879-888
• /
• 2004

Ad Node transmits packets to a destination node using routing function of intermediate nodes on the path in Ad Hoc networks. When the link to a next hop node in a path is broken due to the next hop node's mobility, a new route search process is required for continuing packets transmission. The node which recognizes link fault starts a local route recovery or the source node starts a new route search in the on demand routing protocol AODV. In this case, the new route search or the local route search brings packet delays and bad QoSs by packet delay. We propose RPAODV that the node predicts a link fault selects a possible node in neighbor nodes as a new next hop node for the path. The proposed protocol can avoid path faults and improve QoS.

• The KIPS Transactions:PartA
• /
• v.16A no.1
• /
• pp.17-26
• /
• 2009

Large-scale wireless sensor network are expected to play an increasingly important role for the data collection in harmful area. However, the physical fragility of sensor node makes reliable routing in harmful area a challenging problem. Since several sensor nodes in harmful area could be damaged all at once, the network should have the availability to recover routing from node failures in large area. Many routing protocols take accounts of failure recovery of single node but it is very hard these protocols to recover routing from large scale failures. In this paper, we propose a routing protocol, which we refer to as LSFA, to recover network fast from failures in large area. LSFA detects the failure by counting the packet loss from parent node and in case of failure detection LSFAdecreases the routing interval to notify the failure to the neighbor nodes. Our experimental results indicate clearly that LSFA could recover large area failures fast with less packets than previous protocols.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.779-786
• /
• 2003

We propose a correction security framework as next generation security technology to provide secure and reliable Internet services. The framework guarantees durability of the services in spite of external attack, intrusion, vulnerability for fault tolerance, and network management technology that covers the set of techniques aimed at providing rapid service recovery. The improvement technology includes system itself improvement and synamic improvement preventing faults from being re-activated, in cooperation with other systems such as vulnerability anaysis system, NMS, ESM. It is expected that our framework will be applied to global networks as well as system alone, and be able to guarantee the network survivability and reliable Internet services.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.1
• /
• pp.98-104
• /
• 2004

This paper represents the fast and efficient load transfer guide for fault or outage restoration in distribution system. For restoration guide, system trace is performed to reverse direction(source side) from tie breaker in tree-structured distribution network. Search space and breaker's combinational number for restoration guide are greatly reduced. It is proposed the load transfer method including first stage restoration(single load transfer, double load transfer, triple load transfer), second stage restoration(transferring load to neighboring feeder in order to expand the capacity margin) and load cutoff guide. The proposed method can be easily applied to primary customer restoration, multi-fault recovery and distribution automation system.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.3
• /
• pp.35-43
• /
• 2004

Internet-based P2P computing with independent machines suffers from frequent disconnections and security threats caused by leaving, failure, network diversity, or anonymity of participated machines. Replication schemes of shared resources are used for solving these issues in many studies and implementations. We propose an operational replication scheme in P2P computing to share computing resources, and the scheme verifies the correctness of operation against faults and security threats. This verifications are carried out periodically on replicated and dependent working units without global message exchanges over the whole system. The verified working units are treated as checkpoints, and thus they could be put to practical use for fault-tolerance with rollback recovery.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.3
• /
• pp.399-404
• /
• 2015

This paper presents the DC voltage control method in DC link of High Voltage Direct Current(HVDC) for an offshore wind farm in Low Voltage Ride Through(LVRT) situation. Wind generators in an offshore wind farm are connected to onshore network via HVDC transmission. Due to LVRT control of grid side inverter in HVDC, power imbalancing in DC link is generated and this consequentially causes rising of DC voltage. A de-loading scheme is one of the method to protect the wind power system DC link capacitors from over voltage. But the flaw of this method is slow control response time and that it needs long recovery time to pre-fault condition after fault clear. Thus, this paper proposes improved de-loading method and we analyze control performance for DC voltage in LVRT control of HVDC for an offshore wind farm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1046-1054
• /
• 2002

In this paper, we propose a subnetwork-based segment restoration scheme to reduce the restoration time and restoration resources. And we compare and analyze the restoration performance according to the size of divided subnetworks. Segment restoration is based on network partitioning where a large network is divided into several small subnetworks and the end-to-end data path is divided into multiple segments according to the subnetworks. In segment restoration, the link/node failure is restored by segment instead of end-to-end path. Because most faults are restored within the subnetwork, the restoration performance can be improved. From the simulation analysis, we verified that the proposed segment restoration has advantage of restoration time and backup resource utilization.