A Smart Forwarding Scheme for the Interest Packet in VNDN

Xian, Guo; Chen, Yuxi; Cao, Laichen; Zhang, Di; Jiang, Yongbo

doi:10.1109/hoticn48464.2019.9063216

Cited by 9 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…5 is designed in ndnSim-2.0 [34] to analyze the performance of the proposed forwarding scheme. The vehicles are modelled as a smart as stated in [35] and equipped with IEEE 802.11a interface capable of communicate in adhoc mode.…”

Section: Performance Analysismentioning

confidence: 99%

Optimized interest forwarding in information centric vehicular networks using general secretary problem

Samantha

Dutta

2023

Preprint

View full text Add to dashboard Cite

Vehicular networks of current era is not limited only to road safety and traffic management. It is been widely accepted as a network for information sharing, social networking and entertainment. With the advent of smart vehicles, the demand of vehicular network centric applications are getting popular. In one way, these applications demand faster data access and on the other hand, the underlying challenges of vehicular networks such as intermittent connectivity, low bandwidth and unpredictable vehicle movements impose considerable hindrance on communications. That is why, the vehicular communication is moving towards information centric approach so that the benefits of Information Centric Network (ICN) can be utilized. However, inherent challenges of vehicular communication and the lack of adequate protocols to implement content centric approach makes the extension of ICN into vehicular communications difficult. In ICN, a node generates interest packets to find a content. The interest is forwarded to an appropriate cache store to get the data. Hence, efficient forwarding of interest packets can considerably improve the content retrieval delay and can reduce network load. The interest forwarding techniques designed for wired ICN are not suitable for vehicular network due to computational complexity and bandwidth crisis. Hence, Information Centric Vehicular Network (ICVN) demands a new design for interest forwarding. Influenced by the need of the current time in vehicular communication, this research is aimed at developing an efficient interest forwarding mechanism for ICVN. The proposed algorithm models the interest forwarding task as a general secretary problem and finds the best node (or set of nodes) in the network to forward the interest packet. The protocol performance is examined in a simulation testbed designed in ndnSim-2.0 and compared with existing forwarding approaches. Observation demonstrates a better performance of the said vehicle with respect to content retrieval latency and network overhead.

show abstract

Section: Performance Analysismentioning

confidence: 99%

Optimized interest forwarding in information centric vehicular networks using general secretary problem

Samantha

Dutta

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Guo et al [38] proposed a scheme to mitigate the broadcast storm problem of interest packets, named BRFD (Bayesian-based Receiver Forwarding Decision scheme for the interest packet). In BRFD, the forwarding of an interest packet is decided based on knowledge of network operation conditions learned by the Bayesian decision model.…”

Section: Related Workmentioning

confidence: 99%

Towards Improved Vehicular Information-Centric Networks by Efficient Caching Discovery

et al. 2020

View full text Add to dashboard Cite

The number of connected cars and the massive consumption of digital content on the Internet have increased daily. However, the high mobility of the vehicles, coming from patterns’ variation over time, makes efficient large-scale content distribution quite challenging. In light of this, the emerging Vehicular Named Data Network (VNDN) architecture provides support for content-centric network communications and caching capabilities, which allows reliable and larger-scale content delivery over Vehicular Ad-Hoc Networks (VANETs). This notwithstanding, the high number of interest packets in VNDN tends to introduce broadcast storm occurrences during the cache discovery process. Thus, network performance degradation comes up for the influence of both increased packet loss rates and delays on content recovery during communication between vehicles. This work proposes a new cache discOVEry pRoTocol (OVERT VNDN), which combines the computational geometry and degree centrality concepts to tackle the VNDN performance degradation challenges and issues. The main idea behind OVERT VNDN is to choose the most appropriate relay vehicles to engage interest packets’ delivery within the VNDN, seeking to achieve higher network performance by optimizing broadcast storm incidence. The obtained results suggest that OVERT VNDN outperforms its competitor in the following key performance indicators: (i) improving the cache discovery process by 120.47%; (ii) enhancing the content delivery rate by 43%; and (iii) reducing the number of interest packets by 80.99%.

show abstract

“…However, several crucial issues and challenges related to name-based lookup are yet to be addressed to successfully realize a content-oriented network model for the VNDN and the future's internet. The name prefix is considered longer than the IP prefix [5]. The lookup time for the name's unbounded length may take more time and increase the forwarding table's size compared to the IP prefix in a vehicular network.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Naming Scheme and Lookup Method Based on Trie for Vehicular Named Data Network

Ashraf

Huang

Khalid

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Content naming and lookup are decisive functions of the future architecture named data network (NDN). The core concept of NDN is the content distribution between consumers and content providers. The NDN supports advance vehicular networks that is famous with vehicular-named data network (VNDN) with different naming schemes such as hybrid, flat, attribute-based, and hierarchical names. These schemes are used in a static way for vehicular network, in summary, the hybrid, flat, and attribute-based makes a complex structure, and on the other hand, hierarchical names long in length and name lookup performance are a bottleneck in NDN, which can directly affect the network performance. Therefore, we introduce a dynamic naming scheme and lookup method (DNSL) for VNDN to mitigate these issues. We argue that the dynamic naming scheme is a better approach to VNDN, while the static name is a cost-effective, hefty, integrated fashion, and improper for the vehicular network. This study focuses on (1) a dynamic naming scheme using dynamic-tag and (2) a lookup method based on node partition of trie; the trie approach is very famed in data structure and extensively used for the lookup content, insertion, and deletion processes. Our experimental evaluation shows that the DNSL scheme is highly efficient, scalable, and provably correct for VNDN.

show abstract

A Smart Forwarding Scheme for the Interest Packet in VNDN

Cited by 9 publications

References 22 publications

Optimized interest forwarding in information centric vehicular networks using general secretary problem

Optimized interest forwarding in information centric vehicular networks using general secretary problem

Towards Improved Vehicular Information-Centric Networks by Efficient Caching Discovery

Dynamic Naming Scheme and Lookup Method Based on Trie for Vehicular Named Data Network

Contact Info

Product

Resources

About