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

Recent research into wireless sensor network (WSN)-related technology that senses various data has recognized the need for spatio-temporal queries for searching necessary data from wireless sensor nodes. Answers to the queries are transmitted from sensor nodes, and for the efficient transmission of the sensed data to the application server, research on index processing methods that increase accuracy while reducing the energy consumption in the node and minimizing query delays has been conducted extensively. Previous research has emphasized the importance of accuracy and energy efficiency of the sensor node's routing process. In this study, we propose an itinerary-based R-tree (IR-tree) to solve the existing problems of spatial query processing methods such as efficient processing and expansion of the query to the spatio-temporal domain.

• Proceedings of the KIEE Conference
• /
• 1999.07e
• /
• pp.2051-2053
• /
• 1999

In this work, PD patterns and electrical trees are observed by use of the XLPE cable insulation. and the tree initiation voltage related to the contamination are also measured in order to calculate the electric stress necessary for the design of cable insulation. Throughout these works, correlation between the PD pattern and the shape of electrical tree has been observed that there may exist three distinct pattern of PD dependence on the stage of tree propagation, Such correlation could bring a basic information in connection with the partial discharge of cable system. It was also found that the electrical stress necessary for the initiation of electrical tree was measured to the 290kV/mm for the 154kV XLPE cables manufactured in KOREA.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.355-356
• /
• 2011

LiDAR data is very large, which contains an amount of redundant information. The information not only takes up a lot of storage space but also brings much inconvenience to the LIDAR data transmission and application. Therefore, a simplified method was proposed for LiDAR data based on quad-tree structure in this paper. The boundary contour lines of the buildings are displayed as building extraction. Experimental results show that the method is efficient for point's simplification according to the rule of mapping.

• Journal of Technology Innovation
• /
• v.22 no.4
• /
• pp.117-143
• /
• 2014

Tracing an evolutionary technological trajectory in the macroscopic viewpoint is useful for technology policy, but not for corporate technology and intellectual property strategy. Tackling this issue, recent bibliometric studies using patents and papers have made efforts to identify more specific and detailed technological trajectory. However, these studies cannot go beyond simple description of the past trajectory. Also, identification of technology fusion and evolution relies on experts judgments. We suggest a way of identifying microscopic evolutionary technological trajectories by combining patent citation network analysis with dynamic technology tree. Also, using new indicators of generality, diversity and novelty, we can detect key technologies that can be a starting point of next generation technology and derivative technology. HVDC(High Voltage DC transmission) system technology is exemplified.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.6
• /
• pp.1375-1386
• /
• 2016

This paper presents an efficient hash chain-based data authentication mechanism which can considerably reduce the overhead of processing and transmission for authenticating segments in CCN. The proposed method makes use of hash chain and MHT(Merkle Hash Tree). At first, it applies hash chain methods for data segments and encodes them to Data part. Then, it constitutes Meta part with the hash values generated at the previous step and properly applies both hash chain method and MHT-based signing for not only achieving efficiency, but also mitigating the drawback(data-loss, out-of-order transmission) of hash chain method. We have implemented our method in the CCNx library and measured the performance. When transmitting 100Mbyte of content, the proposed method generates only 2.596% of processing overhead and 1.803% of transmission overhead.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.189-194
• /
• 2004

This paper proposes a Simulated Annealing(SA) algorithm for cluster-based Multicast Routing problems. Multicasting, the transmission of data to a group, can be solved from constructing multicast tree, that is. the whole network is partitioned to some clusters and the clusters are constructed by multicast tree. Multicast tree can be constructed by minimum-cost Steiner tree. In this paper, an SA algorithm is used in the minimum-cost Steiner tree. Especially, in SA, the cooling schedule is an important factor for the algorithm. Hence, in this paper, a cooling schedule is proposed for SA for multicast routing problems and analyzed the simulation results.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.131-132
• /
• 2007

In this paper, we designed and implemented bio-signals transmission and storage system using wireless sensor network based on ZigBee. Wireless sensor network is organized with routing protocol based on tree structure. The data is transmitted to monitoring system based on SIP. ZigBee will be used as various combinations with other wireless network technologies for application purposes.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2615-2628
• /
• 1997

In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.66-69
• /
• 2000

In this paper, we propose a progressive transmission of a video using a 2$\times$2$\times$2 DCT First of all, the video data is transformed into multiresolution represented video data using a 2$\times$2$\times$2 DCT. Then. it is represented by a 3-D EZT(Embedded Zero Tree) coding fur the progressive transmission with a bit-rate scalability. The proposed progressive transmission algorithm needs much less computations and buffer memories than the higher-order convolution based wavelet filter. Also, since the 2$\times$2$\times$2 DCT requires independent local computations, parallel processing can be applied.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.2042-2060
• /
• 2013

In wireless sensor networks (WSNs), energy efficiency is one of the most essential design considerations, since sensor nodes are resource constrained. Group communication can reduce WSNs communication overhead by sending a message to multiple nodes in one packet. In this paper, in order to simultaneously resolve the transmission security and scalability in WSNs group communications, we propose a hierarchical cluster-based secure and scalable group key management scheme, called HRKT, based on logic key tree and route key tree structure. The HRKT scheme divides the group key into cluster head key and cluster key. The cluster head generates a route key tree according to the route topology of the cluster. This hierarchical key structure facilitates local secure communications taking advantage of the fact that the nodes at a contiguous place usually communicate with each other more frequently. In HRKT scheme, the key updates are confined in a cluster, so the cost of the key updates is reduced efficiently, especially in the case of massive membership changes. The security analysis shows that the HRKT scheme meets the requirements of group communication. In addition, performance simulation results also demonstrate its efficiency in terms of low storage and flexibility when membership changes massively.