Journal Article10.1109/TVT.2008.927729
Wireless Broadcast Using Network Coding
TL;DR: Both simulations and theoretical analysis confirm the advantages of the proposed network coding schemes over the ARQ ones and derive a few theoretical results on the bandwidth efficiency.
read more
Abstract: Traditional approaches to reliably transmit information over an error-prone network employ either forward error correction (FEC) or retransmission techniques. In this paper, we propose some network coding schemes to reduce the number of broadcast transmissions from one sender to multiple receivers. The main idea is to allow the sender to combine and retransmit the lost packets in a certain way so that with one transmission, multiple receivers are able to recover their own lost packets. For comparison, we derive a few theoretical results on the bandwidth efficiency of the proposed network coding and traditional automatic repeat-request (ARQ) schemes. Both simulations and theoretical analysis confirm the advantages of the proposed network coding schemes over the ARQ ones.
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
Nature-Inspired Algorithms and Applied Optimization
Xin-She Yang
- 01 Jan 2018
TL;DR: This work intends to analyze nature-inspired algorithms both qualitatively and quantitatively, and briefly outline the links between self-organization and algorithms, and then analyze algorithms using Markov chain theory, dynamic system and other methods.
204
On Minimizing Broadcast Completion Delay for Instantly Decodable Network Coding
Sameh Sorour,Shahrokh Valaee +1 more
- 23 May 2010
TL;DR: This paper proposes a simple online selection algorithm that efficiently minimizes the mean completion delay of a frame of broadcast packets, compared to the random and greedy selection algorithms with a similar computational complexity.
158
Completion delay minimization for instantly decodable network codes
Sameh Sorour,Shahrokh Valaee +1 more
TL;DR: Simulation results show that the proposed algorithms significantly reduce the IDNC completion delay compared to the random and maximum-rate algorithms, and almost achieve the global optimal completion delay performance over all network codes in broadcast scenarios.
An energy-efficient internet of things (IoT) architecture for preventive conservation of cultural heritage
Angel Perles,Eva Pérez-Marín,Ricardo Mercado,J. Damian Segrelles,Ignacio Blanquer,Manuel Zarzo,Fernando J. Garcia-Diego +6 more
TL;DR: This work designed a solution based on LoRa and Sigfox technologies to produce the minimum impact in the artwork, achieving a lifespan of more than 10 years.
130
On The Capacity of Immediately-Decodable Coding Schemes for Wireless Stored-Video Broadcast with Hard Deadline Constraints
TL;DR: It is proved that for independent channels, the IDNC schemes are asymptotically throughput-optimal subject to the deadline constraints when there are no more than three users and when the video file size is sufficiently large.
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.
XORs in the air: practical wireless network coding
TL;DR: The results show that using COPE at the forwarding layer, without modifying routing and higher layers, increases network throughput, and the gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.
•Book
Error Control Systems for Digital Communication and Storage
Stephen B. Wicker
- 01 Feb 1995
TL;DR: This work has shown that polynomials over Galois Fields, particularly the Hadamard, Quadratic Residue, and Golay Codes, are good candidates for Error Control Coding for Digital Communication Systems.
2.1K
XORs in the air: practical wireless network coding
Sachin Katti,Hariharan Rahul,Wenjun Hu,Dina Katabi,Muriel Medard,Jon Crowcroft +5 more
- 11 Aug 2006
TL;DR: The results show that COPE largely increases network throughput, and the gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.