Improving unsegmented network coding for opportunistic routing in wireless mesh network

Chen, Chen; Dong, Chao; Wu, Fan; Wang, Hai; Peng, Laixian; Nie, Jing

doi:10.1109/wcnc.2012.6214086

Cited by 4 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

See 1 more Smart Citation

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

Section: Related Workmentioning

confidence: 99%

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

show abstract

“…Compared with the batch‐based OR, which codes packets separately within batches, the stream‐based OR allows coded packets to be transmitted over WMNs as coding streams. More specifically, stream‐based OR protocols need to maintain an additional native‐packet queue and a coding window at the source. The coding window stores the coding basis , that is, the native packets used to generate coded packets, and the queue contains a stream of native packets waiting to be put into the coding window.…”

Section: Code Pruning In Coded or Modelsmentioning

confidence: 99%

“…However, SlideOR only supports end‐to‐end stream‐based coding. SlideOR has been further extended . Chen et al improved SlideOR by restricting the number of injected innovative packets at the source node.…”

Section: Related Workmentioning

confidence: 99%

“…Furthermore, as stream‐based coded OR protocols , which relax the constraint of coding within a batch (a fundamental property of the batch‐based coded OR ), can reduce the end‐to‐end transmission delay and, in turn, improve transmission throughput, we extend our code‐pruning scheme to stream‐based OR models by pruning packets covered by downstream nodes so that the covered packets will no longer be used for generating new coded packets. Note that a packet is covered by downstream nodes if the coding vector used to express that the packet can be linearly expressed by the coding vectors in the collective knowledge spaces of downstream nodes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Code pruning in opportunistic routing through bidirectional coding traffic comparison

Wang

Xiaozhuan

et al. 2014

Wireless Communications

View full text Add to dashboard Cite

Opportunistic routing (OR) significantly improves transmission reliability and network throughput in wireless mesh networks (WMNs) by utilizing the broadcast nature of the wireless medium. Through the integration of network coding (NC), the complicated coordination to select the best forwarding node in OR can be bypassed. However, the introduction of NC exacerbates the redundant-packet-transmission problem. To mitigate this issue, existing coded OR protocols either adopt the loss-rate-based approach, employ orthogonal vectors as coded feedback, or pursue the stream-based coded OR model. However, these three solutions suffer inaccuracy and obsolescence of the loss-rate measurement, false-positive/false-negative problem, and unavailability of hop-by-hop stream-based OR, respectively. To address the above problems, we propose a simple but practical coded feedback scheme, Cumulative Coding Coefficient ACKnowledgement (C 3 ACK), based on the relevance between forward (coded packets received from upstream nodes) and backward coding traffic (coded packets overheard from downstream nodes), and apply C 3 ACK to both batch-based and stream-based coded OR models in order to prune redundant forward and backward coding traffic. Both testbed evaluation and simulation study show that our codepruning schemes can outperform existing approaches in terms of expected throughput and transmission count.

show abstract

Joint distortion aware opportunistic routing and transmission rate assignment for video streaming over wireless mesh networks

Nguyen

et al. 2013

2013 International Conference on Computing, Management and Telecommunications (ComManTel)

View full text Add to dashboard Cite

Improving unsegmented network coding for opportunistic routing in wireless mesh network

Cited by 4 publications

References 21 publications

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

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

Code pruning in opportunistic routing through bidirectional coding traffic comparison

Joint distortion aware opportunistic routing and transmission rate assignment for video streaming over wireless mesh networks

Contact Info

Product

Resources

About