• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.674-676
• /
• 2000

인터넷과 같은 이질적인 네트워크환경에서 대용량의 비디오 데이터를 실시간으로 전송하기 위해서 계층적 코딩기법에 관한 연구가 진행되고 있으며, MPEG-2 비디오에서도 Scalability를 제공하고 있다. 하지만 이러한 계층적 코딩기법을 사용한다 하더라도 기본계층의 데이터량이 크기 때문에 실시간 서비스를 위해서는 상당량의 네트워크 자원을 필요로 하게 된다. 이에 네트워크 대여폭 변화에 능동적으로 적응하면서 네트워크 자원을 보다 효율적으로 사용할 수 있는 새로운 계층적 코딩기법과 전송 기법을 제안한다. 제안된 기법은 MPEG 비디오를 픽처층을 이용하여 공간적 계층적 코딩 후 다시 DCT블록에 대한 공간적 계층적 코딩을 수행하여 15개의 레이어로 분할하게 된다. 이렇게 분할된 레이어는 네트워크의 상태에 따라 선별적으로 전송되게 된다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.10
• /
• pp.2281-2287
• /
• 2013

Network Coding(NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. Network Coding has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Prior researches have been carried out to employ network coding to wireless ad-hoc network. In our study, intermediate nodes identify one-hop bidirectional flows for network coding decision. We expect that the proposed scheme shall improve decoding success rate of network coded packet. From the simulation, the proposed network coding scheme achieved better performance in terms of coding gain and packet delivery rate than traditional network coding scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.261-262
• /
• 2014

네트워크 코딩 가능한 멀티 홉 무선 망에서 코딩 의식 라우팅 (Coding-Aware routing) 기법은 코딩 가능성을 확보하고 코딩 기회를 높여 처리율 향상이 가능하다. 코딩 기회 (coding opportunities)를 정확하게 식별 할 수 있는 방법이 주요 핵심이다. 본 논문에서는 멀티 홉 무선 네트워크에서 두 개 이상의 플로우가 여러개의 코딩 가능 노드를 통과하는 경우, 일반적인 코딩 조건(coding condition)을 제안한다. 특히, 네트워크 코딩 가능한 여러 시나리오를 분석하고, 목적지에서 디코딩을 보장하는 코딩 조건을 제안한다.

• The KIPS Transactions:PartC
• /
• v.19C no.4
• /
• pp.247-252
• /
• 2012

Network coding has been shown to improve various performance metrics in network systems. However, if network coding is implemented as software a huge time delay may be incurred at encoding/decoding stage so it is imperative for network coding to be parallelized to reduce time delay when encoding/decoding. In this paper, we compare the performance of parallelized decoders for random linear network coding (RLC) and pipeline network coding (PNC), a recent development in order to alleviate problems of RLC. We also compare multi-threaded algorithms on multi-core CPUs and massively parallelized algorithms on GPGPU for PNC/RLC.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.186-191
• /
• 2014

Previous work only focuses on a maximization of network coding opportunity since it can reduce the number of packets in network system. However, it can make congestion in a relay node as each source node may transmit each packet with the maximum transmission rate based on the channel qualities. Therefore, in this paper, we propose CmNC (Congestion minimized Network Coding over unreliable wireless links) performing opportunistic network coding to guarantee the network coding gain with the consideration of the congestion and channel qualities. The relay node selects the best network code set based on the objective function for reducing the packet loss and congestion via a dynamic programming. With Qualnet simulations, we show CmNC is better up to 20% than the previous work.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.909-912
• /
• 2008

무선 네트워크의 발달로 인해 이동 사용자가 급증함에 따라 무선 네트워크 환경에서도 질 높은 미디어 스트리밍 서비스를 받기 위한 수요가 증가하고 있다. 그러나 무선 네트워크는 유선 네트워크보다 상대적으로 좁은 네트워크 대역폭을 가진다. 또한 유선 네트워크 환경의 단말기에 비해 제한된 시스템 자원을 가지므로 유선 네트워크 환경의 사용자를 위한 고화질 미디어 데이터를 그대로 스트리밍 서비스 받기에 적합하지 않다. 최근 이러한 문제를 해결하기 위한 방법으로 미디어 트랜스코딩 서비스가 활발하게 연구되고 있다. 다수의 트랜스코딩 서버로 구성된 분산 트랜스코딩 시스템에서 특정 서버로 트랜스코딩 작업이 집중될 경우 사용자에게 질 높은 수준의 미디어 스트리밍 서비스를 제공하기 어렵다. 때문에 각 트랜스코딩 서버간의 균형적인 부하 분산이 중요한 문제가 되며, 처리되는 미디어 데이터의 특성을 부하 분산에 반영할 필요가 있다. 본 논문에서는 MPEG-2 미디어 데이터의 트랜스코딩 과정을 분석함으로써 비트율 변경에 따른 트랜스코딩 작업 시간 예측 기법을 제안한다. 제안된 기법은 트랜스코딩 서버 정보와 영화 정보, 목적 트랜스코딩 비트율을 이용하여 예상 트랜스코딩 시간을 예측한다.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.95-107
• /
• 2012

Network coding was proposed to increase the achievable throughput of multicast in a network. Recently, combining network coding into user cooperation has attracted research attention. For cooperative transmission schemes with network coding, users combine their own and their partners messages by network coding. In previous works, it was shown that adaptive DF with network coding can achieve diversity gain and additional throughput gain. In this paper, to improve performance of conventional protocols and maximize advantage of using network coding, we propose a new network coding based user cooperation scheme which uses adaptively amplify-and-forward and decode-and-forward according to interuser channel status. We derive outage probability bound of proposed scheme and prove that it has full diversity order in the high SNR regime. Moreover, based on the outage bound, we compute optimal power allocation for the proposed scheme.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.3
• /
• pp.491-497
• /
• 2012

Network coding is that the nodes can combine and mix the packets rather than merely forward them. Therefore, network coding is expected to improve throughput and channel efficiency in the wireless network. Relevant researches have been carried out to adapt network coding to wireless multi-hop network. In this paper, we designed the network coding for bidirectional traffic service in routing layer and IP layer of Ad-hoc network. From the simulation result, the traffic load and the end to end distance effect the performance of the network coding. As end to end distance and the traffic load become larger, the gain of network coding become more increased.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.130-137
• /
• 2015

With the rapid increase of energy consumption and environmental problems, the need for green techniques is increasing. Network coding can provide a solution by reducing unnecessary data transmission and by estimating traffic patterns. In addition, it can amplify the synergy with the cognitive radio network (CR) since the CR has recognition and optimal decision functionalities. In this paper, we propose a network coding based green cognitive radio network. With the simulations, we show that the proposed scheme is up to 25% better than the previous work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.612-622
• /
• 2013

In this paper, we propose a coding packet group-based ARQ scheme (rNC) for file delivery in wireless networks. rNC assumes multiple network coding points between the source and the destination. Each network coding point gathers and codes a group of packets according to the queue polling system. A queue polling system makes a few or several packets available for coding in a queue while polling the other queues in the system. Thus, we assuem a queue polling system at each network coding point. We call this group of packets as coded packet group. Each coding point acknowledges the reception of every code packet group to its previous coding point for reliable delivery. Thus, the intermediate coding points including the source can release its buffer before the packet is delivered to the destination. To guarantee the ultimate file delivery to the destination, the destination sends acknowledgement to the sender. We evaluate our proposed scheme using ns-2 and compare the performance with CodeCast. The results show that rNC works better than CodeCast in terms of packet delivery ratio and control overhead in unreliable wireless networks.