• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.317-324
• /
• 2012

Physical layer network coding (PNC) was first introduce by Zhang et al. for two-way relay channels (TWRCs). By utilizing the PNC, we can complete two-way communications within two time slots, instead of three time slots required in non-PNC systems. Recently, the upper and lower bounds for a bit error rate (BER) of PNC have been analyzed for fading channels. In this paper, we derive an exact BER of the PNC for the TWRC over fading channels. We determine decision regions based on the nearest neighbor rule and partition them into several wedge areas to apply the Craig's polar coordinate form for computing the BER. We confirm that our derived analysis accurately matches with the simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.700-706
• /
• 2013

In this paper, we propose a method for applying random linear network coding in satellite communication to improve reliability. In the proposed protocol, network-coded redundancy (NC-R) packets are transmitted in the PEP (Performance Enhancement Proxy). Therefore, if data packets is lost by wireless channel error, they can be recovered by NC-R packets. We also develop the TCP performance model of the proposed protocol and evaluate the performance of the proposed protocol. In the simulation results, It is shown that the proposed protocol can improve the TCP throughput as compared with that of the conventional TCP because the NC-R packets is sent by the sender-side PEP and the receiver-side PEP use these packets to recover the lost packets, resulting in reducing the packet loss in TCP.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.5
• /
• pp.260-270
• /
• 2007

Owing to the improved wireless communication technologies, it is possible to provide streaming service of multimedia with PDAs and mobile phones in addition to desktop PCs. Since mobile client devices have low computing power and low network bandwidth due to wireless network, the transcoding technology to adapt media for mobile client devices considering their characteristics is necessary. However, since mobile clients use wireless network and the wireless network have less stable bandwidth according to distance from AP and environments, it is hard to support stable QoS to mobile clients. In this paper, we propose a dynamic bit rate control method for transcoding in order to supprot stable QoS of streaming media service to mobile clients via wireless network. The proposed method is shown to serve seamless streaming media service with adaptive bit rate control according to state of wireless network in real time and to reduce transmission failure from experiment.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.2091-2092
• /
• 2006

본 논문은 소프트웨어 공정에 대하여 유전자 알고리즘의 기호코딩을 이용한 정보입자 기반 퍼지 다항식 뉴럴 네트워크 (Information Granules based genetic Fuzzy Polynomial Neural Networks ;IG based gFPNN)의 모델 설계를 제안한다. 기존 퍼지 다항식 뉴럴네트워크의 구조 최적화를 위해 이진코딩을 사용하였다. 그러나 이진코딩에서 스트링의 길이가 길면 길수록 인접한 두 수 사이에 발생하는 급격한 비트 차이라는 해밍 절벽이 발생하였다. 이에 제안된 모델에서는 해밍절벽의 문제를 해결하기 위해 기호코딩을 사용하였다. 제안된 모델의 전반부 구조와 후반부 구조는 기존 모델에 구성을 그대로 사용한다. 실험적 예제를 통하여 제안된 모델의 근사화 능력과 일반화 능력이 우수함을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.5
• /
• pp.999-1008
• /
• 2017

In this paper, we propose a pipeline network coding (PNC) scheme for efficient data transmission in wireless networks, a data authentication scheme for verifying the integrity of data, and a node authentication scheme for a virtual source. PNC is a technique that improves the overall network performance by relaying data such that the relay node performing network coding transmits to the sender instead. However, network coding is vulnerable to a pollution attack, which is an attack by a malicious attacker to inject modified data into the network. To prevent this, hash-based message authentication code (HMAC) is used. For this purpose, in order to generate a tag used for data authentication, a key must be distributed to the nodes performing authentication. We applied a hash chain to minimize the overhead of key distribution. A null vector is used as the authentication scheme for the virtual source. Finally, we analyze the safety and complexity of the proposed scheme and show he performance through simulation.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.251-255
• /
• 2009

