Time Dependent Popularity Caching Scheme for NDN Based MANETs

Ehsan Elahi
{"title":"Time Dependent Popularity Caching Scheme for NDN Based MANETs","authors":"Ehsan Elahi","doi":"10.54692/lgurjcsit.2021.0501174","DOIUrl":null,"url":null,"abstract":"Named data networking (NDN) approach has natural benefits within Mobile Ad hoc Network (MANET) but presents different issues as well. Space for cache, energy, and mobility of devices in a MANET is limited; therefore, we need for an enhanced judgement concerning which data to be store and where to be cache. A Time dependent Popularity Caching Scheme (TDPC) has suggested which selects nodes for caching the content on the forwarding path of packet and chooses the contents which have cached constructed on their time dependent popularity. At this interval, the cache distribution of the content and the storage capability of the devices are also measured. Results of the suggested TDPC approach are evaluated by using the simulator ndnSIM which is beached on Network Simulator 3 (NS-3). Simulation outcomes show that TDPC has good performance in expression of cache hit ratio, content retrieval interval, total cache copies and compared to the Dynamic Caching Strategy for CCN-based MANETs (CSCM). The goal of TDPC is to reduce cache redundancy, retrieval time of content and total number of cache copies.","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Lahore Garrison University Research Journal of Computer Science and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54692/lgurjcsit.2021.0501174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Named data networking (NDN) approach has natural benefits within Mobile Ad hoc Network (MANET) but presents different issues as well. Space for cache, energy, and mobility of devices in a MANET is limited; therefore, we need for an enhanced judgement concerning which data to be store and where to be cache. A Time dependent Popularity Caching Scheme (TDPC) has suggested which selects nodes for caching the content on the forwarding path of packet and chooses the contents which have cached constructed on their time dependent popularity. At this interval, the cache distribution of the content and the storage capability of the devices are also measured. Results of the suggested TDPC approach are evaluated by using the simulator ndnSIM which is beached on Network Simulator 3 (NS-3). Simulation outcomes show that TDPC has good performance in expression of cache hit ratio, content retrieval interval, total cache copies and compared to the Dynamic Caching Strategy for CCN-based MANETs (CSCM). The goal of TDPC is to reduce cache redundancy, retrieval time of content and total number of cache copies.
基于NDN的manet的时变流行度缓存方案
命名数据网络(NDN)方法在移动自组织网络(MANET)中具有天然的优势,但也存在不同的问题。在MANET中,设备的缓存空间、能量和移动性是有限的;因此,我们需要对存储哪些数据和缓存在哪里进行更好的判断。提出了一种时间依赖流行度缓存方案(TDPC),该方案选择节点缓存数据包转发路径上的内容,并选择根据其时间依赖流行度构建缓存的内容。在这个时间间隔内,还会测量内容的缓存分布和设备的存储能力。通过在网络模拟器3 (NS-3)上运行的ndnSIM模拟器对建议的TDPC方法的结果进行了评估。仿真结果表明,与基于ccn的manet (CSCM)动态缓存策略相比,TDPC在缓存命中率、内容检索间隔、总缓存副本的表达方面具有良好的性能。TDPC的目标是减少缓存冗余、内容检索时间和缓存副本总数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信