Abstract
Coding-aware routing is an effective approach for incorporating network coding into practical network protocols. The main challenge in exploiting the network coding is how coding opportunities can accurately be identified and utilized. In this paper, we formally establish coding conditions for a very general scenario: Multiple coding nodes may exist along a path, and multiple flows may intersect at one node. Specifically, we systematically analyze possible coding scenarios and develop generalized coding conditions to ensure the decoding ability at the destinations. In particular, we develop an extended coding graph to make the conditions implementable. With the help of the extended coding graph, we examine the coding relationship between flows. Our coding conditions also include a coding flow selection procedure to guarantee the coding capability of each coding node, in which not only a native packet, but an encoded packet as well, could be involved. Furthermore we propose a novel coding-aware routing metric, the free-ride-oriented routing metric (FORM), with the objective of exploiting the coding opportunities so that a new flow can free ride on the existing traffic and can be supported with a smaller number of transmissions. NS-2 simulations are conducted to demonstrate the advantage of FORM and the proposed coding conditions over well-known COPE scheme in terms of throughput.
Highlights
Color versions of one or more of the figures in this paper are available online at http://ieeexplore.ieee.org
The main issues for efficient coding-aware routing are how to identify coding nodes and how to choose coding flows that traverse on each coding node
After reviewing some wellknown routing metrics, we place different metrics into the following two categories—the coding-oblivious routing metric and the coding-aware routing metric (CRM)—and compare them to indicate the benefit of the CRM
Summary
We formally establish coding conditions for a very general scenario: Multiple coding nodes may exist along a path, and multiple flows may intersect at one node. We systematically analyze possible coding scenarios and develop coding conditions for a -hop coding structure model, in which the proposed conditions ensure that the destination of a coded flow can decode its packets. The goal of our routing metric is to effectively explore coding opportunities and maximize the benefit of “free ride” to reduce the total number of transmissions and increase the network throughput.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
