An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
ER: efficient retransmission scheme for wireless LANs
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Block Size Estimation for Time-Sensitive Applications under Wireless Network Coding
FGCN '08 Proceedings of the 2008 Second International Conference on Future Generation Communication and Networking - Volume 01
DCAR: Distributed Coding-Aware Routing in Wireless Networks
IEEE Transactions on Mobile Computing
Delay Aware Broadcast Scheduling in Wireless Networks Using Network Coding
NSWCTC '10 Proceedings of the 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 01
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Most of the works on Generation-Based Network Coding (GBNC) consider a fixed generation size. A large generation size maximizes the Network Coding benefits but leads to a long delay while a small generation size reduces the delay but decreases the throughput. This paper presents the DYnamic GEneration Size (DYGES) approach. Our network-aware method adjusts the generation size according to the network variations (network size, congestion, losses) for multicast flows to keep the delay steady. Since Network Coding and redundancy cope with data packet loss, we propose an enhancement of DYGES with ACK recovery. This method, named RDYGES, uses the opportunistic listening feature of nodes to recover the lost ACK. Our goal is to guarantee a Quality of Service (QoS) in terms of delay. The simulation results show the accuracy of our approach.