AODV-COD: AODV routing protocol with coding opportunity discovery

Due to the bandwidth-limited wireless broadcast channel and node mobility in Mobile Ad hoc Networks (MANETs), reactive on-demand routing protocols have attracted extensive attention because that the routes are established only when required. Ad hoc On-Demand Distance Vector (AODV) routing protocol is a prominent on-demand one which has been used widely. However, constrained by the limited topology information, the nodes with AODV can not execute XOR coding scheme which has been shown to be able to improve the throughput of unicast traffic in MANETs. In this paper, we analyze that two-hop neighbor nodes information and two-hop predecessor nodes information of the received packets are sufficient for the nodes with most distance-vector routing protocols to discover the coding opportunity effectively. Then we implement AODV routing protocol with Coding Opportunity Discovery (AODV-COD) and evaluate its performance by simulation. The results show that our implementation is effective and AODV-COD can increase network throughput in comparison with AODV.