• Nuclear Engineering and Technology
• /
• v.36 no.6
• /
• pp.528-539
• /
• 2004

It is essential in commercial reactors that the safety limits imposed on the fuel pellets and fuel clad barriers, such as the linear power density (LPD) and the departure from nucleate boiling ratio (DNBR), are not violated during reactor operations. In order to accurately monitor the safety limits of current reactor states, a detailed three-dimensional (3D) core power distribution should be estimated from the in-core detector signals. In this paper, we propose a calculation methodology for detailed 3D core power distribution, using in-core detector signals and core monitoring constants such as the 3D Coupling Coefficients (3DCC), node power fraction, and pin-to-node factors. Also, the calculation method for several core safety parameters is introduced. The core monitoring constants for the real core state are promptly provided by the core design code and on-line MASTER (Multi-purpose Analyzer for Static and Transient Effects of Reactors), coupled with the core monitoring program. through the plant computer, core state variables, which include reactor thermal power, control rod bank position, boron concentration, inlet moderator temperature, and flow rate, are supplied as input data for MASTER. MASTER performs the core calculation based on the neutron balance equation and generates several core monitoring constants corresponding to the real core state in addition to the expected core power distribution. The accuracy of the developed method is verified through a comparison with the current CECOR method. Because in all the verification calculation cases the proposed method shows a more conservative value than the best estimated value and a less conservative one than the current CECOR and COLSS methods, it is also confirmed that this method secures a greater operating margin through the simulation of the YGN-3 Cycle-1 core from the viewpoint of the power peaking factor for the LPD and the pseudo hot pin axial power distribution for the DNBR calculation.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.817-819
• /
• 1996

This paper presents an algorithm for calculation of harmonic distribution in distribution systems. In distribution systems, most state variables are not given explicitly. To calculate the harmonic distribution in distribution systems, state estimation is necessary. In this paper, power usage and harmonic current injection is estimated for each node from practically available data. The estimating procedure is illustrated by examples.

• The KSFM Journal of Fluid Machinery
• /
• v.15 no.3
• /
• pp.12-18
• /
• 2012

The Lattice Boltzmann Method has developed for solving the Boltzmann equation in Cartesian domains containing immersed boundaries of arbitrary geometrical complexity moving with prescribed kinematics. When a immersed boundaries are sweeping the fixed fluid node, refilling the node information in a vicinity of fluid nodes is one of the important issues in Lattice Boltzmann Method. In this study, we propose a simple refill algorithm for the particle distribution function based on a proper velocity, density and strain rate to enhance accuracy and stability of the method. The refill scheme based on a asymptotic analysis of LBGK model has improved accuracy than interpolation schemes. The proposed scheme in this study is validated by the simulations of an impulsively started rotating circular cylinder to investigate adaptability for fluid-structure interaction (FSI) problem. This refill scheme has improved stability and accuracy especially at high Reynolds number region.

• International Journal of Contents
• /
• v.7 no.1
• /
• pp.8-13
• /
• 2011

For energy-efficiency in Wireless Sensor Networks (WSNs), when a sensor node detects events, the sensing period for collecting the detailed information is likely to be short. The lifetime of WSNs decreases because communication modules are used excessively on a specific sensor node. To solve this problem, the TARP decentralized network packets to neighbor nodes. It considered the average data transmission rate as well as the data distribution. However, since the existing scheme did not consider the energy consumption of a node in WSNs, its network lifetime is reduced. In this paper, we propose an energy awareness congestion control scheme based on genetic algorithms in WSNs. The proposed scheme considers the remaining amount of energy and the transmission rate on a single node in fitness evaluation. Since the proposed scheme performs an efficient congestion control, it extends the network lifetime. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through performance evaluation. It is shown that the proposed scheme enhances the data fairness and improves the network lifetime by about 27% on average over the existing scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2398-2415
• /
• 2017

Content-Centric Networking (CCN) is a new Internet architecture with routing and caching centered on contents. Through its receiver-driven and connectionless communication model, CCN natively supports the seamless mobility of nodes and scalable content acquisition. In-network caching is one of the core technologies in CCN, and the research of efficient caching scheme becomes increasingly attractive. To address the problem of unbalanced cache load distribution in some existing caching strategies, this paper presents a neighbor cooperation based in-network caching scheme. In this scheme, the node with the highest betweenness centrality in the content delivery path is selected as the central caching node and the area of its ego network is selected as the caching area. When the caching node has no sufficient resource, part of its cached contents will be picked out and transferred to the appropriate neighbor by comprehensively considering the factors, such as available node cache, cache replacement rate and link stability between nodes. Simulation results show that our scheme can effectively enhance the utilization of cache resources and improve cache hit rate and average access cost.

