• Journal of IKEEE
• /
• v.12 no.4
• /
• pp.185-195
• /
• 2008

In this paper, PIFA(Planar Inverted F Antenna) which operates in PCS(Personal Communication System) band is designed and characteristics are investigated. Designed PIFA was installed in three types of handsets, folder, bar, slide, and the performance was evaluated. Head and hand phantom were added to make the most similar environment to real condition of mobile phone use, and influences on antenna performance were analyzed. The simulation results confirm radiation patterns are greatly changed and antenna efficiency is decreased by the effect of human body. Performance variation of the mobile handset antenna was observed as changing the angle between mobile handset and head phantom from $0^{\circ}$ to $2^{\circ},\;4^{\circ}$ to confirm the variation caused by the relative position of mobile handset and head phantom. Directivity was decreased gradually as the antenna goes away from head phantom, and showed the trend of increasing efficiency. But in the case of bar type, where the position of antenna is relatively close to head phantom, that trend didn't show. It was confirmed that the shape of handset has a great effect on the performance.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.524-530
• /
• 2016

The desire to access data faster and the growth of next-generation memories such as non-volatile memories, contribute to the development of research on memory file systems. It is recommended that memory mapped file I/O, which has less overhead than read-write I/O, is utilized in a high-performance memory file system. Memory mapped file I/O, however, brings a page table overhead, which becomes one of the big overheads that needs to be resolved in the entire file I/O performance. We find that same overheads occur unnecessarily, because a page table of a file is removed whenever a file is opened after being closed. To remove the duplicated overhead, we propose the mapping cache, a technique that does not delete a page table of a file but saves the page table to be reused when the mapping of the file is released. We demonstrate that mapping cache improves the performance of traditional file I/O by 2.8x and web server performance by 12%.

• Smart Media Journal
• /
• v.6 no.4
• /
• pp.24-31
• /
• 2017

In wireless sensor networks, sensor nodes are deployed in a remote, harsh environment. When the power of the sensor node is consumed in such a network, the sensor nodes become useless together with the deterioration of the quality and performance of the sensor network which may save human life. Although many clustering protocols have been proposed to improve the energy consumption and extend the life of the sensor network, most of the previous studies have shown that the overhead of the cluster head is quite large. It is important to design a routing protocol that minimizes the energy consumption of each node and maximizes the network lifetime because of the power limitations of the sensor nodes and the overhead of the cluster heads. Therefore, in this paper, we propose an efficient clustering scheme that reduces the burden of cluster heads, minimizes energy consumption, and uses algorithms that maximize network lifetime. Simulation results show that the proposed clustering scheme improves the energy balance and prolongs the network life when compared with similar techniques.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.1
• /
• pp.107-119
• /
• 1991

This dissertation analyzes the running mechanism of flexible and thin tape above rotating head through the experiment. The scope of study is confined to measure the vertical deformation of running tape under hydrodynamic pressure invoking phenomena of elasto-hydrodynamic lubrication between the protruded bump on a rotating cylinder ad the running tape. Experimental system is devised to measure the vertical deflection of the running tape by opto-electronical displacement gauge, which enables to detect microscopic surface deflection of high frequency. Thorough the tests of small specimens of groove and bump, the accuracy and reliability of this experimental method is confirmed and achieved an accuracy within 5%(2.mu.m) error for the microscopic deflection with high frequency. In experimental works, the effects of bump size on flying characteristics of the tape were evaluated and examined. For the vertical deformation of the running tape. the numerical results and its trend agree qualitatively with the experimental ones.

• Journal of Broadcast Engineering
• /
• v.21 no.3
• /
• pp.436-449
• /
• 2016

This paper compares the transport overhead of MMT (MPEG Media Transport) with that of MPEG-2 TS (Transport Stream). MPEG-2 TS is globally used in multiplexing compressed audio and video data in digital broadcast industry, including areas of DTV (Digital Television), IPTV (Internet Protocol Television), and DMB (Digital Multimedia Broadcasting). It was the early 1990s when MPEG-2 TS standard was established. After more than two decades of years since its first establishment, many parts of MPEG-2 TS turned out to be inappropriate to today's broadcast and communication environment. Given the situations, in 2014 MPEG (ISO/IEC JTC 1 SC 29/WG 11) standardized MMT as the next-generation multimedia transport standard hopefully that can replace MPEG-2 TS. In this paper, with assumptions of broadcast service scenarios we applied both MMT and MPEG-2 TS to each scenario and we calculated their transport overheads. We used a software program that counts the transport overhead, which was developed in our laboratory for this paper. And we conducted a comparative analysis based on the calculated result of transport overhead.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.331-340
• /
• 2008

In order to make load balancing, workload information of nodes should be informed to the network. In a load balancing algorithm[13] based on the SBIBD(Symmetric Balanced Incomplete Block Design), each node receives global workload information by only two round message exchange with O (${\upsilon}{\sqrt{\upsilon}}$) traffic overhead, where ${\upsilon}$ is the number of nodes. It is very efficient but works well only when ${\upsilon}=p^2+p+1$ for a prime number p. In this paper, we generate a special incidence structure in order for the algorithm works well for an arbitrary number of nodes. In the experiment with w,($5{\leq}w{\leq}5,000$), nodes and more than 80% of receiving workload information, traffic overhead was less than O ($w{\sqrt{w}})$ and the result for standard deviation of traffic overhead showed that each node has largely balanced amount of traffic overhead.

