• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.10
• /
• pp.2395-2402
• /
• 2013

An active-RC channel selection filter (CSF) with the bandwidth of 40MHz and the improved linearity is proposed in this paper. The proposed CSF is the fifth butterworth filter which consists of a first order low pass filter, two second order low pass filters of a biquad architecture, and DC feedback circuit for cancellation of DC offset. To improve the linearity of the CSF, a body node of a MOSFET for a switch is connected to its source node. The bandwidth of the designed CSF is selected to be 10MHz, 20MHz and 40MHz and its voltage gain is controlled by 6 dB from 0 dB to 24 dB. The proposed CSF is designed by using 40nm 1-poly 8-metal CMOS process with a 1.2V. When the designed CSF operates at the bandwidth of 40 MHz and voltage gain of 0 dB, the simulation results of OIP3, in-band ripple, and IRN are 31.33dBm, 1.046dB, and 39.81nV/sqrt(Hz), respectively. The power consumption and layout area are $450{\times}210{\mu}m^2$ and 6.71mW.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4717-4737
• /
• 2017

Today, smart grids, smart homes, smart water networks, and intelligent transportation, are infrastructure systems that connect our world more than we ever thought possible and are associated with a single concept, the Internet of Things (IoT). The number of devices connected to the IoT and hence the number of traffic flow increases continuously, as well as the emergence of new applications. Although cutting-edge hardware technology can be employed to achieve a fast implementation to handle this huge data streams, there will always be a limit on size of traffic supported by a given architecture. However, recent cloud-based big data technologies fortunately offer an ideal environment to handle this issue. Moreover, the ever-increasing high volume of traffic created on demand presents great challenges for flow management. As a solution, flow aggregation decreases the number of flows needed to be processed by the network. The previous works in the literature prove that most of aggregation strategies designed for smart grids aim at optimizing system operation performance. They consider a common identifier to aggregate traffic on each device, having its independent static aggregation policy. In this paper, we propose a dynamic approach to aggregate flows based on traffic characteristics and device preferences. Our algorithm runs on a big data platform to provide an end-to-end network visibility of flows, which performs high-speed and high-volume computations to identify the clusters of similar flows and aggregate massive number of mice flows into a few meta-flows. Compared with existing solutions, our approach dynamically aggregates large number of such small flows into fewer flows, based on traffic characteristics and access node preferences. Using this approach, we alleviate the problem of processing a large amount of micro flows, and also significantly improve the accuracy of meeting the access node QoS demands. We conducted experiments, using a dataset of up to 100,000 flows, and studied the performance of our algorithm analytically. The experimental results are presented to show the promising effectiveness and scalability of our proposed approach.

• Journal of Internet Computing and Services
• /
• v.18 no.3
• /
• pp.29-36
• /
• 2017

In these days, 3D dynamic simulation is closely related to many industries. In the past, physically-based 3D simulation was used mainly in the car crash or construction related fields, but it also plays an important role in movies or games today. Many mathematical computations are needed to represent the 3D object realistically, but it is difficult to process a large amount of calculations for simulation of application based on CPU in real-time. Recently, with the advanced graphic hardware and improved architecture, GPU can be utilized for the general purposes of computation function as well as graphic computation. Many approaches using GPU have been applied for various research fields. In this paper, we analyze the performance variation of two cloth simulation algorithms based on GPU according to the change of execution properties of GPU shaders in oder to optimize the performance of GPU-based cloth simulation. Cloth simulation is implemented by the spring centric algorithm and node centric algorithm with GPU parallel computing using compute shader of GLSL 4.3. We compare the performance of between these algorithms according to the change of the size and dimension of work group. The experiment is repeated to 10 times during 5,000 frames for each test and experimental results are provided by averaging of FPS. The experimental result shows that the node centric algorithm is executed in higher speed than the spring centric algorithm.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.540-551
• /
• 2012

Recently, the W3C has developed the HTML5 standard which gives the basis for providing various web applications on the web environments. Because of the advent of the smart devices and the broadband wireless network, users can accesse the web applications on the smart devices at anytime and anywhere. In addition, the demand on the multiscreen services, which enables users to use the appropriate device to their situation, has increased, since users have various smart devices. In this paper, we propose the grouping mechanism of web objects on the HTML5 based web platform, the extraction mechanism of the web object information which is used to create the web object on other devices, and the web object creation mechanism based on the received web object information. In addition, we propose the web service migration architecture between devices on the open web platform and implement the grouping, extraction and creation mechanism of the web objects on the test web document and generic web document with Chrome extension. Finally, we implement the delivery mechanism of the web object information between devices using the node.js and the WebSocket technologies.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.591-602
• /
• 2003

Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.127-136
• /
• 2007

