A Greedy and Neighbor Aware Data Forwarding Protocol in Named Data MANETs

Named data networking (NDN) has been drawing increasing attention in academia as well as industry. Data forwarding is one of the key issues in relation to efficient content retrieval in Named Data MANETs. Existing data forwarding protocols aim at either reducing network overhead or improving the success rate of content retrieval, but not both. As both metrics are important, in this paper, we propose a Greedy and Neighbor Aware forwarding protocol (GNA) to balance the trade-offs between success ratio of content retrieval and network overhead, and make NDN suitable for arbitrarily moving nodes in MANETs. The simulation results show that, compared with the greedy forwarding protocol, the GNA protocol can increase the success ratio of content retrieval by about 50% at the lower node density, and increase the network overhead by about 30%, the larger the data packet, the smaller the gap in network overhead; the transmission delay in GNA protocol is similar as the greedy forwarding protocol.