A blockchain-based architecture for secure vehicular Named Data Networks

Named Data Networking (NDN) is an implementation of Information-Centric Networking (ICN) that has emerged as a promising candidate for the Future Internet Architecture (FIA). In contrast to traditional networking protocols, NDN’s focus is on content, rather than the source of the content. NDN enables name-based routing and location-independent data retrieval, which gives NDN the ability to support the highly dynamic nature of mobile networks. Among other important features, NDN integrates security mechanisms and prioritizes protecting content over communication channels through cryptographic signatures. However, the data verification process that NDN employs may cause significant delays, especially in mobile networks and vehicular networks. This aspect makes it unsuitable for time-critical and sensitive applications such as the sharing of safety messages. Therefore, in this work, we propose NDN-BDA, a blockchain-based decentralized mechanism that provides a faster and more efficient data authenticity mechanism for NDN-based vehicular networks.

Named Data Networking (NDN) proposes a contentcentric rather than a host-centric approach to data retrieval. Data packets with unique and immutable names are retrieved from a content store (CS) using Interest packets. The current NDN architecture relies on forwarding strategies that are dependent upon on-path caching and is therefore inefficient. This approach reduces data transfer efficiency by ignoring the cached content available on the adjacent off-path routers in the network. In this paper, we propose a novel distributed multipath (D-MP) forwarding strategy and enhancements to the NDN Interest forwarding pipeline. Furthermore, we develop a centralized SDNenabled control for the multipath forwarding strategy (S-MP) that distributes Interests efficiently by using the global knowledge of the NDN network states. We perform extensive evaluations of our proposed methods on an at-scale WAN testbed spanning six geographically separated sites. Our solutions outperform the existing NDN forwarding strategies by a significant margin. We show that the D-MP strategy results in performance gains ranging between 10.4x to 12.5x over the default NDN implementation without in-network caching, and gains of 12.2x to 18.4x with in-network caching. In addition, for the S-MP case, we demonstrate a performance improvement of 10.6x to 12.6x, and 12.9x to 18.5x, for with- and without in-network caching respectively.

Named data networking (NDN) supports receiver-driven content retrieval with stateful forwarding (pending interest table (PIT)/forwarding information base) and in-network caching, yet many deployments still rely on classical cryptography that may be undermined by quantum-capable adversaries. Despite NDN’s built-in data authenticity via producer signatures, quantum-enabled attacks become plausible once RSA/ECC-based trust anchors are weakened by Shor-type attacks. Existing quantum-security efforts for NDN largely focus on post-quantum replacements of signatures or key exchange, but do not address the tension between confidentiality-preserving payload protection and NDN’s in-network processing (forwarding/caching decisions) in a quantum setting. This paper presents a quantum-enhanced NDN architecture that preserves NDN’s content-centric semantics—naming, PIT-driven forwarding, and cache-assisted dissemination of verifiable control objects—while delivering privacy-sensitive payloads as quantum homomorphic encryption (QHE)-encrypted quantum states over an underlying quantum network. QHE provides end-to-end confidentiality and enables authorized operations on encrypted quantum payloads without exposing plaintext. To make the design compatible with NDN forwarding, the proposed protocol encrypts the payload while keeping name-based forwarding semantics intact, and supports ciphertext-domain processing for selected policy functions. To protect provenance and integrity of NDN metadata, routing instructions, and session state, we incorporate quantum digital signatures (QDS) bound to NDN names and session identifiers. The main contributions are: (i) a QHE+QDS layered protection model tailored to NDN’s Interest and Data exchange; (ii) a session workflow that couples proactive entanglement distribution with NDN-style stateful signaling for efficient establishment and recovery; and (iii) a security analysis clarifying the achieved guarantees and the remaining trust assumptions. Security analysis indicates robustness against quantum man-in-the-middle and tampering attacks, with modest overhead on NDN control traffic.

Named Data Networking is one of the most promising future Internet architectures with many advanced characteristics that are lacking in the existing TCP/IP-based Internet architecture. NDN features named content, built-in security, in-network caching, adaptive traffic routing, and multi-path forwarding. NDN can be used to mitigate traffic congestion and prioritize critical messages in both wired and wireless networks. It has particular advantages to deliver traffic over a disrupted and highly dynamic network environment because of its delay-tolerant and content-centric features. However, very few works have shown the real-world capacity of NDN over different types of network links. In this work, we benchmark the performance of NDN in various real network settings and make side-by-side comparisons with TCP/IP based approaches. We also demonstrate the strong capabilities of flexible forwarding strategies through prioritizing critical traffic over the network.

