• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.7
• /
• pp.12-19
• /
• 2020

The clustered heterogeneous wireless sensor network is comprised of sensor nodes and cluster heads, which are hierarchically organized for different objectives. In the network, we should especially take care of managing node resources to enhance network performance based on memory and battery capacity constraints. For instances, if some interesting events occur frequently in the vicinity of particular sensor nodes, those nodes might receive massive amounts of data. Data congestion can happen due to a memory bottleneck or link disconnection at cluster heads because the remaining memory space is filled with those data. In this paper, we utilize drones as mobile sinks to resolve data congestion and model the network, sensor nodes, and cluster heads. We also design a cost function and a congestion indicator to calculate the degree of congestion. Then we propose a data congestion map index and a data congestion mapping scheme to deploy drones at optimal points. Using control variable, we explore the relationship between the degree of congestion and the number of drones to be deployed, as well as the number of drones that must be below a certain degree of congestion and within communication range. Furthermore, we show that our algorithm outperforms previous work by a minimum of 20% in terms of memory overflow.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.327-332
• /
• 2004

USB(Universal Serial Bus) is one of the most popular communication interfaces. When USB is used in an extended range, especially configurating In-home network by connecting multiple digital devices each other, USB interface uses the bandwidth in the way of TDM(Time Division Multiplexing) so that the bottleneck of bus bandwidth can be brought. In this paper, the more effective usage of bus bandwidth to overcome this situation is introduced. Basically, in order to realize the system for transferring realtime moving picture data among digital information devices, we analyze USB transfer types and Descriptors and introduce the method to upgrade detailed performance of Isochronous transfer that is one of USB transfer types. In the case that Configuration descriptor of a device has Interface descriptor that has two AlternateSetting, if Isochronous transfers are not processed smoothly due to excessive bus traffic, the application of the device changes AlternateSetting of the Interface descriptor and requires a new configuration by SetInterface() request. As a result of this adaptive configuration, the least data frame rate is guaranteed to a device that the sufficient bandwidth is not alloted. And if the bus traffic is normal, the algorithm to return to the original AlteranteSetting is introduced. this introduced method resolve the bottleneck of moving picture transfer that can occur in home network connected by multiple digital devices.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.7
• /
• pp.493-503
• /
• 2018

Recently, as living standards have improved, many people are becoming more interested in health, and self-training is increasing through exercise to prevent and manage pre-illness. In general, an imbalance of muscles causes asymmetry of posture, which can cause various diseases by accompanying an adjustment force, circulation action, displacement of internal organs, etc.. In this study, the development of fitness software that can be self - training among smart wears has attracted considerable attention in recent years. In this study, a technology was proposed for the commercialization of self - trainer fitness wear by a simulation through Android - based applications. Self - trainer fitness software was developed by combining a conductive polymer, fashion design, sewing, and electric and electronic technology to monitor the unbalance of the muscles during exercise and make smart wear that can calibrate the asymmetry by oneself. In particular, a polymer sensor was fabricated by deriving the optimal MWCNT concentration, and the electrode signal was collected by attaching the electrode to the optimal position, where the electrode signal line using the conductive fiber was designed and attached to collect the signal. A signal module that converts the bio-signals collected through electrical signal conversion and transmits them using Bluetooth communication was designed and manufactured. Self-trainer fitness software that can be commercialized was developed by combining noise cancellation with Android-based self-training application using a software algorithm method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.12
• /
• pp.5843-5848
• /
• 2011

To improve the efficiency of the channel spectrum and to reduce the power consumption of the system in EVRC, the voice signal is compressed and transmitted only when the user speaks to. In addition to this, voice frames are divided into three rates 1, 1/2 and 1/8 and each frame is handled differently. For example, we assumed that the input is silence region if the 1/8 rate is used. In this paper, the sections are firstly separated into the voiced speech signal region, unvoiced speech signal region, and silence region by using distribution characteristics of LSP parameters. Then the paper suggested to encode 1 rate for the voiced speech signal, 1/2 rate for the unvoiced speech signal region, 1/8 rate for the silence region. In other words, traditional way of transmission is used when sending full rate in the EVRC. However, when sending half rate, the voice is firstly distinguished between voiced and unvoiced. If the voice is distinguished as voiced, voice is converted into full rate before the transmission. If it is distinguished as silence, EVRC's basic rate is applied. In the experimental results with SNR, ASDM, transmission bit rate measurement, we have demonstrated that voice quality was improved by using the proposed algorithm.

• Journal of Astronomy and Space Sciences
• /
• v.23 no.3
• /
• pp.245-258
• /
• 2006

In this paper, an automation algorithm of analyzing and scheduling the station-keeping maneuver is presented for Communication, Ocean and Meteorological Satellite (COMS). The perturbation analysis for keeping the position of the geostationary satellite is performed by analytic methods. The east/west and north/south station-keeping maneuvers we simulated for COMS. Weekly east/west and biweekly north/south station-keeping maneuvers are investigated for a period of one year. Various station-keeping orbital parameters are analyzed. As the position of COMS is not yet decided at either $128.2^{\circ}E\;or\;116.0^{\circ}E$, both cases are simulated. For the case of $128.2^{\circ}E$, east/west station-keeping requires ${\Delta}V$ of 3.50m/s and north/south station-keeping requires ${\Delta}V$ of 52.71m/s for the year 2009. For the case of $116.0^{\circ}E,\;{\Delta}V$ of 3.86m/s and ${\Delta}V$ of 52.71m/s are required for east/west and north/south station-keeping, respectively. The results show that the station-keeping maneuver of COMS is more effective at $128.2^{\circ}E$.