It is easy to install and maintain a mobile multi-hop wireless network due to its self-organizing characteristics. However it has security weakness of the authentication of mobile multi-hop relay stations. Specially, the mobile multi-hop relay network in the IEEE 802.16j has the additional security weakness caused by the requirement of backward compatibility for mobile stations of the conventional IEEE 802.16 system. In this paper, we propose a novel mutual authentication scheme applicable to IEEE 802.16j-based mobile multi-hop relay network architecture. The scheme is able to resolve the initial trust gain problem of a multi-hop node at its entry to the network, the problem of rogue mobile multi-hop node and the problem of hop-by-hop authentication between multi-hop nodes. Effectively, the scheme is a hybrid scheme of the distributed authentication method and the centralized authentication method which have been considered to be deployed in the wireless ad-hoc network and the wireless network connected to wired authentication servers, respectively. Also, we analyze the effectiveness of the proposed hybrid authentication method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.8
• /
• pp.8-16
• /
• 2016

This study presents the visualization of shape information based on Octree using 3D laser scanning. The process of visualization was established to construct the Octree structure from the 3D scan data. The scan data was converted to a 2D surface through the mesh technique and the surface was then converted to a 3D object through the Raster/Vector transformation. The 3D object was transmitted to the Octree Root Node and The shape information was constructed by the recursive partitioning of the Octree Root Node. The test-bed was selected as the steel bridge structure in Sungkyunkwan University. The shape information based on Octree was condensed into 89.3%. In addition, the Octree compressibility was confirmed to compare the shape information of the office building, a computer science campus in Germany and a New College in USA. The basis is created by the visualization of shape information for double-deck tunnel and it will be expected to improve the efficiency of structural health monitoring and maintenance.

• Journal of Internet of Things and Convergence
• /
• v.6 no.4
• /
• pp.89-92
• /
• 2020

According to the various IoT(Internet of Things) services, there have been lots of task offloading researches for IoT devices. Since there are service response delay and core network load issues in conventional cloud computing based offloadings, fog computing based offloading has been focused whose location is close to the IoT devices. However, even in the fog computing architecture, the load can be concentrated on the for computing node when the number of requests increase. To solve this problem, the opportunistic fog computing concept which offloads task to available computing resources such as cars and drones is introduced. In previous fog and opportunistic fog node researches, the offloading is performed immediately whenever the service request occurs. This means that the service requests can be offloaded to the opportunistic fog nodes only while they are available. However, if the service response delay requirement is satisfied, there is no need to offload the request immediately. In addition, the load can be distributed by making the best use of the opportunistic fog nodes. Therefore, this paper proposes a delayed offloading scheme to satisfy the response delay requirements and offload the request to the opportunistic fog nodes as efficiently as possible.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.557-565
• /
• 2005

This paper presents the development and implementation of a zero-copy file transfer mechanism that improves the efficiency of file transfers for PC cluster systems using hardware-based VIA(Virtual Interface Architecture) network adapters. VIA is one of the representative user-level communication interfaces, but because there is no library for file transfer, one copy occurs between kernel buffer and user boilers. Our mechanism presents a file transfer primitive that does not require the file system to be modified and allows the NIC to transfer data from the kernel buffer to the remote node directly without copying. To do this, we have developed a hardware-based VIA network adapter, which supports the PCI 64bit/66MHz bus and Gigabit Ethernet, as a NIC, and implemented a zero-copy file transfer mechanism. The experimental results show that the overhead of data coy and context switching in the sender is greatly reduced and the CPU utilization of the sender is reduced to $30\%\~40\%$ of the VIA send/receive mechanism. We demonstrate the performance of the zero-copy file transfer mechanism experimentally. and compare the results with those from existing file transfer mechanisms.

• Korean Journal of Plant Resources
• /
• v.27 no.1
• /
• pp.43-50
• /
• 2014

This study was carried out to determine the optimal medium composition and growth regulators for the micropropagation of Platycodon grandiflorum (Jacq.) A. DC. Nodes containing yellow green petals were used as plant materials to execute the study. The best performance of adventitious root development was found in 1/4 strength of MS basal salt and the growth was satisfactory in the concentration of 1/2 MS medium. The best condition for adventitious root development and growth was observed in the higher concentration (5%) of sucrose and activated charcoal free 1/4MS medium respectively. Adventitious roots were developed at the controlled culture medium at pH 4.8 with a tendency of suppression with higher levels of pH. However, it was prevailed that the development and growth depended on the concentration of agar. The lower concentration of agar (0.4%) was performed better than that of higher concentration (1.2%), whereas the agar concentration (0.4%) showed the best performance for the development and growth of adventitious roots. For the development of shoots containing node, BA combined with IAA was more effective than kinetin with IAA or NAA. The highest shoot development (3.9 shoots per explant) was performed on MS medium supplemented with 0.1 mg/L BA and 0.5 mg/L IAA.