• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.127-132
• /
• 2008

Wireless sensor network technologies applicable to various industrial fields are rapidly growing. Because it is difficult to change a battery for the once distributed wireless sensor network, energy efficient design is very critical. In order to achieve this purpose in network design, a number of studies have been examining the energy efficient routing protocol. The sensor network consumes energy in proportion to the distance of data transmission and the data to send. Cluster-based routing Protocols such as LEACH-C achieve energy efficiency through minimizing the distance of data transmission. In LEACH-C, however, the total distance between the nodes consisting the clusters are considered important in constructing clustering. This paper examines the cluster-head-selection-algorithm that reflect the distance between the base station and the cluster-head having a big influence on energy consumption. The Proposed method in this paper brought the result that the performance improved average $4{\sim}7%$ when LEACH-C and the base station are located beyond a certain distance. This result showed that the distance between cluster-head and the base station had a substantial influence on lifetime performance in the cluster-based routing protocol.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.12
• /
• pp.66-72
• /
• 2011

In Japan, the specification for digital terrestrial television broadcasting systems has been approved for employing a transmission scheme for ISDB-T, which can accommodate HDTV service and portable mobile reception by adapting segmentation of frequency. In this paper, we have developed 3.5 inch mobile TV according to One-Seg system and presented the results of our development. In addition, we introduce two diversity schemes to compensate the defect that signal is interrupted when the portable TV is moving fast. In order to achieve a reliable communication in One-Seg system, we introduce STD(space time diversity) which uses more than 2 antennas at TX and cooperative reception diversity which utilizes signal-exchanging between different mobile terminals. And, its performance enhancements to reception reliability of previous system are evaluated by computer simulations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.826-834
• /
• 2002

Asynchronous third generation mobile communication system is able to service Packet Switching through adding GPRS Network to the second generation system GSM. Therefore, it is necessary to study packet traffic service of GGSN node which is due to perform gateway role that GPRS Network is enable to inter-connect with Internet in order to optimize the capability and performance of GGSN. In this paper, the Internet packet traffic model that it is arrived to GGSN node from the Internet is studied and In order to process the Inter traffic efficiently, performance analysis model in GGSN is proposed to optimize packet processing capability of each processor. In order to guarantee QoS requirement of the real time traffic Speech and Video, several scheduling algorithm is applied to performance model and each mechanism is compared with several performance parameters.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.93-96
• /
• 2017

DDS (Data Distribution Serivce) communication middleware is spreading to various private sector as well as the defense sector because it can obtain a very high application effect in a complex system environment in which a plurality of data producers and data consumers are connected by a network. However, application development using DDS middleware is an inefficient structure with a lot of repetitive codes because most users perform 1: 1 mapping with the message they want to exchange. Accordingly, the user has to perform unnecessary repetitive tasks as the topic increases. Therefore, a development support tool that identifies a series of processes required for using DDS middleware and automatically generates the classes that are repeated by Topic is required. In this paper, we propose a method for DDS communication by automatically generating a common class for efficient use of DDS middleware.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.799-812
• /
• 2001

As XML become more popular for encoding data and exchanging format on the web, recent work on processing XML Document in DBMS has been performed. However, there is no formal data model for XML, and there is lack of research on XML algebra for processing complex XML query and even the mediators have many restrictions. Therefore, this paper proposes formal data model and algebra based on directed edge labeled graph for XML query. To implement algebra, not only algorithms of operation for algebra are presented, but also they are implemented using access method and path index based on RDBMS or ORDBMS. In particular, experiments to show the effectiveness of the implemented algebra are performed on XML documents on EST data which are semistructured data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.108-114
• /
• 2008

Since flash memory cannot be overwritten, new data are updated in new area. If data are frequently updated, garbage collection which is achieved by erasing blocks, should be performed to reclaim new area. Hence, because the count of erase operations is limited due to characteristics of flash memory, every block should be evenly written and erased. However, if data with access locality are processed by cost benefit algorithm with separation of hot block ad cold block though the performance of processing is hight wear-leveling is not even. In this paper, we propose CB-MB (Cost Benefit between Multi Bank) algorithm in which hot data are allocated in one bank and cold data in another bank, and in which role of hot bank and cold bank is exchanged every period. CB-MB shows that its performance is 30% better than cost benefit algorithm with separation of cold block and hot block its wear-leveling is about a third of that in standard deviation.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.10
• /
• pp.419-426
• /
• 2022

