Efficient Network-Coding-Based Opportunistic Routing Through Cumulative Coded Acknowledgments

Koutsonikolas, Dimitrios; Wang, Chih-Chun; Hu, Y. Charlie

doi:10.1109/tnet.2011.2111382

Cited by 54 publications

(43 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One approach is to use feedback-based chunk transmission mechanism [24]. While some efficient feedback protocols for specific applications have been developed [25,26], in general, such feedback incurs an inevitable delay and also consumes network resources, resulting in degraded system performance. Besides, for some scenarios such as satellite and deep-space communications, feedbacks are not even available.…”

Section: Related Workmentioning

confidence: 99%

Expander chunked codes

Tang

Yang

et al. 2015

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

Chunked codes are efficient random linear network coding (RLNC) schemes with low computational cost, where the input packets are encoded into small chunks (i.e., subsets of the coded packets). During the network transmission, RLNC is performed within each chunk. In this paper, we first introduce a simple transfer matrix model to characterize the transmission of chunks and derive some basic properties of the model to facilitate the performance analysis. We then focus on the design of overlapped chunked codes, a class of chunked codes whose chunks are non-disjoint subsets of input packets, which are of special interest since they can be encoded with negligible computational cost and in a causal fashion. We propose expander chunked (EC) codes, the first class of overlapped chunked codes that have an analyzable performance, where the construction of the chunks makes use of regular graphs. Numerical and simulation results show that in some practical settings, EC codes can achieve rates within 91 to 97 % of the optimum and outperform the state-of-the-art overlapped chunked codes significantly.

show abstract

Section: Related Workmentioning

confidence: 99%

Expander chunked codes

Tang

Yang

et al. 2015

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

show abstract

“…MORE increases throughput by 22% over ExOR, and by 45% when spatial reuse was possible. Koutsonikolas et al [12] solved one of the major challenges in MORE-how many packets a node should forward-by improving the feedback mechanism to better communicate the state of each node. None of these works, however, make use of implicit acknowledgments.…”

Section: Opportunistic Routingmentioning

confidence: 99%

Benefits of Opportunistic Routing, Implicit Acknowledgments, and Network Coding on a Linear Broadcast Network

Whisman¹,

Médard

Kusuma

et al. 2016

2016 IEEE Globecom Workshops (GC Wkshps)

View full text Add to dashboard Cite

This thesis studies the benefits of using opportunistic routing, implicit acknowledgments, and network coding on a linear broadcast packet network. Nodes are arranged in a line, and the first node wishes to communicate with the end node. When node i transmits, it is received at node j with a probability P i,j . Several communication protocols are proposed and their performance studied using the mean and variance of the completion time as metrics. The protocols studied use end-to-end retransmission, end-to-end coding, and link-by-link retransmission with network coding both with and without opportunistic routing. Simulation and analytical results are presented.End-to-end coding significantly outperforms end-to-end retransmission on both metrics, and the link-by-link protocols outperform both. Opportunistic routing shows a mixed benefit over link-by-link protocols without it. When using opportunistic routing, the variance of the completion time is higher, and the mean is either similar or lower, depending on the channel conditions. When the loss probabilities are higher, opportunistic routing shows little benefit, whereas with a lower probability of packet loss, opportunistic routing shows a significant reduction in mean completion time.

show abstract

“…MORE first combines network coding and OR together. MORE and its variants [8][9][10][11][12][13][14] are only for intra-flow packet delivery. The coding-aware opportunistic routing mEchanism (CORE) [28] incorporates localized inter-flow network coding into OR to improve the throughput performance of a WMN.…”

Section: Related Workmentioning

confidence: 99%

“…The MACindependent opportunistic routing protocol (MORE) [7] is the first practical approach that combines network coding and OR together. MORE and its variants [8][9][10][11][12][13][14] are only for intra-flow packet delivery. An intermediate node in an inter-flow network coding scheme such as COPE (a new forwarding architecture that substantially improves the throughput of wireless networks) [2] needs to know exactly what the previous hop and next hop of a packet is before it starts coding.…”

mentioning

confidence: 99%

CAR: Coding-Aware Opportunistic Routing for Unicast Traffic in Wireless Mesh Networks

Liu

Yang²,

Wang³

et al. 2014

J Netw Syst Manage

View full text Add to dashboard Cite

An intermediate node in an inter-flow network coding scheme needs to know exactly which are the previous hop and next hop of a packet before coding. It is difficult to incorporate inter-flow network coding into opportunistic routing (OR) because the next hop of a packet in OR can't be determined in advance. Codingaware opportunistic routing (CAR) is proposed in this paper to address this problem on fixed wireless mesh networks (WMNs). Meanwhile, it aims to maximize the number of native packets coded in each single transmission. It dynamically selects a route for a given flow according to the real-time coding opportunities. There are no control packets in CAR, which greatly reduces the overhead costs. CAR gives the coded packet that consists of a larger number of native packets with a smaller forwarding delay. The forwarder with the largest number of native packets coded together is ultimately selected to send data. Simulations demonstrate that CAR achieves significantly better throughput gains and derives a reasonable end-to-end delay in both cross topology and mesh topology under both transmission control protocol (TCP) and user datagram protocol (UDP) traffic, as explained below. CAR achieves more than 35 % throughput improvement under TCP traffic and more than 15 % throughput improvement under UDP traffic, compared to other state-of-art protocols in cross topology, respectively. CAR also provides a several-fold increase in throughput in a large scale network (mesh topology). In a word, CAR significantly improves network performance of a WMN.

show abstract

Efficient Network-Coding-Based Opportunistic Routing Through Cumulative Coded Acknowledgments

Cited by 54 publications

References 16 publications

Expander chunked codes

Expander chunked codes

Benefits of Opportunistic Routing, Implicit Acknowledgments, and Network Coding on a Linear Broadcast Network

CAR: Coding-Aware Opportunistic Routing for Unicast Traffic in Wireless Mesh Networks

Contact Info

Product

Resources

About