• Journal of IKEEE
• /
• v.14 no.4
• /
• pp.312-316
• /
• 2010

We describe in this paper how to facilitate ad hoc routing with a particle filter in a hostile radio environment for multi-hop wireless ad hoc networks that connect multi-robots. The proposed scheme increases a connection's throughput by exploiting alternative links without going through the procedure of route discovery when link failure happens among multi-robots' networking. The scheme is implemented by using a particle filter to find strongly connected nodes. The filter estimates the probability distribution function in a sample-based manner with N particles. The particles are associated with a weight which represents the probability of the corresponding node to be the node with the best link. At every step of the estimation, the weights of particles are calculated and particles are resampled based on the weights. Since a node with the strongest link status possesses the largest number of particles, we take this node to forward the packets.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.115-124
• /
• 2005

We propose a new binding update(BU) protocol between mobile node(CN) and correspondent node(CN) for the purpose of preventing redirect attacks and DoS attacks observed from the existing BU protocols and enhancing the efficiency of the BU protocol. Home agent plays a role of both authentication server validating BU message and session key distribution center for MN and CN. Also propose the stateless Diffie-Hellman key agreement based on cryptographically generated address (CGA). Suity of our proposed Protocol is analyzed and compared with other protocols. The proposed protocol is more efficient than previous schemes in terms of the number of message flows and computation overhead and is secure against both redirect and DoS attacks.

• IE interfaces
• /
• v.16 no.4
• /
• pp.441-449
• /
• 2003

In this paper we propose a distribution planning method aiming the use in the real-life situations. The assumed form of the distribution network is arborescence. At every node in the distribution network, orders are placed periodically. At each renewal of planning horizon, demand informations of periods in the horizon are updated. The objective of the problem is to minimize the total cost, which is the sum of holding and backorder costs of all sites during planning horizon. For such a situation, this study addressed an effective distribution plan when demands for demand-sites are provided for a given planning horizon.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.1
• /
• pp.12-21
• /
• 2012

IEEE 802.11 MAC protocol standard, DCF(CSMA/CA), is originally designed to ensure the fair channel access between mobile nodes sharing the local wireless channel. It has been, however, revealed that some misbehavior nodes transmit more data than other nodes through artificial means in hot spot area spreaded rapidly. The misbehavior nodes may modify the internal process of their MAC protocol or interrupt the MAC procedure of normal nodes to achieve more data transmission. This problem has been referred to as a selfish node problem and almost literatures has proposed methods of analyzing the MAC procedures of all mobile nodes to detect the selfish nodes. However, these kinds of protocol analysis methods is not effective at detecting all kinds of selfish nodes enough. This paper address this problem of detecting selfish node using Tsallis-Entropy which is a kind of statistical method. Tsallis-Entropy is a criteria which can show how much is the density or deviation of a probability distribution. The proposed algorithm which operates at a AP node of wireless LAN extracts the probability distribution of data interval time for each node, then compares the one with a threshold value to detect the selfish nodes. To evaluate the performance of proposed algorithm, simulation experiments are performed in various wireless LAN environments (congestion level, how selfish node behaviors, threshold level) using ns2. The simulation results show that the proposed algorithm achieves higher successful detection rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1128-1137
• /
• 2012

In this paper, we propose an improved MPR selection method considering mobility and density of nodes for ad-hoc networks. In Optimized Link State Routing(OLSR), a node selects 1-hop Multi-Point Relay(MPR) nodes to cover all 2-hop neighbor nodes. In a high population area, many nodes are likely to be selected as MPR nodes by their neighbors. This leads to increase in contention among MPR nodes and may decrease overall performance of the network. In addition, when an MPR node leaves the communication range of its MPR selector node, it can no longer perform as the MPR node and the performance of the network may also decrease. In this paper, we propose an MPR selection method which measures the mobility and density of nodes by exchanging the hello messages and gives the priorities to the nodes for MPR selection. Performance evaluation results using OPNET show that the proposed method is superior to OLSR or the MPR candidate method in terms of connectivity and throughput.