• Journal of the Korea Society of Computer and Information
• /
• v.8 no.3
• /
• pp.47-52
• /
• 2003

In this paper. a new wavelet packet image coder is proposed for images that include many high-frequency components using the relation between subbands. The new algorithm presents parent-child relationship for reducing image reconstruction error using relations between individual frequency subbands. By parent-child relationship, every coefficient is partitioned and encoded for the zerotree structure. It demonstrates higher PSNR under the same bit rate. These results show that the encoding process of the proposed coder is more accurate than the conventional ones for images that include many high-frequency elements.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.8-15
• /
• 2001

This paper remarks IETF based requirements for IP/UDP/RTP header compression issued in 3GPP2 All IP Ad Hoc Meeting and protocol stacks of the next generation mobile station. All IP Network, for real time application such as Voice over IP (VoIP) multimedia services based on 3GPP2 3G cdma2000. Frames for various protocols expected in the All IP network Mobile Station (MS) are explained with several figures including the bit-for-bit notation of header format based on IETF draft of Robust Header Compression Working Group (ROHC). Especially, this paper includes problems of IS-707 Radio Link Protocol (RLP) for header compression which will be expected to modify in All IP network MS's medium access layer to accommodate real time packet data service[1]. And also, since PPP has also many problems in header compression and mobility aspects in MS protocol stacks for 3G cdma2000 packet data network based on Mobile IP (PN-4286)[2], we introduce the problem of solution for header compression of PPP. Finally. we suggest the guidelines for All IP network MS header compression about expected protocol stacks, radio resource efficiency and performance.

• 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%.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1621-1624
• /
• 2000

양방향 TCP 연결에서는 ack compression 에 의하여 성능이 저하된다. 이를 해소하기 위한 여러 연구가 진행되고 있으나, TCP 및 인터넷의 사용환경이 워낙 다양하여 뚜렷한 해결책은 없는 상태이다. 특히 TCP의 종류 및 링크의 속도에 따른 ack compression에 의한 성능 저하는 다룰 수밖에 없다. 본 논문에서는 ns-2(network simulator 2)라는 툴(tool)을 사용하여 망의 성능을 측정한 결과로, 우선단방향과 양방향의 TCP 연결한 망의 성능을 망의 속도별, TCP 종류별로 비교한 후 ack compression을 적절히 처리하는 방법을 제안하고 제안한 방법에 관한 성능을 또한 망의 속도별, TCP 종류별로 비교하였다.

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

Header compression scheme is suggested as a solution to reduce the inefficient overhead of general packet stream data. Especially, it is shown that there are more overhead rate for real-time media stream links such as voice because of its short payload size, and it is possible to get higher bandwidth efficiency using the header compression scheme. There are two kinds of error recovery in header compression such as Periodic Header Refresh(PHR) and Header Request(HR) schemes. In this paper, we analyze the performance of these two compression recovery schemes, and some results such as the overhead rate, bandwidth gain and bandwidth efficiency(BE) are presented.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.4
• /
• pp.1-8
• /
• 2000

A defect of decrease in TCP throughput can be investigated in asymmetric environment of different uplink and downlink bandwidths. Under two-way TCP traffic, the total link utilization is decreased by the successive injection of data packets in buffer. To solve these problems, terminal ACK filtering and packet scheduling mechanisms are introduced in this paper. ACK filtering eliminates the buffered ACK packets and transmits recent ACK packets in the uplink with limited bandwidth. Packet scheduling is the method of preventing 'clustering' and 'ack compression' states which are generated in the two-way TCP traffic. The guarantee of the data traffic in reverse TCP connection and the high throughput in forward TCP connection are investigated by simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.187-198
• /
• 2005

In this paper, we propose the enhanced header compression scheme for the efficient data traffic transmission in Ipv6 networks. The bandwidth of wireless links and IP networks will probably be limited due to properties of the physical medium and regulatory limits on the use of frequencies for radio communications. That is major cause of user throughput reduction. Therefore, We discuss the IPHC(RFC2507) and ROHC(RFC3095) scheme. IPHC is simple header compression scheme and ROHC is enhanced header compression that have fast optimal recovery scheme. We have studied the enhanced header compression scheme in ROHC. We will show that indication of compression context values preventing from packet losses can provide the fast recovery of compression state. Computer simulations show that the proposed scheme has better performance than the previous one.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.57-64
• /
• 2009

In order to efficiently provide IP based Wireless Broadband services in Mobile WiMAX, schemes for more efficiently utilizing a limited bandwidth in radio links are needed. Robust Header Compression (ROHC), a standard header compression scheme proposed by IETF, Bi-directional Optimistic (O) mode provides higher compression efficiency and robustness compared with Payload Header Suppression (PHS) which is an optional header compression scheme for mobile WiMAX [1, 2]. However, if consecutive packet losses occur because of a Shadow Region of Mobile WiMAX or bit errors, header decompression failure rate of the ROHC O mode increases due to inconsistency of the compression information between the Compressor and the Decompressor. Therefore, a complementary mechanism is needed. In this paper, we propose an approach for the dynamic adjustment of an optimistic parameter, which has an effect on both the compression efficiency and the robustness, for improving the performance of ROHC O mode. We also analyze the performance of the proposed approach using an OPNET simulator.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.76-87
• /
• 2005

In this paper, we propose a new profile, ROHC(RObust Header Compression) profile 7, for SCTP with ROHC for applying robust header compression SCTP, which is a transport layer protocol. The proposed new profile 7 adds a new field of 1 or 2 byte size on the existing SCTP packet header, which can make the SCTP stream to be diveded into acknowledgement stream and data stream. In addition, the classification of the stream can be used for recovering fault context. Consequently, in the case of using proposed ROHC-SCTP, it is possible to reduce the SCTP header overhead rate and also can be saved bandwidth.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.3
• /
• pp.171-190
• /
• 2008

With growing applications of wireless video streaming, an efficient video traffic model featuring modern high-compression techniques is more desirable than ever, because the wireless channel bandwidths are ever limited and time-varying. We propose a modeling and analysis method for video traffic by a class of stochastic processes, which we call '$GEO^Y/G/{\infty}$ input processes'. We model video traffic by $GEO^Y/G/{\infty}$ input process with gamma-distributed batch sizes Y and Weibull-like autocorrelation function. Using four real-encoded, full-length video traces including action movies, a drama, and an animation, we evaluate our modeling performance against existing model, transformed-M/G/${\infty}$ input process, which is one of most recently proposed video modeling methods in the literature. Our proposed $GEO^Y/G/{\infty}$ model is observed to consistently provide conservative performance predictions, in terms of packet loss ratio, within acceptable error at various traffic loads of interest in practical multimedia streaming systems, while the existing transformed-M/G/${\infty}$ fails. For real-time implementation of our model, we analyze G/D/1/K queueing systems with $GEO^Y/G/{\infty}$ input process to upper estimate the packet loss probabilities.