• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.668-672
• /
• 2010

In wireless sensor networks, a fault-tolerant scheme that detects the failure of sensor nodes and improves the reliability of collected information must be considered. Resource-constraint sensor nodes expose vulnerability and cannot use existing checkpointing schemes that do not consider a feature of sensor networks. In this paper, we propose a fault-tolerant scheme for clustering routing protocols that support the recovery of a head node.

• Advances in Energy Research
• /
• v.3 no.3
• /
• pp.167-179
• /
• 2015

This paper presents a techno-economic analysis of a partial repowering scheme for an existing 210 MW coal fired power plant by integrating a gas turbine and by employing waste heat recovery. In this repowering scheme, one of the four operating coal mills is taken out and a new natural gas fired gas turbine (GT) block is considered to be integrated, whose exhaust is fed to the furnace of the existing boiler. Feedwater heating is proposed through the utilization of waste heat of the boiler exhaust gas. From the thermodynamic analysis it is seen that the proposed repowering scheme helps to increase the plant capacity by about 28% and the overall efficiency by 27%. It also results in 21% reduction in the plant heat rate and 29% reduction in the specific $CO_2$ emissions. The economic analysis reveals that the partial repowering scheme is cost effective resulting in a reduction of the unit cost of electricity (UCOE) by 8.4%. The economic analysis further shows that the UCOE of the repowered plant is lower than that of a new green-field power plant of similar capacity.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.401-408
• /
• 2005

We propose a new MPLS restoration scheme that uses network resources more efficiently and minimizes the backup path cost effectively. Contrary to other restoration strategies, the proposed restoration scheme starts the recovery action at the selected node of a working LSP. At LSP setup, the working and backup path cost is evaluated and the starting node of restoration is designated. By doing so, the restoration speed could be further increased and resource utilization could be maximized. We simulated the proposed scheme and compared with other restoration and protection schemes. The result shows that our scheme can provide fast restoration with acceptable delay and loss characteristics.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.1
• /
• pp.56-62
• /
• 2011

A Satellite transponder is mounted on the Satellite and performs radio communications with the ground station. A Digital transponder compared to The analog transponder is made easy and accurate performance prediction. Also Modulation Scheme, Data Rate, Loop Bandwidth, Modulation Index and etc. can be changed on orbit, by implementing FPGA can reduce the weight and volume. The core technology of digital transponder is Carrier Recovery loop. Dynamic Range, Frequency Tracking Range, Frequency Tracking Rate and Coherent performance are determined by the performance of the Carrier Recovery loop. In this paper, we proposed the structure of Carrier Recovery loop for the Satellite digital transponder, then tested and verified the structure.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.303-315
• /
• 2007

This paper proposes a 3D structure recovery and registration method that uses four or more common points. For each frame of a given video, a partial structure is recovered using tracked points. The 3D coordinates, camera positions and camera directions are computed at once by our improved scaled orthographic factorization method. The partially recovered point sets are parts of a whole model. A registration of point sets makes the complete shape. The recovered subsets are integrated by transforming each coordinate system of the local point subset into a common basis coordinate system. The process of shape recovery and integration is performed uniformly and linearly without any nonlinear iterative process and without loss of accuracy. The execution time for the integration is significantly reduced relative to the conventional ICP method. Due to the fast recovery and registration framework, our shape recovery scheme is applicable to various interactive video applications. The processing time per frame is under 0.01 seconds in most cases and the integration error is under 0.1mm on average.

• Journal of Digital Contents Society
• /
• v.12 no.1
• /
• pp.133-139
• /
• 2011

Structured P2P (peer-to-peer) networks have received much attention in research communities and the industry. The data stored in structured P2P networks can be located in a log-scale time without using central severs. The link-structure of structured P2P networks should be maintained for keeping log-scale search performance of it. When nodes join or leave structured P2P networks frequently, some links become unavailable and search performance is degraded by these links. To sustain search performance of structured P2P networks, periodic link recovery scheme is generally used. However, when the link recovery period is short or long compared with node join and leave rates, it is possible that sufficient number of links are not restored or excessive messages are used after the link-structure is restored. We propose the adaptive link recovery determination algorithm to maintain the link-structure of structured P2P networks when the rates of node joining and leaving are changed dynamically. The simulation results show that the proposed algorithm can maintain similar QoS under various node leaving rates.

• Convergence Security Journal
• /
• v.8 no.2
• /
• pp.57-62
• /
• 2008

In this paper, we suggest new fast recovery mechanism in RPR network, in case of node addition or removing by exterior attack. A RPR network recovery time is consist of two. Failure detecting time and reporting time are that. In this paper we propose fast recovery mechanism that can reduce each time. In a Legacy recovery mechanism, To report node's state, rpr node transmit protection messages. But interval of this protection messages increase exponentially. Thus A transmission failure of protection message cause delay of reporting of network state. Therefore we propose new node state reporting mechanism that put a node state in type b fairness message. And We also suggest fast failure detecting mechanism.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.409-421
• /
• 2004

A database sharing system (DSS) couples a number of computing nodes for high performance transaction processing, and each node in DSS shares database at the disk level. In case of node failures in DSS, database recovery algorithms are required to recover the database in a consistent state. A database recovery process in DSS takes rather longer time compared with single database systems, since it should include merging of discrete log records in several nodes and perform REDO tasks using the merged lo9 records. In this paper, we propose a two version caching (2VC) algorithm that improves the cache fusion algorithm introduced in Oracle 9i Real Application Cluster (ORAC). The 2VC algorithm can achieve faster database recovery by eliminating the use of merged log records in case of single node failure. Furthermore, it can improve the performance of normal transaction processing by reducing the amount of unnecessary disk force overhead that occurs in ORAC.

• Journal of Biosystems Engineering
• /
• v.12 no.1
• /
• pp.6-13
• /
• 1987

A mathematical model for the waste heat recovery system for an engine was developed. The model based on the experimental data reported before was validated and was used to predict the waste heat recovery and recoverable heat of the engine at various operating conditions of the engine and the system. The model was also used to determine flow rates of the circulating water in the system for a certain temperature increment of the water at various operating conditions of the engine to give basic data to design the system. Stability of the system performance was tested on subjects of vapor lock problem, thermal characteristics of the thermostatic valve, and temperature variation of the circulating water in the engine and fuel consumption of the engine during each mode of the system operation and its change into the other. The test showed that the system operation was stable enough. Temperature profile in the thermal energy storage (TES) was observed during storing thermal energy, and thermal stratification in the TES was well formed acceptable to be used in the system. Finally a scheme to automatize the system was suggested.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.800-811
• /
• 2018

This paper presents a regenerative braking control scheme for Switched Reluctance Machine (SRM) drive in Electric Vehicles (EVs). The main purpose is to maximize the recovered energy during battery charging by taking into account the nonlinear physical characteristics of the Switched Reluctance Machine. The proposed regenerative braking method employs the back-EMF in the generation process as a complicated position-dependent voltage source. The proposed maximum power recovery (MPR) operation of the regenerative braking is first based on the maximization of the extracted power from the machine and then the maximization of the power transferred to the battery. The maximum power extraction (MPE) from SRM is based on maximizing the energy conversion ratio by the calculation of the optimum PWM switching duty cycle, turn-on, and turn-off angles. By using the impedance matching theorem that allows the maximum power transfer (MPT) of the MPE, the proposed MPR is achieved. The parametric averaged value modeling of the machine phase currents in the chopping control mode is used for MPR realization. By following this model, a nonlinear equivalent input resistance is derived for the battery internal resistance matching. The effectiveness of the proposed regenerative braking method is demonstrated through simulation results and experimental implementation.