• Journal of Advanced Navigation Technology
• /
• v.13 no.4
• /
• pp.551-558
• /
• 2009

Most of clustering schemes focusing on the energy efficiency have only a cluster head in each cluster, thus the energy consumption of cluster head in a cluster can rapidly increase. To reduce the energy consumption, recently, the dual-layered clustering which is separated a cluster ranges into two parts, i.e., data aggregation layer and data transmission layer, based on a sensor equipped with geographical positioning system (GPS), was proposed. However, the logical regions existing within the dual-layered clustering range can not distinguish efficiently. This scheme leads to many messages collision and transmission delay among member nodes. In this paper, to solve these problems, we propose a separated dual-layered routing scheme using the position information and the cluster radius. Proposed scheme clearly distinguish the dual-layered clustering range and gets the balanced number of member nodes in each cluster. Therefore, the proposed routing scheme could prolong the overall network life time about 10% compared to the previous two layered clustering scheme and LEACH.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.640-642
• /
• 2005

분산된 컴퓨팅 환경은 프로세서의 개수를 적응적으로 활용하는 병렬 처리 환경으로 활용할 수 있다. 병렬 처리예 의한 수행 시간 단축 효과에 가장 많은 영향을 주는 것은 활용되는 프로세서의 개수와 병렬 처리 요소 상호 간의 통신 오버헤드이다. 분산된 컴퓨팅 환경으로 구성한 병렬 처리는 통신 오버헤드에 의한 단점과 프로세서의 개수를 자유롭게 활용할 수 있다는 장점이 상반되는 특성을 가지며 레이트레이싱에 의한 렌더링과 같이 계산량이 많고 병렬 처리 요소 상호 간의 통신량이 적은 응용 분야에 효과적이다. 분산된 컴퓨팅 환경을 병렬 처리에 활용하기 위하여 기존의 분산 처리 모델을 적웅용면 통신 오버헤드 이외에 부수적인 오버헤드(프로그래밍 및 확용 절차)로 인하여 실효성을 발휘하기 어렵다. 단일 컴퓨팅 환경을 위한 절차와 서비스를 그대로 적용하여 분산된 컴퓨팅 환경을 구성하는 여러 대의 컴퓨터를 통합하여 활용하는 방안은 이와 같은 부수적인 오버헤드를 해결할 수 있으며 본 연구팀에서 이미 발표한 TORB(Transparent Object Request Broker)는 프로그래밍 투명성의 제공을 통하여 분산된 컴퓨팅 환경을 활용하기 위한 프로그램을 단일 컴퓨팅 환경을 위한 프로그래밍 기법을 적응하여 작성할 수 있도록 지원한다. 지속적인 연구를 통하여 프로그래밍 투명성의 범위를 확장함과 동시에 활용 절차의 투명성을 지원하는 방안을 추가하였고 새로운 분산 처리 모델을 설계하여 이러한 절차와 서비스를 체계적으로 정립하였다. 인터넷에 연결된 컴퓨터는 적절한 수준의 컴퓨팅 능력을 갖추고 있고 상호 간의 정보 교환을 할 수 있는 상태이므로 "TORB"와 같이 잘 정의된 패러다임으로 이들을 통합하여 운영하면 병렬 처리에 참여하는 프로세서의 개수를 자유롭게 활용하여 수행시간 감소 효과(병렬 처리에 의한)를 극대화할 수 있다. 그러나 인터넷을 기반으로 하는 분산된 병렬 처리를 지원하기 위해서는 "TORB"가 이미 제공하는 투명성 외에 불특정한 타인이 작성한 프로그램 코드가 "TORB"를 통하여 자신의 컴퓨터에서 실행되어도 악의적인 동작을 수행하지 못하게 하는 보안 기능과 인터넷에 연결된 방대한 수의 컴퓨터를 "TORB"에 의해 구성되는 분산된 컴퓨팅 환경에 참여시키는 시나리오가 필요하다.

• Journal of Advanced Navigation Technology
• /
• v.17 no.2
• /
• pp.189-195
• /
• 2013

In an environment with frequent job requests and short job processing times, thread pool methods are frequently used to increase throughput by reducing overheads due to thread creation and removal. A watermark method normally reduces unnecessary uses of resources by keeping the number of threads less than those needed in the maximum. In the absence of available threads, however, it processes jobs by creating additional threads up to a specified limit so that the system overhead increases due to creation of threads, which results in throughput degradation. This paper presents a history-based dynamic method that alleviates throughput degradation. By estimating and maintaining the number of threads needed for jobs, it reduces overheads due to thread creation and removal. According to experiments, compared to the watermark thread pool method, it shows average 33% increase in the number of threads kept and average 62% reduction in the number of threads created, which results in 6% increase in terms of system throughput.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.741-748
• /
• 2006

Due to the continuous development of sensor technology, Wireless Sensor Networks are rapidly growing and are expected to be applied to various applications. One of the most important factors in Wireless Sensor Networks is energy-efficient management of network resources. For this purpose, a lot of researches have been ongoing in the development of energy-efficient routing protocol. In this paper, a cluster head selection algorithm considering node density in addition to the cluster head selection algorithm of LEACH-C is proposed and simulated. This algorithm gives nearly the same computational speed compared to that of LEACH-C and shows improvement of network lifetime about 11% better than LEACH-C. The simulation result shows that consideration of density as well as distance between nodes in cluster head selection can be more energy-efficient than considering only the distance between nodes as LEACH-C in energy usage of Wireless Sensor Networks.