A caching strategy based on many-to-many matching game in D2D networks

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Tsinghua science and technology 2021-12, Vol.26 (6), p.857-868
Hauptverfasser: Yu, Kaihang, Ma, Zhonggui, Ni, Runyu, Zhang, Tao
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 868
container_issue 6
container_start_page 857
container_title Tsinghua science and technology
container_volume 26
creator Yu, Kaihang
Ma, Zhonggui
Ni, Runyu
Zhang, Tao
description
doi_str_mv 10.26599/TST.2020.9010044
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_26599_TST_2020_9010044</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_26599_TST_2020_9010044</sourcerecordid><originalsourceid>FETCH-LOGICAL-c288t-a6874aa79f21b75427943e0766635f531474d438828c1ac87feeb3d8d18b82e73</originalsourceid><addsrcrecordid>eNpNkE1OwzAYRC0EEqXlAOx8AYfPP7GdZdVSilSJBenachwnBEiCbEsotyelXbB6M9JoFg-hBwoZk3lRPJZvZcaAQVYABRDiCi1mKgKMiut_-RbdxfgBwGWu-ALt1thZ994NLY4p2OTbCVc2-hqPA-7tMJE0khPnks671vYedwPesi0efPoZw2dcoZvGfkV_f-ESHXdP5WZPDq_PL5v1gTimdSJWaiWsVUXDaKVywVQhuAclpeR5k3MqlKgF15ppR63TqvG-4rWuqa4084ovET3_ujDGGHxjvkPX2zAZCuZPhJlFmJMIcxHBfwGmgU9n</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A caching strategy based on many-to-many matching game in D2D networks</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Yu, Kaihang ; Ma, Zhonggui ; Ni, Runyu ; Zhang, Tao</creator><creatorcontrib>Yu, Kaihang ; Ma, Zhonggui ; Ni, Runyu ; Zhang, Tao</creatorcontrib><identifier>ISSN: 1007-0214</identifier><identifier>EISSN: 1007-0214</identifier><identifier>DOI: 10.26599/TST.2020.9010044</identifier><language>eng</language><ispartof>Tsinghua science and technology, 2021-12, Vol.26 (6), p.857-868</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c288t-a6874aa79f21b75427943e0766635f531474d438828c1ac87feeb3d8d18b82e73</citedby></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><creatorcontrib>Yu, Kaihang</creatorcontrib><creatorcontrib>Ma, Zhonggui</creatorcontrib><creatorcontrib>Ni, Runyu</creatorcontrib><creatorcontrib>Zhang, Tao</creatorcontrib><title>A caching strategy based on many-to-many matching game in D2D networks</title><title>Tsinghua science and technology</title><issn>1007-0214</issn><issn>1007-0214</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNpNkE1OwzAYRC0EEqXlAOx8AYfPP7GdZdVSilSJBenachwnBEiCbEsotyelXbB6M9JoFg-hBwoZk3lRPJZvZcaAQVYABRDiCi1mKgKMiut_-RbdxfgBwGWu-ALt1thZ994NLY4p2OTbCVc2-hqPA-7tMJE0khPnks671vYedwPesi0efPoZw2dcoZvGfkV_f-ESHXdP5WZPDq_PL5v1gTimdSJWaiWsVUXDaKVywVQhuAclpeR5k3MqlKgF15ppR63TqvG-4rWuqa4084ovET3_ujDGGHxjvkPX2zAZCuZPhJlFmJMIcxHBfwGmgU9n</recordid><startdate>202112</startdate><enddate>202112</enddate><creator>Yu, Kaihang</creator><creator>Ma, Zhonggui</creator><creator>Ni, Runyu</creator><creator>Zhang, Tao</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>202112</creationdate><title>A caching strategy based on many-to-many matching game in D2D networks</title><author>Yu, Kaihang ; Ma, Zhonggui ; Ni, Runyu ; Zhang, Tao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c288t-a6874aa79f21b75427943e0766635f531474d438828c1ac87feeb3d8d18b82e73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yu, Kaihang</creatorcontrib><creatorcontrib>Ma, Zhonggui</creatorcontrib><creatorcontrib>Ni, Runyu</creatorcontrib><creatorcontrib>Zhang, Tao</creatorcontrib><collection>CrossRef</collection><jtitle>Tsinghua science and technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yu, Kaihang</au><au>Ma, Zhonggui</au><au>Ni, Runyu</au><au>Zhang, Tao</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A caching strategy based on many-to-many matching game in D2D networks</atitle><jtitle>Tsinghua science and technology</jtitle><date>2021-12</date><risdate>2021</risdate><volume>26</volume><issue>6</issue><spage>857</spage><epage>868</epage><pages>857-868</pages><issn>1007-0214</issn><eissn>1007-0214</eissn><doi>10.26599/TST.2020.9010044</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1007-0214
ispartof Tsinghua science and technology, 2021-12, Vol.26 (6), p.857-868
issn 1007-0214
1007-0214
language eng
recordid cdi_crossref_primary_10_26599_TST_2020_9010044
source EZB-FREE-00999 freely available EZB journals
title A caching strategy based on many-to-many matching game in D2D networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T23%3A53%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20caching%20strategy%20based%20on%20many-to-many%20matching%20game%20in%20D2D%20networks&rft.jtitle=Tsinghua%20science%20and%20technology&rft.au=Yu,%20Kaihang&rft.date=2021-12&rft.volume=26&rft.issue=6&rft.spage=857&rft.epage=868&rft.pages=857-868&rft.issn=1007-0214&rft.eissn=1007-0214&rft_id=info:doi/10.26599/TST.2020.9010044&rft_dat=%3Ccrossref%3E10_26599_TST_2020_9010044%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true