• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.14-22
• /
• 2007

Wireless sensor networks are composed of numerous sensor nodes and exchange or recharging of the battery is impossible after deployment. Thus, sonsor nodes must be very energy-efficient. As neighboring sensor nodes generally have the data of similar information, duplicate transmission of similar information is usual. To prevent energy wastes by duplicate transmissions, it is advantageous to organize sensors into clusters. The performance of clustering scheme is influenced by the cluster-head election method and the size or the number of clusters. Thus, we should optimize these factors to maximize the energy efficiency of the clustering scheme. In this paper, we propose a new energy consumption model for LEACH which is a well-known clustering protocol and determine the optimal number of clusters based on our model. Our model has accuracy over 80% compared with the simulation and is considerably superior to the existing model of LEACH.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.10
• /
• pp.821-829
• /
• 2020

Health management system of airborne software repairs runtime errors to provide safety and to reduce cost of maintenance. It is critical to on-the-fly repair order violation errors, because it is difficult to identify them at the development phase. Previous work, called Repairing Atomicity Violations (Repairing-AV) diagnoses order violations for each access event by comparing execution order of accesses. As a result, Repairing-AV has time overhead that is proportional to the number of access events to shared variable. This paper presents a tool called On-the-fly Repairing System (ORS) that can repair order violations of object methods containing access events. The ORS diagnoses order violations by using correct order of object methods, and treats them by stalling its thread where the error is about to occur. Experimentation with five synthetic programs shows that ORS is more efficient than Repairing-AV when the number of access events is greater than sixty.

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

Compressed filesystem is frequently used in the embedded system to increase cost efficiency. One of the drawbacks of compressed filesystem is low read performance. Moreover, read-ahead mechanism that improves the read throughput of storage device has negative effect on the read performance of compressed filesystem, increasing read latency. Main reason is that compressed filesystem has too big read-ahead miss penalty due to decompression overhead. To solve this problem, this paper proposes new read technique considering kernel read-ahead mechanism for compressed filesystem. Proposed technique improves read throughput of device by bulk read from device and reduces decompression overhead of compressed filesystem by selective decompression. We implement proposed technique by modifying CramFS and evaluate our implementation in the Linux kernel 2.6.21. Performance evaluation results show that proposed technique reduces the average major page fault handling latency by 28%.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.14 no.1
• /
• pp.129-137
• /
• 2006

This paper studies the effects of the swirl for the variation of intake port configuration that is key parameters in the flow field of direct injection diesel engines. In-cylinder flow characteristics is known to have significant effects on air-fuel mixing, combustion, and emissions. To investigate the effects of the swirl flow, various rpm(250, 500, 750) and two different intake port were used. And to evaluate the swirl motion in the flow field visualization engine, steady state flow test was conducted. Helical port intake port and SCV(Swirl Control Valve) were selected as the design parameters to increase the swirl flow and parametric study was performed. In the case of non-SCV, intake flow rate and non-dimensional swirl ratio were higher than those of SCV for the swirl head type. So, we could strengthen the swirl in the flow field with the swirl head type and don't using SCV. From the results of steady state flow test, non-swirl head type has the most good advantage for intake flow rate, and also the flow rate could be increased by using the SCV slightly. The effects of the type of engine head on intake air flow capability are dominant with respect to the existence of the SCV. We could measure the qualitative grade of swirl by capturing the scattering signal of microballoon from ICCD camera in the visualization diesel engine.

• Journal of the Korean Magnetics Society
• /
• v.3 no.4
• /
• pp.293-297
• /
• 1993

Exchange coupled $NiFe/TbCo/Sio_{2}$ thin films for magnetoresistive heads were sputter deposited using RF diode sputtering method, and their magnetic characteristics were measured. TbCo films were deposited using a composite target, which is composed of Tb chips epoxied on a Co target. NiFe($400\AA$)/TbCo($1500\AA$)/$SiO_{2}$($500\AA$) films were deposited using a TbCo target having 30 % of Tb area ratio, which showed 25 Oe of the exchange field without substrate bias and 12 Oe with -55 V of substrate bias. The effective in-plane coercivities of the three layer films fabricated with less than -55 V of substrate bias were approximately proportional to the perpendicular coercivities of the TbCo layer only. The films fabricated with a Theo target of 28 % area ratio showed the same trend. However, the exchange field decreased to 4 Oe without the substrate bias and 7 Oe with -55 V of substrate bias. In the films fabricated with 1000 W of power and the target of 36 % area ratio exhibited 100 Oe of exchange field and 3 Oe of coercivity. As the thickness of NiFe layer increased, the exchange field decreased.

