In this paper, we propose a low complexity algorithm for decoding where network coding is deployed in client-server networks. We consider battery powered clients, so that minimizing their power consumptions is essenti...
详细信息
ISBN:
(纸本)9781467399913
In this paper, we propose a low complexity algorithm for decoding where network coding is deployed in client-server networks. We consider battery powered clients, so that minimizing their power consumptions is essential. Our focus is thus on developing a decoding algorithm that can reduce the computational complexity. Unlike general decoding algorithms that are based on Gaussian elimination, we propose a decoding algorithm based on the singular value decomposition, as it enables to easily compute an inverse matrix, leading to lower decoding complexity. Our simulation results confirm that proposed algorithm can reduce not only the decoding complexity but also the overall network complexity. While the network efficiency of the proposed strategy is degraded as the network dimension increases, we show that the efficiency converges into a lower bound as the network dimension increases. These are confirmed by the simulation results.
This paper investigates the linear network coding map in a Physical-layer network coding (PNC) operated two-way relay network. To realize the full potential of Physical-layer network coding in high SNR regimes, we nee...
详细信息
ISBN:
(纸本)9781467398145
This paper investigates the linear network coding map in a Physical-layer network coding (PNC) operated two-way relay network. To realize the full potential of Physical-layer network coding in high SNR regimes, we need to use high-order signaling beyond BPSK/QPSK. In a PNC system with high-order signaling, we can have many different choices for the network coding (NC) map. For linear network coding, the network-coding map is realized by coefficients corresponding to the weights of the linearly-combined network-coded message. Prior work on channel-coded linear PNC adopted the same network-coding coefficients as in non-channel-coded linear PNC. We find that the optimal coefficients for such uncoded systems are far from optimal for coded systems. We also show that the coefficients that maximize the computation rate in the "compute-and-forward" framework, which adopts nested lattice codes, are near optimal for linear PNC that adopts the LDPC codes.
This paper considers a class of wireline networks, derived from the well-known butterfly network, over which two independent unicast sessions take place simultaneously. The main objectives are to understand when netwo...
详细信息
ISBN:
(纸本)9781509024827
This paper considers a class of wireline networks, derived from the well-known butterfly network, over which two independent unicast sessions take place simultaneously. The main objectives are to understand when network coding type of operations are beneficial with and without security considerations and to derive the gains that cooperation among sources and sinks can bring. Towards these goals, the capacity region of the butterfly network with arbitrary edge capacities is first derived. It is then shown that no rate can be guaranteed over this network under security considerations, when an eavesdropper wiretaps any one link. Four variations of the butterfly network, such as the case of co-located sources, are analyzed and their secure and non-secure capacity regions are characterized.
In traditional automatic retransmission request (ARQ) based wireless broadcasting (WBC) systems, one lost packet is retransmitted per slot to guarantee the correct reception of each packet, which leads to low spectrum...
详细信息
ISBN:
(纸本)9781509016983
In traditional automatic retransmission request (ARQ) based wireless broadcasting (WBC) systems, one lost packet is retransmitted per slot to guarantee the correct reception of each packet, which leads to low spectrum efficiency. In this paper, we propose an Ave-Max-Min network coding (NC) based WBC protocol. Specifically, to reduce the overall number of retransmissions, lost packets of different user equipments (UEs) are combined by performing Ave-Max-Min NC at the base station. Then, NC combined packets are broadcasted to all the UEs. At each UE, lost packets can be recovered by using the proposed joint network recursive systematic convolution (RSC) decoder (JNRD). Theoretical analyses and simulation results show that the proposed Ave-Max-Min NC based WBC protocol outperforms traditional NC based WBC protocol on the average number of transmissions performance.
In this paper, we propose two novel physical layer aware adaptive network coding schemes for time variant channels, one aiming to maximize the energy efficiency, the other exploiting also the variable modulation order...
详细信息
ISBN:
(纸本)9781509016822
In this paper, we propose two novel physical layer aware adaptive network coding schemes for time variant channels, one aiming to maximize the energy efficiency, the other exploiting also the variable modulation order, in an adaptive way. The proposed schemes have been applied to different satellite communications scenarios with different Round Trip Times (RTT). Compared to adaptive network coding, and classical non-adaptive network coding schemes for time variant channels, used as benchmarks, the proposed schemes demonstrate that adaptation of packet transmission based on the channel variation and corresponding erasures allows for significant gains in terms of throughput, delay and energy efficiency. We shed light on the trade-off between energy efficiency and delay-throughput gains, demonstrating that conservative adaptive approaches that favor less transmission under high erasures, might cause higher delay and less throughput gains in comparison to non-conservative approaches that favor more transmission to account for high erasures.
network coding has been introduced as a new paradigm for network routing protocols in recent years. The wide range of advantages of network coding, such as energy saving, throughput improvement and congestion mitigati...
详细信息
ISBN:
(纸本)9781479966646
network coding has been introduced as a new paradigm for network routing protocols in recent years. The wide range of advantages of network coding, such as energy saving, throughput improvement and congestion mitigation, have been demonstrated in many practical systems. However, the nature of packet mixing, optimization of forwarding nodes selection cause the network coding based routing protocols vulnerable to routing attacks. In this paper, we conduct a detailed analysis of various security threats that attack on different components of intra-flow network coding based routing schemes, and provide an extensive simulation study of their impacts on the network performance. An adequate understanding of both threats and vulnerabilities of current network coding systems are essential to effectively design of defense mechanism. This paper is served as a preliminary guide in the effort of achieving security for network coding based wireless routing.
network coding (NC) is a promising approach to efficiently enhance the robustness and recovery capacity in the Underwater acoustic sensor network (UWASN). However, the undesired transmission redundancy and additional ...
详细信息
ISBN:
(纸本)9781509023967
network coding (NC) is a promising approach to efficiently enhance the robustness and recovery capacity in the Underwater acoustic sensor network (UWASN). However, the undesired transmission redundancy and additional resource limit the further development for NC with applications to the UWASN. Based on the analysis of intermediate nodes, a new approach called encoding anticipation mechanism for network coding (EANC) is proposed, by making network nodes adjust adaptively operation of NC on-off with its transmission capability (i.e. the tradeoff between the utility of packet innovativeness and communication capabilities with neighbor nodes). The simulation results demonstrate that this proposed method effectively reduces unnecessary coding operation and the expense of overall packet overhead, while realizing the transmission validity and reliability if specific node is set to be NC node. These merits make the EANC mechanism helpful in presenting better adaptability to the UWASN.
Mobile ad-hoc network is a collection of mobile nodes which forms an instant network without fixed topology and can be arranged dynamically. Energy saving and security are important issue in MANET. network coding tech...
详细信息
ISBN:
(纸本)9781467393379
Mobile ad-hoc network is a collection of mobile nodes which forms an instant network without fixed topology and can be arranged dynamically. Energy saving and security are important issue in MANET. network coding technique is used to reduce energy consumption by less transmissions in MANET. To achieve a security, there are many encryption scheme are available. Out of which p-coding technique is lightweight encryption scheme which provides confidentiality. P-coding is to let the source randomly permute the symbol of each packet. So eavesdropper can't obtain the meaningful information without knowing the permutation encryption function and coding vector.
Over the last decade, the emergence of new multimedia devices has motivated the research on efficient media streaming mechanisms that can adapt to dynamic network conditions and heterogeneous devices' capabilities...
详细信息
ISBN:
(纸本)9781509053162
Over the last decade, the emergence of new multimedia devices has motivated the research on efficient media streaming mechanisms that can adapt to dynamic network conditions and heterogeneous devices' capabilities. network coding (NC) as a rateless code has been applied to collaborative media streaming applications and brings substantial improvements regarding throughput and delay in collaborative media streaming applications. However, little attention has been given to the recoverability of encoded data, especially for the streaming with a strict deadline. When a receiver obtains insufficient packets, it is impossible for receivers to recover any original packets. This in turn leads to severe quality of experience. In this paper, we solve the unrecoverable transmission by determining a scalable layer subscription and scheduling strategy. This scalable layer subscription algorithm is treated as a video quality maximization problem in multiple generations. Then this problem is solved using a dynamic programming algorithm. Experimental results confirm that the proposed algorithm brings better data recoverability and a better quality of service in terms of better video quality, delivery ratio, lower redundancy rate, and significantly lower superfluous video packet rate under different network sizes than conventional random-push schemes.
In this paper, a distributed network coding (DNC) scheme based on improved online fountain codes is proposed for wireless sensor networks (WSNs). Specifically we propose an improved online fountain codes with the obje...
详细信息
ISBN:
(纸本)9781509039364
In this paper, a distributed network coding (DNC) scheme based on improved online fountain codes is proposed for wireless sensor networks (WSNs). Specifically we propose an improved online fountain codes with the objection of optimizing the build-up phase of the conventional online fountain codes. Then based upon this method, we develop a distributed network coding scheme for sensed data gathering over wireless sensor networks. We analyze the properties of the proposed DNC scheme and derive the upper coding overhead bound for it over binary erasure channels under belief propagation (BP) decoding. Simulation results show that the proposed DNC scheme can achieve a better performance with respect to both coding overhead and complexities.
暂无评论