• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3110-3125
• /
• 2014

Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.

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

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.525-535
• /
• 2011

In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of ${\Theta}$(nT$^3$(n)) can be achieved as a tight bound when each session contains a constant number of sinks where n is the total number of nodes and T(n) is the transmission range. Surprisingly, an identical order capacity can be achieved when nodes have only MPR and MPT capabilities. This result proves that NC does not contribute to the order capacity of multicast traffic in wireless ad hoc networks when MPR and MPT are used in the network. The result is in sharp contrast to the general belief (conjecture) that NC improves the order capacity of multicast. Furthermore, if the communication range is selected to guarantee the connectivity in the network, i.e., ${\Omega}$($\sqrt{log\;n/n}$)=T(n) = O(log log n / log n), then the combination of MPR and MPT achieves a throughput capacity of ${\Theta}$(log$^{\frac{3}{2}}$ n/$\sqrt{n}$) which provides an order capacity gain of ${\Theta}$(log$^2$ n) compared to the point-to-point multicast capacity with the same number of destinations.

• 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 the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1819-1828
• /
• 2009

Until now, much research on cooperative communications to increase system throughput at Ad Hoc networks has been provided. In this paper, in order to enhance system throughput much more at Ad Hoc networks, a network coding-enabled new MAC protocol, called NC-MAC protocol, is proposed and its performance is evaluated with a mathematical approach. Numerical results show that this scheme provides conspicuously enhanced system throughput compared to DCF scheme, and more increased system throughput by 48% than rDCF and CO-MAC schemes.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.384-395
• /
• 2008

Random network coding can be viewed as a single block code applied to all source packets. To manage the concomitant high coding complexity, source packets can be partitioned into generations; block coding is then performed on each set. To reach a better performance-complexity tradeoff, we propose a novel concatenated network code which mixes generations while retaining the desirable properties of generation-based coding. Focusing on the code's erasure performance, we show that the probability of successfully decoding a generation on erasure channels can increase substantially for any erasure rate. Using both analysis (for small networks) and simulations (for larger networks), we show how the code's parameters can be tuned to extract best performance. As a result, the probability of failing to decode a generation is reduced by nearly one order of magnitude.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.747-749
• /
• 2016

We consider a time-division multiple-access relay channel (MARC), in which two source nodes (SNs) transmit data with different data rate to a destination node (DN) with the help of a relay node (RN) using network coding (NC). However, due to its asymmetric data rate, the RN cannot combine the received bits by XOR NC. In this paper, we compare with the problem of asymmetric data rates by using zero padding and hierarchical 16QAM.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2098-2117
• /
• 2012

This paper jointly investigates the bandwidth allocation, transmission strategy and relay positions for two-way transmission aware cellular networks with network coding (NC). Our goal is to minimize the transmission power of mobile terminals (MTs). Consider a cellular system, where multiple MTs exchange information with their common base station, firstly, we propose an efficient bandwidth allocation method and then give a transmission strategy for each MT to determine whether to use relay stations (RSs) for its two-way transmission with the BS or not. To further improve the system performance, the optimal positions of RSs are also jointly discussed. A GA-based algorithm is presented to obtain the optimum positions for RSs. Besides, the impacts of frequency reuse on MT's transmission power and system spectral efficiency (SE) under different number of relays are also discussed in our work. Numerical results show that the proposed NC aware scheme can extend MTs' battery life at least 6% more than traditional method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1373-1391
• /
• 2022

We investigate mobile multiple-input multiple-output (MIMO) molecular communication via diffusion (MCvD) system which is consisted of two source nodes, two destination nodes and one relay node in the mobile three-dimensional channel. First, the combinations of decode-and-forward (DF) relaying protocol and network coding (NC) scheme are implemented at relay node. The adaptive thresholds at relay node and destination nodes can be obtained by maximum a posteriori (MAP) probability detection method. Then the mathematical expressions of the average bit error probability (BEP) of this mobile MIMO MCvD system based on DF and NC scheme are derived. Furthermore, in order to minimize the average BEP, we establish the optimization problem with optimization variables which include the ratio of the number of emitted molecules at two source nodes and the initial position of relay node. We put forward an iterative scheme based on block coordinate descent algorithm which can be used to solve the optimization problem and get optimal values of the optimization variables simultaneously. Finally, the numerical results reveal that the proposed iterative method has good convergence behavior. The average BEP performance of this system can be improved by performing the joint optimizations.