无标度ICN核心网中基于集群的车联网机制

K. Hasan, Seong-Ho Jeong
{"title":"无标度ICN核心网中基于集群的车联网机制","authors":"K. Hasan, Seong-Ho Jeong","doi":"10.1109/ICUFN49451.2021.9528770","DOIUrl":null,"url":null,"abstract":"The repetition of content requests happens frequently in the vehicular networks, and it is increasing depending on the vehicular density in a certain area. On the other hand, information-centric networking (ICN) is being used in the vehicular networks to fulfill the faster content communication requirements, reduce latency, and enhance the network capacity. Although, the ICN-based vehicular networks have many benefits, it has several drawbacks, e.g., interest packet flooding, inefficient content caching, and so on. Moreover, the network scalability is related to the drawbacks of the existing ICN-based vehicular networks. It is also important that the current Internet architecture is considered as a scale-free network. Therefore, the solution of the existing drawbacks can be solved using the concept of the scale-free ICN network. In this paper, we propose a cluster-based mechanism for vehicular networks in the scale-free ICN core networks. We also simulate the various scenarios of a scale-free network and show the comparative analysis of different scenarios in terms of the total number of clusters vs the number of nodes in a cluster. Our simulation result ensures the solution to the interest flooding problem and the efficiency of the content caching mechanism.","PeriodicalId":318542,"journal":{"name":"2021 Twelfth International Conference on Ubiquitous and Future Networks (ICUFN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Cluster-based Mechanism for Vehicular Networks in the Scale-Free ICN Core Network\",\"authors\":\"K. Hasan, Seong-Ho Jeong\",\"doi\":\"10.1109/ICUFN49451.2021.9528770\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The repetition of content requests happens frequently in the vehicular networks, and it is increasing depending on the vehicular density in a certain area. On the other hand, information-centric networking (ICN) is being used in the vehicular networks to fulfill the faster content communication requirements, reduce latency, and enhance the network capacity. Although, the ICN-based vehicular networks have many benefits, it has several drawbacks, e.g., interest packet flooding, inefficient content caching, and so on. Moreover, the network scalability is related to the drawbacks of the existing ICN-based vehicular networks. It is also important that the current Internet architecture is considered as a scale-free network. Therefore, the solution of the existing drawbacks can be solved using the concept of the scale-free ICN network. In this paper, we propose a cluster-based mechanism for vehicular networks in the scale-free ICN core networks. We also simulate the various scenarios of a scale-free network and show the comparative analysis of different scenarios in terms of the total number of clusters vs the number of nodes in a cluster. Our simulation result ensures the solution to the interest flooding problem and the efficiency of the content caching mechanism.\",\"PeriodicalId\":318542,\"journal\":{\"name\":\"2021 Twelfth International Conference on Ubiquitous and Future Networks (ICUFN)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 Twelfth International Conference on Ubiquitous and Future Networks (ICUFN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICUFN49451.2021.9528770\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Twelfth International Conference on Ubiquitous and Future Networks (ICUFN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUFN49451.2021.9528770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在车载网络中,内容请求的重复频繁发生,并且随着一定区域内车辆密度的增加而增加。另一方面,信息中心网络(ICN)正被用于车载网络,以满足更快的内容通信需求,减少延迟,增强网络容量。尽管基于icn的车载网络具有许多优点,但它也存在一些缺点,如兴趣包泛滥、低效的内容缓存等。此外,网络的可扩展性与现有基于icn的车载网络的缺陷有关。同样重要的是,当前的互联网架构被认为是一个无标度的网络。因此,利用无标度ICN网络的概念可以解决现有缺点。在本文中,我们提出了一种基于集群的无标度ICN核心网车辆网络机制。我们还模拟了无标度网络的各种场景,并根据集群总数与集群中的节点数量对不同场景进行了比较分析。仿真结果保证了兴趣泛滥问题的解决和内容缓存机制的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Cluster-based Mechanism for Vehicular Networks in the Scale-Free ICN Core Network
The repetition of content requests happens frequently in the vehicular networks, and it is increasing depending on the vehicular density in a certain area. On the other hand, information-centric networking (ICN) is being used in the vehicular networks to fulfill the faster content communication requirements, reduce latency, and enhance the network capacity. Although, the ICN-based vehicular networks have many benefits, it has several drawbacks, e.g., interest packet flooding, inefficient content caching, and so on. Moreover, the network scalability is related to the drawbacks of the existing ICN-based vehicular networks. It is also important that the current Internet architecture is considered as a scale-free network. Therefore, the solution of the existing drawbacks can be solved using the concept of the scale-free ICN network. In this paper, we propose a cluster-based mechanism for vehicular networks in the scale-free ICN core networks. We also simulate the various scenarios of a scale-free network and show the comparative analysis of different scenarios in terms of the total number of clusters vs the number of nodes in a cluster. Our simulation result ensures the solution to the interest flooding problem and the efficiency of the content caching mechanism.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信