• Journal of KIISE:Software and Applications
• /
• v.35 no.3
• /
• pp.197-206
• /
• 2008

In the mobile Internet environment, frequent communications between a mobile device and a content server are required for searching or downloading learning materials. In this paper, we propose an efficient prefetching technique to reduce the network cost and to improve the communication efficiency in the mobile dictionary. Our prefetching-based approach can be explained as follows. First, we propose an overall framework for the prefetching-based mobile dictionary. Second, we present a systematic way of determining the amount of prefetching data for each of packet-based and flat-rate billing cases. Third, by focusing on the English-Korean mobile dictionary for middle or high school students, we propose an intuitive method of determining the words to be prefetched in advance. Fourth, based on these determination methods, we propose an efficient prefetching algorithm. Fifth, through experiments, we show the superiority of our prefetching-based method. From this approach, we can summarize major contributions as follows. First, to our best knowledge, this is the first attempt to exploit prefetching techniques in mobile applications. Second, we propose a systematic way of applying prefetching techniques to a mobile dictionary. Third, using prefetching techniques we improve the overall performance of a network-based mobile dictionary. Experimental results show that, compared with the traditional on-demand approach, our prefetching based approach improves the average performance by $9.8%{\sim}33.2%$. These results indicate that our framework can be widely used not only in the mobile dictionary but also in other mobile Internet applications that require the prefetching technique.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.4
• /
• pp.1830-1838
• /
• 2012

The intra prediction and the motion estimation of inter prediction occupy 70 ~ 80% of whole compression time in H.264/AVC. Compression efficiency has been higher, but complexity has increased and coding time has also increased much more. This paper proposes a block size decision method of the intra prediction and mode decision method which minimize the loss of video quality during the encoding and shorten the time spent. This paper, in addition, proposes an algorithm which determines the method of adaptive block mode for motion estimation of inter prediction. We investigated PSNR and the intra prediction and inter prediction of time-consuming calculations in order to measure video quality degradation and complexity through experiments. Consequently, when you use all three methods, these methods showed that average coding time is shortened as about 500 to 600ms in every frame in the case of all experimented videos, keeping video quality nearly similar, compared with existing methods of H.264.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.21-33
• /
• 2008

The wireless sensor nodes near to the fixed sink node suffer from the quickly exhausted battery energy. To address this problem, the mobile sink node has been applied to distribute the energy consumption into all wireless sensor nodes. However, since the mobile sink node moves, the data collection scheduling scheme is necessary for the sink node to receive the data from all sensor nodes as fair as possible. The application fields of wireless sensor network need the real-time processing. If the uneven data collection occurs in the wireless sensor network, the real-time processing for the urgent events can not be satisfied. In this paper, a new method is proposed to support the lair data collection between all sensor nodes. The proposed method performs the scheduling algorithm based on the resident time of the sink node staying in a radius of communication range and the amount of data transferred already. In this paper, the proposed method and existing data collection scheduling schemes are evaluated in wireless sensor network with the mobile sink node. The result shows that the proposed method provides the best fairness among all data collection schemes.

• The Journal of the Korea Contents Association
• /
• v.15 no.9
• /
• pp.21-28
• /
• 2015

In the semi-conductor process, a simulation process is performed to detect defects by analyzing the behavior of the impurity through the physical quantity calculation of the inner element. In order to perform the simulation, Finite-Difference Time-Domain(FDTD) algorithm is used. The improvement of semiconductor which is composed of nanoscale elements, the size of simulation is getting bigger. Problems that a processor such as CPU or GPU cannot perform the simulation due to the massive size of matrix or a computer consist of multiple processors cannot handle a massive FDTD may come up. For those problems, studies are performed with parallel/distributed computing. However, in the past, only single type of processor was used. In GPU's case, it performs fast, but at the same time, it has limited memory. On the other hand, in CPU, it performs slower than that of GPU. To solve the problem, we implemented a computing model that can handle any FDTD simulation regardless of size on the cluster which consist of heterogeneous processors. We tested the simulation on processors using MPI libraries which is based on 'point to point' communication and verified that it operates correctly regardless of the number of node and type. Also, we analyzed the performance by measuring the total execution time and specific time for the simulation on each test.

• The KIPS Transactions:PartA
• /
• v.12A no.7 s.97
• /
• pp.627-636
• /
• 2005

This paper presents a PC cluster-based distributed video on demand (VOD) server that minimizes the load of the interconnection network by adopting channel bonding-based MVIA and the interval cache algorithm Video data is distributed to the disks of each server node of the distributed VOD server and each server node receives the data through the interconnection network and sends it to clients. The load of the interconnection network increases because of the large volume of video data transferred. We adopt two techniques to reduce the load of the interconnection network. First, an Msupporting channel bonding technique is adopted for the interconnection network. n which is a user-level communication protocol that reduces the overhead of the TCP/IP protocol in cluster systems, minimizes the time spent in communicating. We increase the bandwidth of the interconnection network using the channel bonding technique with MThe channel bonding technique expands the bandwidth by sending data concurrently through multiple network cards. Second, the interval cache reduces traffic on the interconnection network by caching the video data transferred from the remote disks in main memory Experiments using the distributed VOD server of this paper showed a maximum performance improvement of $30\%$ compared with a distributed VOD server without channel bonding-based MVIA and the interval cache, when used with a four-node PC cluster.