• Journal of the Korea Society for Simulation
• /
• v.24 no.4
• /
• pp.11-21
• /
• 2015

If the cloud computing environment is not sufficiently provide the required resources due to the number of virtual server to process the request, may cause a problem that the load applied to the specific server. Migration administrator receive the resources of each physical server for improving the efficiency of the virtual server that exists in the physical servers, and determines the migration destination based on the simulation results. But, there is more overhead predicting the future resource consumption of all the physical server to decide the migration destination through the simulation process in large and complex cloud computing environments. To solve this problem, we propose an improved prediction method with the simulation-based approach. The proposed method is a fuzzy-logic based priority model for VM migration. We design a proposed model with the DEVS formalism. And we also measure and compare a performance and migration count with existing simulation-based migration method. FPLM shows high utilization.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.29-40
• /
• 2005

In this paper, we propose a Cluster-based Multicast Routing (CMR) suitable for mobile ad-hoc networks. The main features that our proposed method introduces are the following: a) mobility-based clustering and group based hierarchical structure in order to effectively support stability and scalability, b) group based mesh structure and forwarding tree concepts in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide low route acquisition delay and low overhead. The performance evaluation of the proposed protocol is achieved via modeling and simulation. The corresponding results demonstrate the Proposed multicast protocol's efficiency in terms of packet delivery ratio, scalability, control overhead, end-to-end delay, as a function of mobility, multicast group size, and number of senders.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.337-349
• /
• 2013

In this paper, we propose a new mobility management scheme, called i-FP(intelligent Fast PMIPv6). Our proposed i-FP scheme is addressed for solving the existing local mobility management problems from legacy frameworks. To move MN(Mobile Node) to other networks in one domain, i-FP employs three network entities which are extended from PMIPv6(Proxy Mobile IPv6), LMA(Local Mobility Anchor), MAG(Mobile Access Gateway) and MN. In i-FP, the three network entities can reduce the handover delay time of MNs. Also, i-FP uses an IP header swapping mechanism to avoid the traffic overhead and improve the throughput of network. To evaluate the performance of i-FP, we analyze our i-FP, HMIPv6(Hierarchical Mobile IPv6) and PMIPv6 which are legacy protocols of local mobility management in terms of various parameters. Finally, our i-FP scheme shows good performance(reduction of routing hops 10.2%, signaling costs 58.5% and handover delay 16.3%) than other network schemes for the total cost.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.649-655
• /
• 2003

Network-based computing such as cluster computing requires a reliable high-speed transport protocol. TCP is a representative reliable transport protocol on the Internet, which implements many mechanisms, such as flow control, congestion control, and retransmission, for reliable packet delivery. This paper, however, finds out that Myrinet does not incur any packet losses caused by network congestion. In addition, we ascertain that Myrinet supports reliable and ordered packet delivery. Consequently, most of reliable routines implemented in TCP produce unnecessarily additional overheads on Myrinet. In this paper, we show that we can attain the reliability only by flow control on Myrinet and propose a new reliable protocol based on UDP named RUM (Reliable UDP on Myrinet) that performs a flow control. As a result, RUM achieves a higher throughput by 45% than TCP and shows a similar one-way latency to UDP.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.1
• /
• pp.38-43
• /
• 2011

Cluster-based routing is high energy consumption of cluster head nodes. A recent approach to resolving the problem is the dynamic cluster technique that periodically re-selects cluster head nodes to distribute energy consumption of the sensor nodes. However, the dynamic clustering technique has a problem that repetitive construction of clustering consumes the more energies. This paper proposes a solution to the problems described above from the energy efficiency perspective. The round-robin cluster header(RRCH) technique, which fixes the initially structured cluster and sequentially selects cluster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. A simulation result were compared with the performances of two of the most widely used conventional techniques, the LEACH(Low Energy Adaptive Clustering Hierarchy) and HEED(Hybrid, Energy Efficient, Distributed Clustering) algorithms, based on energy consumption, remaining energy for each node and uniform distribution. The evaluation confirmed that in terms of energy consumption, the technique proposed in this paper was 26.5% and 20% more efficient than LEACH and HEED, respectively.