The proposed Internet paradigm The Flying Ad Hoc Network (FANET), Named Data Network (NDN), and Software Defined Network (SDN) have attracted the interest of the scientific community. The TCP/IP protocol is the present Internet standard, while NDN is the future internet architecture that builds on it. Data availability is improved via NDN, which substitutes named data for the nodes' addresses. SDN is a good option for communicating effectively, utilizing resources effectively, and supporting developing technologies. The SDN has attracted interest because of its high-level programmability and flexibility. Numerous applications in the military, business, and civil sectors make extensive use of FANE T. The broadcast characteristic of NDN causes an issue known as a broadcast storm in dense FANET environments. The issue is caused by duplicate packets, which raises the overall amount of traffic and retransmissions. FANET has a problem with the timely and quick transmission of essential packets. In this paper, we suggested a new scheme named "Novel Adaptive Broadcast Storm Avoidance (NABA)" for SDN and NDN-enabled FANET, which uses a controller to lessen the broadcast issue. Our scheme made use of the SDN controller's effective flow management to regulate the broadcast storm and facilitate packet transfers. Additionally, we divided up the packet into categories based on priority. The priority of the packet is determined by the naming criterion. In terms of the overall number of Interests and content retrieval time, the findings show that NAB A performs better than native NDN floods.

Named Data Networking (NDN) is a newly proposed next-generation Internet architecture that uses the name of data to forward and route packets. As a potential candidate for future Internet architecture, it is crucial to address the security and privacy issues in NDN. NDN is vulnerable to a new type of Distributed Denial of Service (DDoS) attacks called Interest Flooding Attacks (IFAs). The attackers can send a massive amount of Interest requests to overwhelm the Pending Interest Table (PIT) at routers resulting in network disruption for legitimate users. In this paper, we propose a Binary Tree-Based Interest Flooding Attack Detection and Mitigation Scheme (BTIFADMS) to protect NDNs. The proposed scheme allows each NDN router to use binary trees to detect IFAs and mitigates IFAs by limiting the number of Interest requests forwarded from the contaminated routers. The simulation evaluation shows that BTIFADMS can quickly and accurately identify and respond to the IFAs in the NDNs.

Named-Data Networking (NDN) is a novel clean-slate architecture for Future Internet. It has been designed to take into account a new use of the Internet and especially accessing content for a large number of users, and it integrates several features such as in-network caching, security or multipath. As NDN relies on content names instead of host address, it cannot rely on traditional Internet routing, and it is therefore essential to propose a routing scheme adapted for NDN. To this end, in this paper, we present SRSC, our SDN-based Routing Scheme for CCN/NDN and its implementation. SRSC relies on the SDN paradigm. A controller is responsible to forward decisions and to set up rules into NDN nodes. We implement SRSC into NDNx and we also deploy an NDN testbed within a virtual environment and real ISP topology in order to evaluate the performances of our proposal with real-world experiments. We demonstrate the feasibility of SRSC and its ability to forward Interest messages in a fully deployed NDN environment, while keeping low overhead and computation time and high caching performances.

In this paper we explore congestion control solutions in a network running the Named Data Networking (NDN) protocol. Since requested data can be retrieved from either original producers or in-network caches, the end-to-end connection oriented TCP congestion control solutions, such as BBR (Bottleneck Bandwidth and Round-trip propagation time) do not work well for NDN transport, especially in wireless networks. We propose a BBR-guided congestion control, BBR-CD, for bulk data fetching by a group of users. BBR-CD applies RTT filtering and interest scheduling to improve BBR's efficiency in NDN. Our evaluation shows that BBR-CD achieves much higher application goodput compared with ndncatchunks which implements the TCP AIMD and CUBIC congestion control algorithms. Moreover, compared with one-flow-per-file SIRC, an NDN congestion control algorithm that paces interests based on inter-data-gap, BBR-CD provides better fairness and bandwidth utilization. Finally, BBR-CD outperforms a direct adoption of the original BBR to NDN, suggesting that our changes to BBR are effective.

Two intrinsic features of Named Data Networking(NDN), in-network caching and multipath communication, offer the potential for fast and reliable big data transmissions via multisource content delivery. Network coding has recently been utilized to achieve efficient multisource content delivery in NDN. On the other hand, request pipelining is essential for efficient multisource content delivery in network coding enabled NDN. However, it is a challenge to simultaneously support network coding and request pipelining in NDN in a cost-effective way. To address this problem, we propose NCP-NDN, a network coding and request pipelining enabled named data networking architecture. NCP-NDN supports reasonably efficient Interest aggregation when enabling request pipelining without undermining the privacy of content retrieval by extending each Interest with a session and generation oriented requester identifier. Besides, NCP-NDN provides consumers with linearly independent blocks while request pipelining is enabled by combining rank-based matching, one forwarding of each block for per requester and face, and recoding the matching cached blocks before replying an Interest. Our experimental studies illustrate that NCP-NDN improves the performance of content delivery and reduces the overhead of big data transmissions as compared to the existing schemes.

