• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.469-472
• /
• 2008

Hierarchical routing in Wireless Sensor Network lowers the amount of a memory used and energy consumption so that the network lifetime longer. But, When Node Failure is occurred, Hierarchical routing do not look for another route. This is the problem of Hierarchical routing. To solve the problem, we would study other hierarchical routings. There are typically hierarchical routing protocols which can be used in WSN, such as the hierarchical routing of Zigbee and HiLow protocol which is submitted as draft to IETF 6LoWPAN WG. Also, there is SCRO algorithm which be able to assign short-cut routing path. This paper explains how to solve the Node Failure in each Zigbee hierarchical routing and HiLow protocol. And we suggest how to solve the Node Failure in SCRO protocol. SCRO protocol is able to assign new routing path rapidly when Node Failure is occurred. Because the strong of SCRO protocol is to assign Short-cut routing path.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5058-5077
• /
• 2019

Traditional regenerating codes are designed to tolerate node failures with optimal bandwidth overhead. However, there are many types of partial failures inside the node, such as latent sector failures. Recently, proposed regenerating codes can also repair intra-node failures with node-level redundancy but incur significant bandwidth and I/O overhead. In this paper, we construct a new scheme of regenerating codes, called IR-RBT codes, which employs intra-node redundancy to tolerate intra-node failures and serve as the help data for other nodes during the repair operation. We propose 2 algorithms for assigning the intra-node redundancy and RBT-Helpers according to the failure probability of each node, which can flexibly adjust the helping relationship between nodes to address changes in the actual situation. We demonstrate that the IR-RBT codes improve the bandwidth and I/O efficiency during intra-node failure repair over traditional regenerating codes but sacrifice the storage efficiency.

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

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.8
• /
• pp.1-10
• /
• 1995

We have analyzed the reliability of failure models in circuit-switched networks. These models are grid topology circuit-switched networks, and each node transmits a packet to a destination node using a Flooding routing method. We have assumed that the failure of each link and node is independent. We have considered two method to analyze reliability in these models : The Karnaugh Map method and joint probability method. In this two method, we have analyzed the reliability in a small grid topology circuit switched network by a joint probability method, and comared analytic results with simulated ones. For a large grid enormous. So, we have evaluated the reliability of the network by computer simulation techniques. As results, we have found that the analytic results are very close to simulated ones in a small grid topology circuit switched network. And, we have found that network reliability decreases exponentially, according to increment of link or node failure, and network reliability is almost linearly decreased according to increment of the number of links, by which call has passed. Finally, we have found an interesting result that nodes in a center of the network are superior to the other nodes from the reliability point of view.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.04a
• /
• pp.195-202
• /
• 1999

In this Paper, a so-called volume-control method for nonlinear failure analysis of reinforced concrete cylindrical structures is proposed. The pressure node which defines uniform change of pressure on finite element is added into layered shell element utilizing in-plane constitutive models of reinforced concrete and layered formulation. With the pressure node formulation, one can control the change in volume enclosed by the cylindrical structures and determine the required change in pressure. An algorith of volume-control method is employed and failure analyses for RC cylindrical structures are carried out using proposed method.

• Radiation Oncology Journal
• /
• v.37 no.1
• /
• pp.51-59
• /
• 2019

Purpose: We evaluated failure pattern and treatment outcomes of observational approach on regional lymph node (LN) in cutaneous melanoma of extremities and sought to find clinico-pathologic factors related to LN metastases. Material and Methods: We retrospectively reviewed 73 patients with cutaneous melanoma of extremities between 2005 and 2016. If preoperative 18-F-fluorodeoxyglucose (FDG)-positron emission tomography/computed tomography (PET/CT) findings were non-specific for regional LNs, surgical resection of primary tumors with adequate margins was performed without sentinel lymph node biopsy (SLNB) and/or complete lymph node dissection (CLND), irrespective of tumor thickness or size. In patients with suspicious or positive findings on PET/CT or CT, SLNB followed by CLND or CLND was performed at the discretion of the surgeon. We defined LN dissection (LND) as SLNB and/or CLND. Results: With a median follow-up of 38 months (range, 6 to 138 months), the dominant pattern of failure was regional failure (17 of total 23 events, 74%) in the observation group (n = 56). Pathologic LN metastases were significant factor for poor regional failure-free survival (hazard ration [HR] = 3.21; 95% confidence interval [CI], 1.03-10.33; p = 0.044) and overall survival (HR = 3.62; 95% CI, 1.02-12.94; p = 0.047) in multivariate analysis. In subgroup analysis for cN0 patients according to the preoperative PET/CT findings, LND group showed the better trend of LRFFS (log rank test, p = 0.192) and RFFS (p = 0.310), although which is not statistically significant. Conclusion: Observational approach on regional LNs on the basis of the PET/CT in patients with cutaneous melanoma of extremities showed the dominant regional failure pattern compared to upfront LND approach. To reveal regional lymph node status, SLND for cN0 patients may of importance in managing cutaneous melanoma patients.

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.413-434
• /
• 2010

Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.1 no.1
• /
• pp.25-36
• /
• 1996

We have analyzed the reliability of failure models In grid topology circuit switched networks. These models are grid topology circuit_ switched networks. and each node transmits packets to object node using flooding search routing method. We hypothesized that the failure of each link Is Independent. We have analyzed for the performance estimation of failure models It using joint probability method to the reliability of a small grid topology circuit switched network. and compared analytic output with simulated output. Also. We have evaluated the reliability of networks using call blocking Probability occurred in circuit switched networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2609-2617
• /
• 2009

This paper describes the design overview of shared file system $SANique^{TM}$ and proposes the method for detection of failure node and recovery management algorithm. We also illustrate the characteristics and system architecture of shared file system based on SAN. In order to provide uninterrupted service, the detection and recovery methods are proposed under the all possible system failures and natural disasters. The various kinds of system failures and disasters are characterized and then the detection and recovery method are proposed in each disconnected computing node group.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.13-20
• /
• 2008

We evaluate the sink capacity of wireless code division multiple access (CDMA) sensor networks with layered architecture. We introduce a model of interference at a sink considering two kinds of interference: multiple access interference (MAI) and node interference (NI). We also investigate the activity of sensor nodes around the sink in relation to gathering data under a layered architecture. Based on the interference model and the activity of sensor nodes around the sink, we derive the failure probability of the transmission from a source node located one hop away from the sink using Gaussian approximation. Under the requirement of 1% failure probability of transmission, we determine the sink capacity, which is defined as the maximum number of concurrent sensor nodes located one hop away from the sink. We demonstrate that as the node activity of the MAI decreases, the variation of the sink capacity due to the node activity of the NI becomes more significant. The analysis results are verified through computer simulations.