• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.257-271
• /
• 2009

In this paper, we propose a protocol compression scheme for enhancing the performance of call processing of PTT(Push-to-Talk) which is one of the important services in IMS(IP Multimedia Subsystem), a next generation integrated wired/wireless packet communication network. To service the PTT on an IMS network, it should use the same call setup procedure as legacy Mobile and TRS(Trunked Radio System) networks and have a fast call setup time and enough communication bandwidth because a number of terminals should be able to exchange same data in real time. The proposed A+SigComp scheme reduces the initial call setup delay of SIP by about 10%, which is used by PTT service for call setup. In addition, the A+ROHC scheme is proposed to compress the header of RTP packets transferred during PTT voice transmission and, as a result, about 5% of increase in communication efficiency is observed.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.55-59
• /
• 2010

Currently in a Ubiquitous Sensor Network (USN) research field, supporting mobility is recognized as an important technology. MIPv6 and Network Mobility(NEMO) Basic Support Protocol are standard protocols to support mobility in the Internet. However, if they are applied to USN with no modification, handoff performance decreases due to the size of their binding message. An existing lightweight protocol for NEMO protocol has a compatibility problem of Sequence Num. and does not optimally compress binding messages considering 6LoWPAN network structure and addressing. This paper proposes optimal header compression which supports node-based mobility and network-based mobility. Our optimal compression technique compresses a 32bytes binding update(BU) message and a 12bytes binding ACK(BA) message of MIPv6 into 13bytes and 3bytes, and a 40bytes BU message and a 12bytes BA message of NEMO protocol into 13bytes and 3bytes. The result shows that our protocol compresses 15bytes (NEMO-BU) and 1byte (NEMO-BA) more than the existing protocol and achieves 8.72% handoff performance improvement.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.571-578
• /
• 2002

In this paper, we propose a video sequence coding scheme called AMV (Auxiliary Motion Vector) to minimize error propagation caused by transmission errors over the Internet. Unlike the conventional coding schemes the AMY coder, for a macroblock in a frame, selects two best matching blocks among several preceding frames. The best matching block, called a primary block, is used for motion compensation of the destination macroblock. The other block, called an auxiliary block, replaces the primary block in case of its loss at the decoder. When a primary block is corrupted or lost during transmission, the decoder can efficiently and simply suppress error propagation to the subsequent frames by replacing the block with an auxiliary block. This scheme has an advantage of reducing both the number and the impact of error propagations. We implemented the proposed coder by modifying H.263 standard coding and evaluated the performance of our proposed scheme in the simulation. The simulation results show that AMV coder is more efficient than the H.263 baseline coder at the high packet loss rate.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.485-491
• /
• 2012

This paper proposes 'Coding Unit Tree' based on quadtree efficiently with motion vector to represent splitting information of a Coding Unit (CU) in HEVC. The new international video coding, High Efficiency Video Coding (HEVC), adopts various techniques and new unit concept: CU, Prediction Unit (PU), and Transform Unit (TU). The basic coding unit, CU is larger than macroblock of H.264/AVC and it splits to process image-based quadtree with a hierarchical structure. However, in case that there are complex motions in CU, the more signaling bits with motion information need to be transmitted. This structure provides a flexibility and a base for a optimization, but there are overhead about splitting information. This paper analyzes those signals and proposes a new algorithm which removes those redundancy. The proposed algorithm utilizes a type code, a dominant value, and residue values at a node in quadtree to remove the addition bits. Type code represents a structure of an image tree and the two values represent a node value. The results show that the proposed algorithm gains 13.6% bit-rate reduction over the HM-1.0.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.253-260
• /
• 2004

