• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.371-388
• /
• 2014

Cognitive Radio (CR) has been recently proposed as a promising technology to remedy the problems of spectrum scarcity and spectrum underutilization by enabling unlicensed users to opportunistically utilize temporally unused licensed spectrums in a cautious manner. In Cognitive Radio Ad Hoc Networks (CRAHNs), data routing is one of the most challenging tasks since the channel availability and node mobility are unpredictable. Moreover, the network performance is severely degraded due to large numbers of path failures. In this paper, we propose the Fault-Tolerant Cognitive Ad-hoc Routing Protocol (FTCARP) to provide fast and efficient route recovery in presence of path failures during data delivery in CRAHNs. The protocol exploits the joint path and spectrum diversity to offer reliable communication and efficient spectrum usage over the networks. In the proposed protocol, a backup path is utilized in case a failure occurs over a primary transmission route. Different cause of a path failure will be handled by different route recovery mechanism. The protocol performance is compared with that of the Dual Diversity Cognitive Ad-hoc Routing Protocol (D2CARP). The simulation results obviously prove that FTCARP outperforms D2CARP in terms of throughput, packet loss, end-to-end delay and jitter in the high path-failure rate CRAHNs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4774-4796
• /
• 2018

Wireless sensor networks are composed of a large number of inexpensive and tiny sensors used in different areas including military, industry, agriculture, space, and environment. Fault tolerance, which is considered a challenging task in these networks, is defined as the ability of the system to offer an appropriate level of functionality in the event of failures. The present study proposed an intelligent throughput descent and distributed energy-efficient mechanism in order to improve fault tolerance of the system against soft and permanent faults. This mechanism includes determining the intelligent neighborhood radius threshold, the intelligent neighborhood nodes number threshold, customizing the base paper algorithm for distributed systems, redefining the base paper scenarios for failure detection procedure to predict network behavior when running into soft and permanent faults, and some cases have been described for handling failure exception procedures. The experimental results from simulation indicate that the proposed mechanism was able to improve network throughput, fault detection accuracy, reliability, and network lifetime with respect to the base paper.

• International Journal of Contents
• /
• v.1 no.1
• /
• pp.21-28
• /
• 2005

This paper is about the hardness of Leader Election problem in asynchronous distributed systems in which processes can crash but links are reliable. Recently, the hardness of a problem encountered in the systems is defined with respect to the difficulty to solve it despite failures: a problem is easy if it can be solved in presence of failures, otherwise it is hard [9]. It is shown in [9] that problems are classified as three classes: F (fault-tolerant), NF (Not fault-tolerant) and NFC (NF-completeness). Among those, the class NFC is the hardest problem to solve. It is also shown in [9] that the construction of Perfect Failure Detector (problem P) belongs to NFC. In this paper, we show that Leader Election is also one of NFC problems by using a general reduction protocol that reduces the Leader Election Problem to P. We use a formulation of the Leader Election problem as a prototype to show that it belongs to NFC.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.313-323
• /
• 2000

In this paper, we consider ring embedding problem on (n,k)-star graphs. We first present a new ring embedding strategy and also prove the superiority in expandability by showing its application into the fault-tolerant ring embedding problem with edge faults. This result can be applied to the multicating applications that use the underlying cycle properties on the multi-computer system.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.803-816
• /
• 2001

This paper presents the design of strongly fail-safe interface which transform binary signals, generated by fault-tolerant system into fail-safe signals. The strongly fail-safe property is achived by means of self-checking techniques. It can be shown for this interface to be integreated while the conventional fail-safe interface require using discrete components. This paper also presents the new implementation methods by the definitions for fail-safe system.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1201-1210
• /
• 2000

In order to tolerate faults which may occur during the execution of distributed tasks in high-performance parallel computer systems, tasks are duplicated on different processors. In this paper, by utilizing the task duplication based scheduling algorithm, a new task scheduling algorithm which duplicates each task on more than two different processors with the minimum schedule length is presented, and the number of processors required for the duplication is analyzed with the ratio of communication cost to computation time and the workload of the system. A simulation with various task graphs reveals that the number of processors required for the full-duplex fault-tolerant task scheduling with the obtainable minimum schedule length increases about 30% to 75% when compared with that of the task duplication based scheduling algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.41-50
• /
• 2011

DNS(Domain Name System) is the Name Resolution Mechanism that makes conversion from a Domain Name of a computer on the Internet to an IP Address or the reverse conversion. In this paper we researched on the Foundation techniques of Fault-tolerant DNS Servers that the secondary DNS can take over and provide continuous services even though primary DNS stops due to some critical errors.

• Journal of Power Electronics
• /
• v.10 no.6
• /
• pp.686-693
• /
• 2010

In this paper, a fault diagnosis method based on fuzzy logic for the three-parallel power converter in a wind turbine system is presented. The method can not only detect both open and short faults but can also identify faulty switching devices without additional voltage sensors or an analysis modeling of the system. The location of a faulty switch can be indicated by six-patterns of a stator current vector and the fault switching device detection is achieved by analyzing the current vector. A fault tolerant algorithm is also presented to maintain proper performance under faulty conditions. The reliability of the proposed fault detection technique has been proven by simulations and experiments with a 10kW simulator.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.6
• /
• pp.526-532
• /
• 2007

This paper considers a fault tolerant control problem for a spacecraft using reaction wheels. Faults are assumed to be inherent to only actuators(reaction wheels) and a control algorithm to accommodate actuators' faults is proposed. An attitude control loop includes an angular velocity control loop. The time delay control method is used to make a spacecraft follow the command angular velocity and to accommodate actuators' faults. A stability condition for the proposed algorithm is derived and the performance is demonstrated by computer simulations.

• Korean Journal of Optics and Photonics
• /
• v.29 no.2
• /
• pp.58-63
• /
• 2018

As the quantum volume increases, we are about to use quantum computers for real applications. Therefore, it is necessary to investigate how much quantum-computational gain is achievable in the near future. In this work, we analyze a fault-tolerant quantum computing method for near-term applications such as the ground-state estimation problem. Based on quantitative analysis, we find that it is still necessary to improve the current fault-tolerant quantum computing. This work also discusses which parts should be improved to improve quantum computing performance.