Journal Article10.1109/LCOMM.2013.091113.131361
Decoding Probability in Random Linear Network Coding with Packet Losses
30
TL;DR: This study focuses on a network where n sources send data to k destinations, through m≥ n relay nodes employing random linear network coding, and highlights the fact that the network coding scheme behaves as an erasure correcting code, whose erasure corrected capability is determined by the number of available relays.
read more
Abstract: We focus on a network where n sources send data to k destinations, through m≥ n relay nodes employing random linear network coding. The coefficients used to encode the data packets are extracted from a Galois field of size q. Unlike previous work, we consider that the relay nodes may not receive some packets due to link failures. This implies that a destination may be unable to successfully decode the received data packets due to both missing packets at the relays and linearly dependent coefficient vectors. In this scenario, we compute the exact probability of successful decoding at a destination node and we show the impact of the system parameters on the performance. In particular, our study highlights the fact that the network coding scheme behaves as an erasure correcting code, whose erasure correcting capability is determined by the number of available relays.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Tutorial on Network Coded Cooperation
TL;DR: This tutorial provides an overview of the state-of-the-art in the NCC systems, combining the powerful tools of NC and cooperative communication, in order to increase data transmission rates and robustness of multiple source wireless networks.
45
Network-Coding Approach for Information-Centric Networking
Muhammad Bilal,Shin-Gak Kang +1 more
TL;DR: A solvable linear network-coding scheme for the Information-centric-networking architecture improves the performance of the CCN and significantly reduces the network traffic and average download delay.
Bounds on Decoding Failure Probability in Linear Network Coding Schemes with Erasure Channels
TL;DR: Upper and lower bounds on the decoding failure probability in which a network code matrix does not have full rank in the dynamic network connections are derived.
19
Packet loss probability in wireless networks: A survey
Dhwani R. Bhadra,Charmi A. Joshi,Priya R. Soni,Nikita P. Vyas,Rutvij H. Jhaveri +4 more
- 02 Apr 2015
TL;DR: It is come to the point that some security mechanisms must be conceptualized specially in MANET to reduce the effect of packet loss probability, especially where there is no centralization.
14
A new fast polling algorithm in wireless mesh network for narrowband Internet of Things
TL;DR: A comparative study of existing polling cycle mechanisms is provided and it is found that the new fast polling algorithm significantly outperforms previously proposed polling-cycle mechanisms with improvements typically exceeding 70%.
13
References
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
9.3K
A Random Linear Network Coding Approach to Multicast
TL;DR: This work presents a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks, and shows that this approach can take advantage of redundant network capacity for improved success probability and robustness.
Exact Decoding Probability Under Random Linear Network Coding
TL;DR: This letter compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q.
Design of Network Codes for Multiple-User Multiple-Relay Wireless Networks
TL;DR: For networks with orthogonal channels, it is shown that network codes based on maximum distance separable (MDS) codes can achieve the maximum diversity order of N+1, which is equivalent to achieving the Singleton bound for network error-correction codes.
115
On the Bit Error Probability of Noisy Channel Networks With Intermediate Node Encoding
Ming Xiao,Tor Aulin +1 more
TL;DR: This work investigates the calculation approach of the sink bit error probability (BEP) for a network with intermediate node encoding, and proposes a subgraph decomposition approach that can significantly reduce computational complexity and approximate the exact results.
18