Abstract

Named Data Networking (NDN) recently arises as a promising technology to support connected vehicle (CV) applications due to the match between their characteristics. However, the fast mobility and the vast number of vehicles raise great challenges in designing a scalable and efficient NDN network for CV applications. Therefore, in this paper, we develop an NDN based CV application framework that handles the challenge through innovations in two aspects. First, we propose a hierarchical hyperbolic NDN backbone architecture (H2NDN). H2NDN exploits the location dependency of CV applications to develop a hierarchical router topology and a hierarchical data/interest namespace. As a result, efficient and scalable data retrieval can be achieved by only configuring static forwarding information base (FIB) on NDN routers. To avoid overloading high-level routers, H2NDN integrates hyperbolic routing into the hierarchical architecture through carefully designed hyperbolic planes. Second, on top of the H2NDN architecture, we further model the optimal data caching problem. Based on the modeling, we propose a distributed adaptive caching strategy that can greatly improve the efficiency of the H2NDN backbone in supporting CV applications. Extensive ndnSIM based experiments with real traffic data in a city prove the efficiency and scalability of the proposed NDN application framework.

Highlights

  • Connected vehicle (CV) technology has been developed recently to provide wireless networking connectivity to vehicles, interconnecting them with each other as well as with infrastructures [1], [2]

  • We propose a distributed adaptive cache placement algorithm in the H2NDN backbone to further improve its performance in supporting CV applications

  • We present the state-ofarts of two important components of the proposed H2NDN, i.e., hyperbolic routing and data caching in named data networking (NDN)

Read more

Summary

INTRODUCTION

Connected vehicle (CV) technology has been developed recently to provide wireless networking connectivity to vehicles, interconnecting them with each other as well as with infrastructures [1], [2]. It is not hard to find that, due to the fast mobility and the vast number of vehicles, the NDN framework has to be able to span a large area and serve a high volume of queries efficiently (i.e., demanding a high scalability and a high efficiency) Such a need has not been comprehensively studied in current literature. The H2NDN backbone develops a hierarchical router topology and data/interest namespace by using the hierarchical nature of geographic locations (e.g., state→city→road). Popular data is more likely to be cached on routers close to vehicles where they can save the most hops, while caches of less-popular data are pushed towards data servers This lowers the average number of forwarding hops needed to hit data adaptively.

RELATED WORK
NDN BASED CV APPLICATION FRAMEWORK
CACHE ALLOCATION STRATEGY
IMPRACTICALITY OF GLOBAL OPTIMIZATION
End Function
PERFORMANCE EVALUATION
Findings
CONCLUSION
Full Text
Published version (Free)

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