This paper proposes a novel algorithm for hybrid lossless audio coding, which employs an integer wavelet transform and a linear prediction model. The proposed algorithm divides the input signal into flames of a proper length, decorrelates the framed data using the integer wavelet transform and linear prediction and finally entropy-codes the frame data. In particular, the adaptive Golomb-Rice coding method used for the entropy coding selects an optimal option which gives the best compression efficiency. Since the proposed algorithm uses integer operations, it significantly improves the computation speed in comparison with an algorithm using real or floating-point operations. When the coding algorithm is implemented in hardware, the system complexity as well as the power consumption is remarkably reduced. Finally, because each frame is independently coded and is byte-aligned with respect to the frame header, it is convenient to move, search, and edit the coded, compressed data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1721-1730
• /
• 1999

In this thesis, an error resilient video coding algorithm, under the error-prone environment such as wireless communication, is suggested. The suggested algorithm adapts the Classified VQ method for intra imagers that reduces some load by searching similar vectors. The Duplicate Vector Position Code is proposed for the higher compression efficiency and the robust decoding in error environment. As a result, the bitstream encoded by the proposed method is in a CBR(Constant Bit Rate) preventing from error propagation. The experiment that adds practical error to the encoded bitsrteam shows the error-robustness superior to H.263.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.11-21
• /
• 2010

Increase in the number of sensor nodes in sensor networks and sensor node to automatically assign addresses are needed. The method developed to address existing severe wasting, coordinators have all address information, each sensor node when addressing the shortcomings are a lot of traffic. In this paper, 6LoWPAN automatically from the sensor nodes capable of efficiently addressing Hop-Count based hierarchical address allocation algorithm is proposed. How to propose a hop-count of divided areas are separated, with no overlap and can be assigned a unique address, DAD(Duplicate Address Detection) reduced area. Perform DAD to reduce traffic, packet transmission in the IP header destination address, respectively, with a minimum 32-bit compression and packet transmission over a non-compression method to reduce the number of 11.1%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1237-1245
• /
• 2006

This paper presented a hardware implementation of ARIA, which is a Korean standard l28-bit block cryptography algorithm. In this work, ARIA was designed technology-independently for application such as ASIC or core-based designs. ARIA algorithm was fitted in FPGA without additional components of hardware or software. It was confirmed that the rate of resource usage is about 19% in Altera EPXAl0F1020CI and the resulting design operates stably in a clock frequency of 36.35MHz, whose encryption/decryption rate was 310.3Mbps. Consequently, the proposed hardware implementation of ARIA is expected to have a lot of application fields which need high speed process such as electronic commerce, mobile communication, network security and the fields requiring lots of data storing where many users need processing large amount of data simultaneously.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5B
• /
• pp.437-442
• /
• 2011

As an Internet Engineering Task Force (IETF) Working Group, 6LoWPAN is standardizing the IPv6 packet transfer technology in accordance with IEEE 802.15.4. It has completed two Request for Comments (RFC) documents, one of which, RFC 4944, addresses fragmentation, reassembly, and header compression technologies. In this paper, a communication mechanism is proposed to provide efficient communication between 6LoWPAN and external nodes. In this mechanism, the gateway between 6LoWPAN and external networks serves as the proxy gateway between nodes. The simulation was conducted using QualNet to compare the performance of the proposed mechanism and the existing RFC 4944 method. The comparative analysis of the proposed mechanism and the existing method showed that the proposed method performed better.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.4
• /
• pp.593-603
• /
• 2020

The advent of malicious code has increased exponentially due to the spread of malicious code generation tools in accordance with the development of the network, but there is a limit to the response through existing malicious code detection methods. According to this situation, a machine learning-based malicious code detection method is evolving, and in this paper, the feature of data is extracted from the PE header for machine-learning-based malicious code detection, and then it is used to automate the malware through autoencoder. Research on how to extract the indicated features and feature importance. In this paper, 549 features composed of information such as DLL/API that can be identified from PE files that are commonly used in malware analysis are extracted, and autoencoder is used through the extracted features to improve the performance of malware detection in machine learning. It was proved to be successful in providing excellent accuracy and reducing the processing time by 2 times by effectively extracting the features of the data by compressively storing the data. The test results have been shown to be useful for classifying malware groups, and in the future, a classifier such as SVM will be introduced to continue research for more accurate malware detection.