Network coding is a promising technology that increases the system throughput via reducing the number of transmission for a packet delivered from the source node to the destination node. Nevertheless, it suffers from the metrics of end-to-end delay. Network Coding scheme takes more processing delay which occurs as coding node encodes (XOR) a certain number of packets that relayed by the coding node, and more queuing delay which occurs as a packet waits for other packets to be encoded with. Therefore, in this paper, we analyze the dependency of the queuing delay to the arrival rate of each packet. In addition, we analyze and compare the delay in DCF without XOR and DCF with XOR under dynamic traffic.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.54-56
• /
• 2013

A subcarrier allocation scheme for base station (BS), relay station (RS) and mobile station (MS) can affect the performance of orthogonal frequency division multiple access (OFDMA) relay systems. In this paper, we propose a subcarrier allocation scheme with inter-cell interference and network coding in OFDMA relay systems. In the network coding zone, we consider an environment where RS can transmit a frame to BS and MS simultaneously. We divide an OFDMA frame into downlink zone, uplink zone, and network coding zone. The proposed scheme allocates subcarriers to BS, RS, and MS for each zone with consideration of inter-cell interference in OFDMA relay systems. We evaluate the performance of the proposed subcarrier allocation scheme through simulation.

• Electronics and Telecommunications Trends
• /
• v.19 no.6 s.90
• /
• pp.83-92
• /
• 2004

정보통신 기술은 음성, 데이터, 영상, 멀티미디어 등 모든 형태의 정보를 디지털화가 가능하도록 발전하였고, 이를 기반으로 다양한 멀티미디어 서비스가 각종의 네트워크 및 단말기를 통하여 사용자에게 제공되고 있다. 그러나 현재에는 네트워크 및 단말기 특성에 맞추어 개별적인 콘텐츠를 각각 구축하여 제공하고 있기 때문에 시스템 구축 및 관리상에 부하가 많은 실정이다. 특히 컴퓨터, 통신, 방송 등 모든 정보통신 분야가 하나의 네트워크에 연결되는 광대역통합망 기반의 네트워크 사회로 빠르게 진화되는 상황에서 단일 콘텐츠로 네트워크 및 단말기 특성에 제역을 받지 않고 다양한 멀티미디어 서비스(multi-use)를 제공할 수 있는 멀티미디어 트랜스코딩 기술은 매우 중요하다. 본 고에서는 누구나 언제 어디서나 원하는 멀티미디어 서비스를 네트워크 및 단말기에 제약을 받지 않고 끊김없이 편리하게 이용할 수 있도록하기 위한 멀티미디어 트랜스코딩 기술 동향에 관하여 기술하고자 한다.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.1
• /
• pp.86-94
• /
• 2013

In this paper, we propose a network coding scheme that is one of the most promising techniques for overcoming transmission errors in underwater acoustic communications. It is assumed that the proposed scheme operates in a Code Division Multiple Access (CDMA) network where multiple sensor nodes share the underwater acoustic channel in both the frequency and the time domains by means of orthogonal codes. The network topology deploys multi-hop transmission with relaying between multiple source nodes and one destination node via multiple relay nodes. The proposed scheme is evaluated in terms of the successful packet delivery ratio of end-to-end transactions under varying packet loss rates. A computer simulation shows that the successful delivery ratio is maintained at over 95% even when the packet loss rate reaches 50%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2372-2380
• /
• 2015

In this paper, we propose frequency allocation and path selection scheme in underlay cognitive radio (CR) networks using network coding. In the proposed scheme, we choose the path with consideration of network coding and interference temperature in underlay CR networks and propose an optimization problem to maximize the system throughput of secondary users (SUs). Then, we represent the proposed optimization problem as the multi-dimensional multiple-choice knapsack problem and give the theoretical upper bound for the system throughput of SUs by using linear programming. Finally, we compute the system throughput of SUs by using brute-force search (BFS) and link quality first (LQF) scheme in underlay CR networks. Simulation results show that the system throughput of SUs with BFS is higher than that with LQF in underlay CR networks with and without application of network coding, respectively.