Code pruning in opportunistic routing through bidirectional coding traffic comparison Academic Article uri icon


  • Copyright 2014 John Wiley & Sons, Ltd. Opportunistic routing (OR) significantly improves transmission reliability and network throughput in wireless mesh networks 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 (FN) 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 previous problems, we propose a simple but practical coded feedback scheme, cumulative coding coefficient acknowledgement (C3ACK), based on the relevance between forward (coded packets received from upstream nodes) and backward coding traffic (coded packets overheard from downstream nodes), and apply C3ACK 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 code-pruning schemes can outperform existing approaches in terms of expected throughput and transmission count.

published proceedings


author list (cited authors)

  • Wang, W., Chen, X., Lu, M., Wang, J., Zhang, X. i., & Wu, J.

citation count

  • 1

complete list of authors

  • Wang, Weiping||Chen, Xiaozhuan||Lu, Mingming||Wang, Jianxin||Zhang, Xi||Wu, Jie

publication date

  • February 2016