Review: Survey of network coding-aware routing protocols in wireless networks
Journal of Network and Computer Applications
O3: optimized overlay-based opportunistic routing
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
On the queueing behavior of inter-flow asynchronous network coding
Computer Communications
S-NC: structure-free network coding-aware routing in wireless sensor networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Distributed opportunistic and diffused coding with multiple decoders in wireless mesh networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Effect of network-coding overhead on end-to-end throughput for multihop wireless networks
Performance Evaluation
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new coding- and interference-aware routing protocol in wireless mesh networks
Computers and Electrical Engineering
Coding- and interference-aware routing protocol in wireless networks
Computer Communications
Optimal opportunistic routing and network coding for bidirectional wireless flows
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fault-tolerant routing mechanism based on network coding in wireless mesh networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
Recently, there has been a growing interest of using network coding to improve the performance of wireless networks, for example, authors of [1] proposed the practical wireless network coding system called COPE, which demonstrated the throughput gain achieved by network coding. However, COPE has two fundamental limitations: 1) the coding opportunity is crucially dependent on the established routes and 2) the coding structure in COPE is limited within a two-hop region only. The aim of this paper is to overcome these limitations. In particular, we propose DCAR, the Distributed Coding-Aware Routing mechanism which enables: 1) the discovery for available paths between a given source and destination and 2) the detection for potential network coding opportunities over much wider network region. One interesting result is that DCAR has the capability to discover high throughput paths with coding opportunities, while conventional wireless network routing protocols fail to do so. In addition, DCAR can detect coding opportunities on the entire path, thus eliminating the “two-hop” coding limitation in COPE. We also propose a novel routing metric called Coding-aware Routing Metric (CRM) which facilitates the performance comparison between “coding-possible” and "coding-impossible” paths. We implement the DCAR system in ns-2 and carry out extensive evaluation. We show that when comparing to the coding mechanism in [1], DCAR can achieve much higher throughput gain.