Abstract
In traditional store and forward protocols, lost packets have no impact on the delivery of other transmitted packets. With network coding, the impact of a packet loss may affect the decoding of other transmitted packets thus affecting the entire process of communication between nodes. In this work, we propose a new network coding model that allows generating, coding, decoding and transmission activities on the packets. Based on this model, the impact of lost packets on buffering and the complexity at the receiving nodes is studied and two new mechanisms are proposed to allow the recovery of lost packets. Compared to traditional linear network coding protocol, our mechanisms provide a significant performance amelioration in terms of number of transmissions required to recover from packet loss.
Highlights
1.1 Motivations Recent advancements in network coding (NC) implementations have allowed substantial throughput gain in wireless networks
Traditional store and forward algorithm starts with a total of 50,000 transmissions on a reliable network and ends with an increase of 34% when the loss probability reaches 20%
On a reliable network, revised linear network coding (LNC), immediate retransmission request (IRR), and Basic Covering Set Discovery (BCSD) start with almost the same number of required transmissions to deliver all the packets
Summary
1.1 Motivations Recent advancements in network coding (NC) implementations have allowed substantial throughput gain in wireless networks. Decodable NC (IDNC) [9] with its fast decoding potential becomes of major interest for Another popular NC scheme, known as linear network coding (LNC), has been applied to save packet transmission in wireless networks [3, 10, 11]. Suppose the network eraser rate is 20% for example and that the sender broadcasts four linear combinations of the three packets as follows:. End nodes generate packets to be transmitted to each other via intermediate nodes responsible for coding and routing tasks. We denote by packet a newly generated message by an end node ∈ EN and by coded message a combination of packets coded together using the XOR operation.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