An on-demand off-path cache exploration based multipath forwarding strategy

Named data networking (NDN) is a future Internet architecture that directly emphasizes accessible content by assigning each piece of content a unique name. Data transmission in NDN is realized via name-based routing and forwarding. Name-based forwarding information base (FIB) usually has much more and longer prefixes than IP-based ones, and therefore, name-based forwarding brings more challenges on the NDN router in terms of high forwarding throughput, low memory consumption, and fast FIB update. In this paper, we present an index data structure called BFAST for the name-based FIB. BFAST is designed based on a basic hash table, it employs a counting Bloom filter to balance the load among hash table slots, so that the number of items in each non-empty slot is close to 1, leading to low searching time in each slot. Meanwhile, the first-rank-indexed scheme is proposed to effectively reduce the massive memory consumption required by the pointers in all the hash table slots. Evaluation results show that, for the longest prefix match FIB lookup, BFAST achieves a speed of 2.14 MS/S using one thread, and meanwhile, the memory consumption is reasonably low. By leveraging the parallelism of today’s multi-core CPU, BFAST arrives at an FIB lookup speed of 33.64 MS/S using 24 threads, and the latency is around $0.71~\mu s$ .

NDN (Named Data Networking, NDN) which is one of the next generation network architectures based on named-data, uses in-network caching. Cache has limited capacity, so the cache replacement policy determines which content is evicted when the cache space is full. This paper analyzes some cache replacement strategies in NDN, and puts forword a cache replacement strategy based on hierarchical popularity, then compares the effect of different cache replacement strategies to the cache performance through simulation experiments. Cache performance is evaluated in provision of cache hit ratio.

The explosive growth of mobile data traffic demands scalable, resilient, and energy-efficient solutions for content dissemination, particularly at the network edge. In this context, 5G networks can rely on Outband Device-to-Device (O-D2D) communications, using technologies such as Wi-Fi Direct, to offload infrastructure, enhance coverage at the cell edge, and enable proximity-based services. However, O-D2D communications face critical challenges related to peer discovery, reliable data retrieval over lossy wireless links, and energy efficiency constraints. In this paper, we propose a novel framework that integrates Named Data Networking (NDN) and Chinese Remainder Theorem (CRT)-based fragmentation to support autonomous O-D2D content delivery. By leveraging name-based forwarding and in-network caching, NDN facilitates distributed content retrieval, making it inherently suited for dynamic and infrastructure-less D2D environments. CRT-based fragmentation, on the other hand, enhances reliability and energy efficiency by allowing data reconstruction from partial fragment sets, mitigating the effects of packet losses typical of wireless links. We implement the proposed architecture in ndnSIM v2.9, extending the NDN forwarding plane to support CRT-based multi-source data retrieval. Simulation results demonstrate that our solution significantly improves content delivery and energy efficiency compared to existing NDN retrieval schemes, particularly under lossy wireless conditions.

Named Data Networking (NDN), an emerging communication model in the content centric networks, has recently presented a solid framework for the future Internet. The NDN exploits content name instead of host name (IP address) and content caching. These features make NDN particularly efficient in networks with intermittent connectivity and dynamic topologies such as mobile ad hoc networks (MANETs). Due to the structure of NDN nodes, design of forwarding strategies has a vital impact on the network performance. In this paper, we propose a new forwarding strategy: redundancy elimination forwarding (REF). In REF, the NDN node structure and the operation of the data structures are modified. These modifications improve network performance in terms of throughput, overhead and resource requirements. REF strategy is simulated in different scenarios based on ndnSIM and the results demonstrate that it provides robust performance for various environments.

Named Data Networking (NDN) has a built-in caching capability that is enabled with the help of its Content Store. Caching in NDN has several benefits, such as reducing overhead on the producer side, avoiding a single point of failure, and reducing network load. The primary caching policy of the NDN architecture is to leave copies everywhere. However, this scheme induces significant cache redundancy. Existing advanced cache techniques either periodically share the entire list of cached content at a node or make a caching decision without knowing the cached content at other nodes in the network. We propose an intelligent cache policy that estimates cache distribution and topology through a collaborative network of NDN routers, guided by Interest and Data packets. Additionally, we develop an NDN simulator to facilitate the testing and evaluation of our machine learning caching strategy. This paper details the cache policy, the design and functionality of our NDN simulator, and the experiments comparing our approach to baseline caching strategies.