• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.256-261
• /
• 2007

2-Dimensional Ring-banyan network is a high-performance fault-tolerant switching network using a deflection self-routing. The throughput of the switching network is better than that of Cyclic Banyan network under non-uniform traffic. In this paper, we present an analytic reliability analysis of the fault-tolerant switching network. We present the Mean-Time-to-Failure that is calculated by using probabilistic model. This model also takes into account a hardware complexity. In case of $16\;{\times}\;16$ size, the presented switching network is 1.275 times more reliable than Hui's switching network. And it is 1.510 times more reliable than Hui's network in case of $64\;{\times}\;64$ size.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.244-250
• /
• 2011

Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.117-126
• /
• 1989

In this paper, a new placement algorithm for gate array lay out design is proposed. The proposed algorithm can treat the variable-sized macrocells and by considering the I/Q pad locations, the routing between I/Q pads and the internal region of a chip can be automated effectively. The algorithm is composed of 3 parts. which are initial partitioning, initial placement and placement improvement. In the initial placement phase, a given circuit is partitioned into 5 sub-circuits, by clustering method with considers connectivities of cells not only with I/Q pads but also with related partitioned groups is used repeatedly to assign a unique position to each cell. In the placement improvement phase, the concept of probabilistic wiring density is introduced, and cell moving algorithm is proposed to make the density in a chip even.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3671-3689
• /
• 2019

Software defined networking brings unique security risks such as control plane saturation attack while enhancing the performance of wireless sensor networks. The attack is a new type of distributed denial of service (DDoS) attack, which is easy to launch. However, it is difficult to detect and hard to defend. In response to this, the attack threat model is discussed firstly, and then a DDoS attack prevention extension, called FuzzyGuard, is proposed. In FuzzyGuard, a control network with both the protection of data flow and the convergence of attack flow is constructed in the data plane by using the idea of independent routing control flow. Then, the attack detection is implemented by fuzzy inference method to output the current security state of the network. Different probabilistic suppression modes are adopted subsequently to deal with the attack flow to cost-effectively reduce the impact of the attack on the network. The prototype is implemented on SDN-WISE and the simulation experiment is carried out. The evaluation results show that FuzzyGuard could effectively protect the normal forwarding of data flow in the attacked state and has a good defensive effect on the control plane saturation attack with lower resource requirements.

• Journal of Korea Water Resources Association
• /
• v.39 no.3 s.164
• /
• pp.261-274
• /
• 2006

This study performs a daily long-term runoff analysis for 30 years to forecast medium- and long-term probabilistic reservoir inflows on the Soyang River basin. Snowmelt is computed by Anderson's temperature index snowmelt model and potenetial evaporation is estimated by Penman-combination method to produce input data for a rainfall-runoff model. A semi-distributed TOPMODEL which is composed of hydrologic rainfall-runoff process on the headwater-catchment scale based on the original TOPMODEL and a hydraulic flow routing model to route the catchment outflows using by kinematic wave scheme is used in this study It can be observed that the time variations of the computed snowmelt and potential evaporation are well agreed with indirect observed data such as maximum snow depth and small pan evaporation. Model parameters are calibrated with low-flow(1979), medium-flow(1999), and high-flow(1990) rainfall-runoff events. In the model evaluation, relative volumetric error and correlation coefficient between observed and computed flows are computed to 5.64% and 0.91, respectively. Also, the relative volumetric errors decrease to 17% and 4% during March and April with or without the snowmelt model. It is concluded that the semi-distributed TOPMODEL has well performance and the snowmelt effects for the long-term runoff computation are important on the study area.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.587-595
• /
• 2015

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1931-1938
• /
• 2012

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

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

Wireless sensor networks is a core technology of ubiquitous computing which enables the network to aware the different kind of context by integrating exiting wired/wireless infranet with various sensor devices and connecting collected environmental data with applications. However it needs an energy-efficient approach in network layer to maintain the dynamic ad hoc network and to maximize the network lifetime by using energy constrained node. Cluster-based data aggregation and routing are energy-efficient solution judging from architecture of sensor networks and characteristics of data. In this paper. we propose a new distributed clustering algorithm in using distance from the sink. This algorithm shows that it can balance energy dissipation among nodes while minimizing the overhead. We verify that our clustering is more en-ergy-efficient and thus prolongs the network lifetime in comparing our proposed clustering to existing probabilistic clustering for sensor network via simulation.

• Journal of Korea Water Resources Association
• /
• v.47 no.10
• /
• pp.853-865
• /
• 2014

Hydrologic dam risk analysis depends on complex hydrologic analyses in that probabilistic relationship need to be established to quantify various uncertainties associated modeling process and inputs. However, the systematic approaches to uncertainty analysis for hydrologic risk analysis have not been addressed yet. In this paper, two major innovations are introduced to address this situation. The first is the use of a Hierarchical Bayesian model based regional frequency analysis to better convey uncertainties associated with the parameters of probability density function to the dam risk analysis. The second is the use of Bayesian model coupled HEC-1 rainfall-runoff model to estimate posterior distributions of the model parameters. A reservoir routing analysis with the existing operation rule was performed to convert the inflow scenarios into water surface level scenarios. Performance functions for dam risk model was finally employed to estimate hydrologic dam risk analysis. An application to the Dam in South Korea illustrates how the proposed approach can lead to potentially reliable estimates of dam safety, and an assessment of their sensitivity to the initial water surface level.