Abstract
There have been researchers working on the design of coding-aware routing protocols to exploit the power of network coding in static wireless ad hoc networks. However, most of them have overlooked the fact that routing decisions for multiple flows need to be coordinated in order to achieve maximum throughput. A mechanism to alter prior routing decisions is mandatory for this purpose. In this paper, we propose Self-recommendation coding-aware routing (SCAR), to provide such a mechanism. With intermediate nodes sensing the arrival of new flows, they can send self-recommendations to source nodes, triggering a route-change procedure. In the route-change procedure, adjustments are applied to the route metrics so that the newly recommended route can be fairly weighed without bias. A thorough analysis of coding structures is carried out, and a series of indicators are devised to predict how much throughput benefits we can gain from the mere knowledge of the topology. The rationale behind the protocol design and the effectiveness of the indicators are further justified by a series of simulations. Results show that SCAR can exploit coding opportunities better and provide higher throughput than other coding-aware routing protocols. It is also shown that the opportunity of throughput gain is ubiquitous and it is tested on many typical topologies.
Highlights
Network coding is a technique that exploits the broadcast nature in wireless networks to provide throughput improvements
Compared to previous coding-aware routing protocols [5–8], the performance evaluation of our protocol shows that our protocol can significantly improve throughput in many network topologies
Whenever a new flow joins the network with new coding opportunity, prior routing decisions are revised through a route-change procedure
Summary
Network coding is a technique that exploits the broadcast nature in wireless networks to provide throughput improvements. The idea is first proposed in [1] and later developed as a practical network protocol in COPE [2]. The latter describes an “X” scenario, and it is mostly used to illustrate how network coding can reduce the number of transmissions for a given task. A packet from A to D and a packet from C to B can be transmitted with a total of 3 transmissions using network coding technique They are as follows: one transmission from A to O, one transmission from C to O, and a broadcast of the XORed packet by O. This “X” structure is the only applicable network structure for the COPE protocol, which is seen today as the major limitation of COPE
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 call
