This paper investigates Layered networkcoding (LNC) and hierarchical network coding (RNC) for Peer-to, Peer live multimedia streaming. By combining the hierarchy of layered source coding with random networkcoding, w...
详细信息
ISBN:
(纸本)9780769536149
This paper investigates Layered networkcoding (LNC) and hierarchical network coding (RNC) for Peer-to, Peer live multimedia streaming. By combining the hierarchy of layered source coding with random networkcoding, we implement both LNC and HNC according to the importance order of encoded source layers. At the playback deadline, if currently received data are not enough to recover the original data completely, the most important layers can be recovered to maintain the smooth playback. A tuning scheme for the generating probabilities in HNC is also proposed, which takes into account both the priority and the length of each layer. Simulation results show that both LNC and HNC can recover the important layers earlier than the general networkcoding.
networkcoding (NC) has been exploited to minimize delay, energy per bit and to maximize throughput over lossy networks. However, applying networkcoding for scalable video transmission over packet-lossy networks is s...
详细信息
ISBN:
(纸本)9786163618238
networkcoding (NC) has been exploited to minimize delay, energy per bit and to maximize throughput over lossy networks. However, applying networkcoding for scalable video transmission over packet-lossy networks is still an active research topic because of the challenge in trading off between rank deficiency problem and scalability of the video bitstream. Scalable video coding promises providing flexible broadcasting to heterogeneous user equipments, but the rank deficiency problem in NC limits the scalable capability in video streaming since the time of waiting for full rank causes long delay. In this paper, we exploit the combination of hierarchical and random linear networkcoding for solving the above issue. The hierarchical network coding provides unequal erasure protection for scalable layers and addresses the process of decoding layer by layer according to importance. Otherwise, random linear networkcoding provides error-correcting capability and makes the scheme resilient to packet loss. Our proposed networkcoding scheme benefits from these two schemes for multicast scalable video streaming. The simulation results and performance analysis are provided to evaluate the efficiency in terms of averaged decoding probability and peak signal-to-noise ratio. The proposed scheme achieves same performance of random linear networkcoding in good channel and approximately hierarchical network coding scheme in bad channel.
Recently, networkcoding and channel coding are widely applied for scalable video coding in order to achieve the reliable transmission of multimedia data. networkcoding as hierarchical network coding (HNC) provides u...
详细信息
ISBN:
(纸本)9781479967865
Recently, networkcoding and channel coding are widely applied for scalable video coding in order to achieve the reliable transmission of multimedia data. networkcoding as hierarchical network coding (HNC) provides unequal erasure protection for scalable layers and addresses the process of decoding layer by layer from higher to less importance. Similar with that scheme, expanding window fountain (EWF) code is designed for flexible and efficient solution of real-time scalable video multicast. In this paper, we investigate the performance of EWF coding and HNC for scalable video coding over lossy packet networks. The experimental results show that EWF coding achieves better performance than HNC in both good and bad channels.
Random linear networkcoding simplifies routing decisions, improves throughput, and increases tolerance against packet loss. A substantial limitation, however, is delay: decoding requires as many independent linear co...
详细信息
ISBN:
(纸本)9781509020546
Random linear networkcoding simplifies routing decisions, improves throughput, and increases tolerance against packet loss. A substantial limitation, however, is delay: decoding requires as many independent linear combinations as data blocks. hierarchical network coding purportedly solves this delay problem. It introduces layers to decode prioritized data blocks early, which may benefit video streaming applications or applications for sensor information collection. While hierarchical network coding reduces decoding delays, it introduces significant space complexity and additional decoding time. We propose a decoding algorithm that manages all prioritization layers in a joint decoder matrix. Analytical evaluation and performance measurements show that we maintain prioritization benefits without increased space complexity and improve decoding performance. With memory requirements independent of the number of layers, our algorithm facilitates more fine-grained prioritization layers to further the benefits of hierarchical network coding.
In this paper, we address the problem of asymmetric data rates in two-way communication systems. In particular, we propose an adaptive transmission scheme that combines networkcoding (NC) and opportunistic user selec...
详细信息
In this paper, we address the problem of asymmetric data rates in two-way communication systems. In particular, we propose an adaptive transmission scheme that combines networkcoding (NC) and opportunistic user selection (OUS) with a threshold that determines which transmission mode to use. The underlying system model comprises two source nodes communicating with each other through a relay node. The source nodes are assumed to have different data rate requirements;therefore, they employ different modulation schemes. As per the proposed scheme, if the end-to-end (E2E) signal-to-noise ratio (SNR) of both users are above a specified threshold, both sources transmit over orthogonal channels, and the relay node uses hierarchical modulation and NC to relay the combined signals to both sources in the third time slot. Otherwise, the user with the better E2E SNR transmits, whereas the other user remains silent. The advantage of the proposed scheme is that it compromises between throughput and reliability. That is, when both users transmit, the throughput improves, whereas when the better user transmits, multiuser diversity is achieved. Assuming asymmetric channels, we derive exact closed-form expressions for the E2E bit error rate (BER), access probability, and throughput for this scheme and compare its performance with existing schemes. We also investigate the asymptotic performance of the proposed scheme at high SNRs where we derive the achievable diversity order for both users. We show through analytical and simulation results that the proposed scheme improves the overall system throughput, the fairness between the two users, and the transmission reliability. This all comes while achieving full spatial diversity for both users.
暂无评论