NDVR: NDN Distance Vector Routing
Italo V S Brito

TL;DR
NDVR is a lightweight distance-vector routing protocol designed for Named Data Networking in highly dynamic mobile ad-hoc environments, enabling efficient data reachability propagation.
Contribution
This paper introduces NDVR, a novel distance-vector routing protocol tailored for NDN in mobile ad-hoc scenarios, with implementation details and practical use case demonstration.
Findings
NDVR effectively propagates data reachability in mobile ad-hoc networks.
The protocol supports rapid adaptation to topology changes.
NDVR enhances NDN application performance in dynamic environments.
Abstract
Ad hoc mobile scenarios desire a lightweight routing protocol to propagate rapidly changing data reachability information in a highly dynamic environment. We are developing a distance-vector routing protocol that enables each node to selectively propagate a data reachability vector containing the named-data prefixes current reachable to their neighbors. In this report, we describe the implementation of NDVR (NDN Distance Vector Routing), discuss the rationale for the protocol design choices, and demonstrate a use case for the protocol to illustrate how the routing protocol can help NDN applications, especially in mobile ad-hoc scenarios.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Opportunistic and Delay-Tolerant Networks · Mobile Ad Hoc Networks
