Dynamic Cooperative Cache Management Scheme Based on Social and Popular Data in Vehicular Named Data Network
Vehicular Named Data Network (VNDN) is considered a strong paradigm to deploy in vehicular applications. In VNDN, each node has its cache, but due to limited cache, it directly affects the performance in a highly dynamic environment, which requires massive and fast content delivery. To reduce these...
Gespeichert in:
Veröffentlicht in: | Wireless communications and mobile computing 2022-03, Vol.2022, p.1-11 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 11 |
---|---|
container_issue | |
container_start_page | 1 |
container_title | Wireless communications and mobile computing |
container_volume | 2022 |
creator | Ashraf, M. Wasim Abbas Huang, Chuanhe Raza, Khuhawar Arif Huang, Shidong Yin, Yabo Wu, Dong-Fang |
description | Vehicular Named Data Network (VNDN) is considered a strong paradigm to deploy in vehicular applications. In VNDN, each node has its cache, but due to limited cache, it directly affects the performance in a highly dynamic environment, which requires massive and fast content delivery. To reduce these issues, the cooperative caching plays an efficient role in VNDN. Most studies regarding cooperative caching focus on content replacement and caching algorithms and implement these methods in a static environment rather than a dynamic environment. In addition, few existing approaches addressed the cache diversity and latency in VNDN. This paper proposes a Dynamic Cooperative Cache Management Scheme (DCCMS) based on social and popular data, which improves the cache efficiency and implements it in a dynamic environment. We designed a two-level dynamic caching scheme, in which we choose the right caching node that frequently communicates with other nodes, keep the copy of the most popular content, and distribute it with the requester’s node when needed. The main intention of DCCMS is to improve the cache performance in terms of reducing latency, server load, cache hit ratio, average hop count, cache utilization, and diversity. The simulation results show that our proposed DCCMS scheme improves the cache performance than other state-of-the-art approaches. |
doi_str_mv | 10.1155/2022/8374181 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2646636202</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2646636202</sourcerecordid><originalsourceid>FETCH-LOGICAL-c294t-5d0e98c367da4c312db89fc3d810dd9f39db8d108bdf563c928e3a635f0022043</originalsourceid><addsrcrecordid>eNp9kMtOwzAQRS0EEqWw4wMssYRQPxLHWULLSyoFqcA2mtoOdUns4KRU_XvSh1iymjtXRzPSQeickmtKk2TACGMDydOYSnqAejThJJIiTQ__ssiO0UnTLAghnDDaQ-Vo7aCyCg-9r02A1v4YPAQ1N_gZHHyayrgWT7u9MvgWGqOxd3jqlYUSg9P41dfLEgIeQQvYOvxh5lZtmwlUHb3tJ6Zd-fB1io4KKBtztp999H5_9zZ8jMYvD0_Dm3GkWBa3UaKJyaTiItUQK06ZnsmsUFxLSrTOCp51haZEznSRCK4yJg0HwZOCdAJIzPvoYne3Dv57aZo2X_hlcN3LnIlYCC46Ux11taNU8E0TTJHXwVYQ1jkl-cZnvvGZ7312-OUOn1unYWX_p38BzAVz1Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2646636202</pqid></control><display><type>article</type><title>Dynamic Cooperative Cache Management Scheme Based on Social and Popular Data in Vehicular Named Data Network</title><source>EZB-FREE-00999 freely available EZB journals</source><source>Wiley Online Library (Open Access Collection)</source><source>Alma/SFX Local Collection</source><creator>Ashraf, M. Wasim Abbas ; Huang, Chuanhe ; Raza, Khuhawar Arif ; Huang, Shidong ; Yin, Yabo ; Wu, Dong-Fang</creator><contributor>Luo, Changqing ; Changqing Luo</contributor><creatorcontrib>Ashraf, M. Wasim Abbas ; Huang, Chuanhe ; Raza, Khuhawar Arif ; Huang, Shidong ; Yin, Yabo ; Wu, Dong-Fang ; Luo, Changqing ; Changqing Luo</creatorcontrib><description>Vehicular Named Data Network (VNDN) is considered a strong paradigm to deploy in vehicular applications. In VNDN, each node has its cache, but due to limited cache, it directly affects the performance in a highly dynamic environment, which requires massive and fast content delivery. To reduce these issues, the cooperative caching plays an efficient role in VNDN. Most studies regarding cooperative caching focus on content replacement and caching algorithms and implement these methods in a static environment rather than a dynamic environment. In addition, few existing approaches addressed the cache diversity and latency in VNDN. This paper proposes a Dynamic Cooperative Cache Management Scheme (DCCMS) based on social and popular data, which improves the cache efficiency and implements it in a dynamic environment. We designed a two-level dynamic caching scheme, in which we choose the right caching node that frequently communicates with other nodes, keep the copy of the most popular content, and distribute it with the requester’s node when needed. The main intention of DCCMS is to improve the cache performance in terms of reducing latency, server load, cache hit ratio, average hop count, cache utilization, and diversity. The simulation results show that our proposed DCCMS scheme improves the cache performance than other state-of-the-art approaches.</description><identifier>ISSN: 1530-8669</identifier><identifier>EISSN: 1530-8677</identifier><identifier>DOI: 10.1155/2022/8374181</identifier><language>eng</language><publisher>Oxford: Hindawi</publisher><subject>Algorithms ; Caching ; Collaboration ; Communication ; Data integrity ; Design ; Memory management ; Nodes ; Popularity ; Social interaction ; Vehicles</subject><ispartof>Wireless communications and mobile computing, 2022-03, Vol.2022, p.1-11</ispartof><rights>Copyright © 2022 M. Wasim Abbas Ashraf et al.</rights><rights>Copyright © 2022 M. Wasim Abbas Ashraf et al. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c294t-5d0e98c367da4c312db89fc3d810dd9f39db8d108bdf563c928e3a635f0022043</cites><orcidid>0000-0002-4121-2582 ; 0000-0001-7704-5045 ; 0000-0001-5554-4871 ; 0000-0003-3910-7617</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><contributor>Luo, Changqing</contributor><contributor>Changqing Luo</contributor><creatorcontrib>Ashraf, M. Wasim Abbas</creatorcontrib><creatorcontrib>Huang, Chuanhe</creatorcontrib><creatorcontrib>Raza, Khuhawar Arif</creatorcontrib><creatorcontrib>Huang, Shidong</creatorcontrib><creatorcontrib>Yin, Yabo</creatorcontrib><creatorcontrib>Wu, Dong-Fang</creatorcontrib><title>Dynamic Cooperative Cache Management Scheme Based on Social and Popular Data in Vehicular Named Data Network</title><title>Wireless communications and mobile computing</title><description>Vehicular Named Data Network (VNDN) is considered a strong paradigm to deploy in vehicular applications. In VNDN, each node has its cache, but due to limited cache, it directly affects the performance in a highly dynamic environment, which requires massive and fast content delivery. To reduce these issues, the cooperative caching plays an efficient role in VNDN. Most studies regarding cooperative caching focus on content replacement and caching algorithms and implement these methods in a static environment rather than a dynamic environment. In addition, few existing approaches addressed the cache diversity and latency in VNDN. This paper proposes a Dynamic Cooperative Cache Management Scheme (DCCMS) based on social and popular data, which improves the cache efficiency and implements it in a dynamic environment. We designed a two-level dynamic caching scheme, in which we choose the right caching node that frequently communicates with other nodes, keep the copy of the most popular content, and distribute it with the requester’s node when needed. The main intention of DCCMS is to improve the cache performance in terms of reducing latency, server load, cache hit ratio, average hop count, cache utilization, and diversity. The simulation results show that our proposed DCCMS scheme improves the cache performance than other state-of-the-art approaches.</description><subject>Algorithms</subject><subject>Caching</subject><subject>Collaboration</subject><subject>Communication</subject><subject>Data integrity</subject><subject>Design</subject><subject>Memory management</subject><subject>Nodes</subject><subject>Popularity</subject><subject>Social interaction</subject><subject>Vehicles</subject><issn>1530-8669</issn><issn>1530-8677</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kMtOwzAQRS0EEqWw4wMssYRQPxLHWULLSyoFqcA2mtoOdUns4KRU_XvSh1iymjtXRzPSQeickmtKk2TACGMDydOYSnqAejThJJIiTQ__ssiO0UnTLAghnDDaQ-Vo7aCyCg-9r02A1v4YPAQ1N_gZHHyayrgWT7u9MvgWGqOxd3jqlYUSg9P41dfLEgIeQQvYOvxh5lZtmwlUHb3tJ6Zd-fB1io4KKBtztp999H5_9zZ8jMYvD0_Dm3GkWBa3UaKJyaTiItUQK06ZnsmsUFxLSrTOCp51haZEznSRCK4yJg0HwZOCdAJIzPvoYne3Dv57aZo2X_hlcN3LnIlYCC46Ux11taNU8E0TTJHXwVYQ1jkl-cZnvvGZ7312-OUOn1unYWX_p38BzAVz1Q</recordid><startdate>20220322</startdate><enddate>20220322</enddate><creator>Ashraf, M. Wasim Abbas</creator><creator>Huang, Chuanhe</creator><creator>Raza, Khuhawar Arif</creator><creator>Huang, Shidong</creator><creator>Yin, Yabo</creator><creator>Wu, Dong-Fang</creator><general>Hindawi</general><general>Hindawi Limited</general><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7XB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-4121-2582</orcidid><orcidid>https://orcid.org/0000-0001-7704-5045</orcidid><orcidid>https://orcid.org/0000-0001-5554-4871</orcidid><orcidid>https://orcid.org/0000-0003-3910-7617</orcidid></search><sort><creationdate>20220322</creationdate><title>Dynamic Cooperative Cache Management Scheme Based on Social and Popular Data in Vehicular Named Data Network</title><author>Ashraf, M. Wasim Abbas ; Huang, Chuanhe ; Raza, Khuhawar Arif ; Huang, Shidong ; Yin, Yabo ; Wu, Dong-Fang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c294t-5d0e98c367da4c312db89fc3d810dd9f39db8d108bdf563c928e3a635f0022043</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Caching</topic><topic>Collaboration</topic><topic>Communication</topic><topic>Data integrity</topic><topic>Design</topic><topic>Memory management</topic><topic>Nodes</topic><topic>Popularity</topic><topic>Social interaction</topic><topic>Vehicles</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ashraf, M. Wasim Abbas</creatorcontrib><creatorcontrib>Huang, Chuanhe</creatorcontrib><creatorcontrib>Raza, Khuhawar Arif</creatorcontrib><creatorcontrib>Huang, Shidong</creatorcontrib><creatorcontrib>Yin, Yabo</creatorcontrib><creatorcontrib>Wu, Dong-Fang</creatorcontrib><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access Journals</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Wireless communications and mobile computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ashraf, M. Wasim Abbas</au><au>Huang, Chuanhe</au><au>Raza, Khuhawar Arif</au><au>Huang, Shidong</au><au>Yin, Yabo</au><au>Wu, Dong-Fang</au><au>Luo, Changqing</au><au>Changqing Luo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dynamic Cooperative Cache Management Scheme Based on Social and Popular Data in Vehicular Named Data Network</atitle><jtitle>Wireless communications and mobile computing</jtitle><date>2022-03-22</date><risdate>2022</risdate><volume>2022</volume><spage>1</spage><epage>11</epage><pages>1-11</pages><issn>1530-8669</issn><eissn>1530-8677</eissn><abstract>Vehicular Named Data Network (VNDN) is considered a strong paradigm to deploy in vehicular applications. In VNDN, each node has its cache, but due to limited cache, it directly affects the performance in a highly dynamic environment, which requires massive and fast content delivery. To reduce these issues, the cooperative caching plays an efficient role in VNDN. Most studies regarding cooperative caching focus on content replacement and caching algorithms and implement these methods in a static environment rather than a dynamic environment. In addition, few existing approaches addressed the cache diversity and latency in VNDN. This paper proposes a Dynamic Cooperative Cache Management Scheme (DCCMS) based on social and popular data, which improves the cache efficiency and implements it in a dynamic environment. We designed a two-level dynamic caching scheme, in which we choose the right caching node that frequently communicates with other nodes, keep the copy of the most popular content, and distribute it with the requester’s node when needed. The main intention of DCCMS is to improve the cache performance in terms of reducing latency, server load, cache hit ratio, average hop count, cache utilization, and diversity. The simulation results show that our proposed DCCMS scheme improves the cache performance than other state-of-the-art approaches.</abstract><cop>Oxford</cop><pub>Hindawi</pub><doi>10.1155/2022/8374181</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0002-4121-2582</orcidid><orcidid>https://orcid.org/0000-0001-7704-5045</orcidid><orcidid>https://orcid.org/0000-0001-5554-4871</orcidid><orcidid>https://orcid.org/0000-0003-3910-7617</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1530-8669 |
ispartof | Wireless communications and mobile computing, 2022-03, Vol.2022, p.1-11 |
issn | 1530-8669 1530-8677 |
language | eng |
recordid | cdi_proquest_journals_2646636202 |
source | EZB-FREE-00999 freely available EZB journals; Wiley Online Library (Open Access Collection); Alma/SFX Local Collection |
subjects | Algorithms Caching Collaboration Communication Data integrity Design Memory management Nodes Popularity Social interaction Vehicles |
title | Dynamic Cooperative Cache Management Scheme Based on Social and Popular Data in Vehicular Named Data Network |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T18%3A48%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dynamic%20Cooperative%20Cache%20Management%20Scheme%20Based%20on%20Social%20and%20Popular%20Data%20in%20Vehicular%20Named%20Data%20Network&rft.jtitle=Wireless%20communications%20and%20mobile%20computing&rft.au=Ashraf,%20M.%20Wasim%20Abbas&rft.date=2022-03-22&rft.volume=2022&rft.spage=1&rft.epage=11&rft.pages=1-11&rft.issn=1530-8669&rft.eissn=1530-8677&rft_id=info:doi/10.1155/2022/8374181&rft_dat=%3Cproquest_cross%3E2646636202%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2646636202&rft_id=info:pmid/&rfr_iscdi=true |