In this paper, we propose a method to improve the accuracy of 3D human pose estimation model in various move motions. Existing human pose estimation models have some problems of jitter, inversion, swap, miss that cause miss coordinates when estimating human poses. These problems cause low accuracy of pose estimation models to detect exact coordinates of human poses. We propose a method that consists of detection and correction methods to handle with these problems. Deep learning-based outlier detection method detects outlier of human pose coordinates in move motion effectively and rule-based correction method corrects the outlier according to a simple rule. We have shown that the proposed method is effective in various motions with the experiments using 2D golf swing motion data and have shown the possibility of expansion from 2D to 3D coordinates.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1348-1351
• /
• 2008

최근 인터넷 사용자들의 요구는 멀티미디어로 집중되고 있으며 그중 라이브 미디어 스트리밍 서비스에 대한 요구가 증가하고 있다. 라이브 서비스에서는 적절한 시간에 사용자에게 데이터가 도착하는 것이 중요하다. 따라서 라이브의 시간적절성을 충족시켜 줄 효율적이고 신속한 데이터 전달구조와 전송기법이 요구된다. 이에 본 논문에서는 트리와 메시 구조를 혼합한 하이브리드 방식으로 네트워크 자원을 효율적으로 사용하면서 빠른 데이터 전송으로 라이브의 시간적절성을 충족시킬 수 있는 데이터 분할 전송 방식의 P2P(Peer-to-Peer) 오버레이 구조를 제안한다. 제안하는 ToG(Tree of Groups)는 n개의 피어들이 메시로 그룹을 형성하고, 그렇게 형성된 그룹들이 트리를 이루는 구조이다. ToG에서 그룹 내의 각 피어들은 상위그룹의 피어 한 개와 부모-자식으로 연결되어 있어서 그룹 사이에 여러 개의 연결이 존재하게 된다. 따라서 그룹 내에서 어느 한 피어가 그룹을 빠져 나가더라도 상위그룹과의 여러 연결에 의해서 서비스 지속성을 보장 할 수 있다. ToG는 그룹단위로 트리가 형성되기 때문에 피어의 개수가 같을 때 피어단위로 트리를 형성하는 구조보다 트리의 깊이가 줄어든다. 그에 따라 말단에 있는 피어들에게까지 빠른 시간에 데이터가 전달 될 수 있다. ToG의 데이터 전달은 소스로부터 세그먼트가 일정한 값 n으로 나뉘어져 각 피어들에게 전달된다. 세그먼트 조각은 소스로부터 나뉘어져 전송 될 때 책임적으로 전달해야할 피어와 전달 순서가 정해져있고, 데이터 전송 스케줄링을 위한 버퍼 맵 교환은 필요하지 않다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1250-1260
• /
• 2014

In this paper, a novel resource scheduling, which is used for hub network based long distance airborne tactical communication, is proposed. Recently, some countries of the world has concentrated on developing data rate and networking performance of CDL, striving to keep pace with modern warfare, which is changed into NCW. And our government has also developed the next generation high capacity CDL. In hub network, a typical communication structure of CDL, hybrid FDMA/TDMA can be considered to exchange high rate data among multiple UAVs simultaneously, within limited bandwidth. However, due to different RTT and traffic size of UAV, idle time resource and unnecessary packet transmission delay can occur. And these losses can reduce entire efficiency of hub network in long distance communication. Therefore, in this paper, we propose RTT and data traffic size based UAV scheduling, which selects time/frequency resource of UAVs by using iterative sorting algorithm. The simulation results verified that the proposed scheme improves data rate and packet delay performance in low complexity.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.65-76
• /
• 2002

QoS routing is a routing technique for finding feasible path that satisfies QoS requirements required by application programs. Since QoS routing determines such paths in terms of dynamic network state, it satisfies the requirement of applications and increases the utilization of the network. The overhead is, however, generated by routers to exchange the information of the dynamic state of network. In order to reduce this protocol overhead, a timer based update mechanism is proposed in which router checks the change of the network status periodically and network state information is exchanged if the change is greater than a certain value. Using large update period makes, though, routing performance irresponsive to the parameters which determine the update of the network state of the router. In addition to this, large update period may result in inaccurate network state information at routers and cause resource reservation failure. The resource reservation failure generates additional overhead to cancel the resource reservation of the part of the path. In this paper, we propose mechanisms enhancing the existing network state update policy with respect to these two problems. Performance of the proposed schemes are evaluated through a course of simulation.