• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.10
• /
• pp.967-982
• /
• 2011

This paper presents a FTNCS (Fault-Tolerant Networked Control System) that can tolerate control surface failure and packet delay/loss in an UAV (Unmanned Aerial Vehicle). The proposed method utilizes the benefits of self-diagnosis by smart actuators along with the control allocation technique. A smart actuator is an intelligent actuation system combined with microprocessors to perform self-diagnosis and bi-directional communications. In the event of failure, the smart actuator provides the system supervisor with a set of actuator condition data. The system supervisor then compensate for the effect of faulty actuators by re-allocating redundant control surfaces based on the provided actuator condition data. In addition to the compensation of faulty actuators, the proposed FTNCS also includes an efficient algorithm to deal with network induced delay/packet loss. The proposed algorithm is based on a Lagrange polynomial interpolation method without any mathematical model of the system. Computer simulations with an UAV show that the proposed FTNCS can achieve a fast and accurate tracking performance even in the presence of actuator faults and network induced delays.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.213-221
• /
• 2012

The architecture of an interconnection network is usually represented by a graph, and a graph G is bipancyclic if it contains a cycle for every even length from 4 to ${\mid}V(G){\mid}$. In this article, we analyze the conditional edge-fault-tolerant properties of an enhanced hypercube, which is an attractive variant of a hypercube that can be obtained by adding some complementary edges. For any n-dimensional enhanced hypercube with at most (2n-3) faulty edges in which each vertex is incident with at least two fault-free edges, we showed that there exists a fault-free cycle for every even length from 4 to $2^n$ when n($n{\geq}3$) and k have the same parity. We also show that a fault-free cycle for every odd length exists from n-k+2 to $2^n-1$ when n($n{\geq}2$) and k have the different parity.

• 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.

• Proceedings of the KSR Conference
• /
• 2011.05a
• /
• pp.1414-1419
• /
• 2011

In this paper we study the modeling to quantitatively assess the failure rate of USN system designed for fault-tolerant architecture, aiming at applying the world's best domestic USN technology to safety-critical railways. In order to apply the USN system to the safety-critical field like a train control sector that the failures of controllers may cause severe railway accidents such as train collision and derailment, the quantitative reliability and safety evaluation recommended in IEC 62278 must be preceded. We also develop the evaluation model for overall system failure rate for the distributed network structure, which is the characteristics of USN system. Especially, we allocate reliability targets to component units, and present an availability evaluation plan through the plan on the quantitative achievement of failure rate for sensor nodes, gateways, radio-communication network and servers, along with the failure rate model of the overall system considering network operational features.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.51-57
• /
• 2009

Ubiquitous sensor network is the communication environment where sensor nodes move freely and construct network to get the services from the system. So, it does not need fixed infrastructure and can easily be placed in unaccessible regions like war or calamity area. Wireless sensor network protocol has self-organizing capability, need to adapt topology change flexibly and also has technique that sensor nodes work cooperatively, because network disconnection is frequently occurred due to the active mobility of sensor nodes. In this paper, we design a cluster based fault-tolerant routing protocol for the efficient topology construction and to guarantee stable data transmission in USN. The performance of the proposed protocol is evaluated by an analytic model.

• The Journal of the Korea Contents Association
• /
• v.6 no.10
• /
• pp.126-133
• /
• 2006

Application software streaming is a virtualization technology that enables users to use applications without installation on her/his computer. With application streaming service, a client immediately starts and uses the application as if it were installed. The application can be executed while executable codes for the application may still be streamed. Since the software streaming is based on networks, its service is affected by network failures. Network failures may cause the streamed application to stop, and to make it worse, also the system may crash because executable codes for the application can't be streamed from the streaming server. Using the Pareto principle (80 vs. 20 rule), users can be served continuously with the minimum functions that are frequently used, pre-fetched and cached if we provide a more intelligent and fault-tolerant streaming technique. This paper proposes the concept and technique named Evergreen. Using the Evergreen technique, users can continue using the streamed application while a network failure occurs, although user can access only the streamed code. We also discuss the implementation of Evergreen technique in details.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1631-1642
• /
• 1999

In this paper, we propose a new fault tolerant ATM Switch and a new adaptive self-routing scheme used to make the switch to be fault tolerant. It can provide more multiple paths than the related previous switches between an input/output pair of a switch by adding extra links between switching elements in the same stage and extending the self-routing scheme of the Banyan network. Our routing scheme is as simple as that of the banyan network, which is based on the topological relationships among the switching elements (SE’s) that render a packet to the same destination with the regular self-routing. These topological properties of the Banyan network are discovered in this paper. We present an algebraic proof to show the correctness of this scheme, and an analytic reliability analysis to provide quantitative comparisons with other switches, which shows that the new switch is more cost effective than the Banyan network and other augmented MIN’s in terms of the reliability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.

• Journal of IKEEE
• /
• v.28 no.3
• /
• pp.458-464
• /
• 2024

This study proposes a fault-tolerant caching system to address the issue of caching content imbalance caused by the dynamic departure and participation of cache servers in a heterogeneous cache server network, and validates it in both real and virtual environments. With the increase of large-scale media content requiring various types and resolutions, the necessity of cache servers as key components to reduce response time to user requests and alleviate network load has been growing. In particular, research on heterogeneous cache server networks utilizing edge computing and low-power devices has been actively conducted recently. However, in such environments, the irregular departure and participation of cache servers can occur frequently, leading to content imbalance among the cache servers deployed in the network, which can degrade the performance of the cache server network. The fault-tolerant caching algorithm proposed in this study ensures stable service quality by maintaining balance among media contents even when cache servers depart. Experimental results confirmed that the proposed algorithm effectively maintains content distribution despite the departure of cache servers. Additionally, we built a network composed of seven heterogeneous cache servers to verify the practicality of the proposed caching system and demonstrated its performance and scalability through a large-scale cache server network in a virtual environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1B
• /
• pp.74-85
• /
• 2009

We propose an Agent-based Fault Tolerant Object Group model based on the agent technology and FTOG model with replication mechanism for effective object management and fault recovery. We define the five kind of agents - internal processing agent, registration agent, state handling agent, user interface agent, and service agent - that extend the functions of the FTOG model. The roles of the agents in the proposed model are to reduce the remote interactions between distributed objects and provide more effective service execution. To verify the effectiveness of the proposed model, we implemented the Intelligent Home Network Simulator (IHNS) which virtually provides general home networking services. Through the simulations, it is validated that the proposed model decreases the interactions of the object components and supports the effective fault recovery, while providing more stable and reliable services.