uu.seUppsala universitets publikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Cost-Optimal Caching for D2D Networks with Presence of User Mobility
Southwest Jiaotong Univ, Inst Mobile Commun, Chengdu, Sichuan, Peoples R China..
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi. Komar Univ Sci & Technol, Dept Comp Engn, Sulaymaniyah, Iraq..
Southwest Jiaotong Univ, Inst Mobile Commun, Chengdu, Sichuan, Peoples R China..
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
2017 (engelsk)Inngår i: GLOBECOM 2017 - 2017 IEEE Global Communications Conference, IEEE , 2017Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Caching popular files at user equipments (UEs) provides an effective way to alleviate the burden of the back-haul networks. Generally, popularity based caching is not a system-wide optimal strategy, especially for mobility scenarios. Motivated by this observation, an optimal caching problem with respect to user mobility is investigated. To be specific, a cost-optimal caching problem (COCP) for device-to-device (D2D) networks is formulated, in which the impact of user mobility, cache size, and total number of encoded file segments are considered. Compared with the related studies, our investigation guarantees that the collected segments are non-overlapping, takes into account the cost of downloading from the network, and provides a rigorous complexity analysis. For problem solving, we first prove that the optimal caching placement of one user, giving other users' caching placements, can be derived in polynomial time. Then, based on this proof, a fast yet effective caching placement algorithm for all users is developed. Simulation results verify the effectiveness of this algorithm by comparing it to conventional caching algorithms.

sted, utgiver, år, opplag, sider
IEEE , 2017.
Serie
IEEE Global Communications Conference, ISSN 2334-0983
Emneord [en]
Backhaul networks, caching, D2D, user mobility
HSV kategori
Identifikatorer
URN: urn:nbn:se:uu:diva-357086DOI: 10.1109/GLOCOM.2017.8254033ISI: 000428054300113ISBN: 978-1-5090-5019-2 (digital)OAI: oai:DiVA.org:uu-357086DiVA, id: diva2:1238002
Konferanse
IEEE Global Communications Conference (GLOBECOM), DEC 04-08, 2017, YourSingapore, Singapore, SINGAPORE
Forskningsfinansiär
Swedish Research CouncilTilgjengelig fra: 2018-08-10 Laget: 2018-08-10 Sist oppdatert: 2018-08-10bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Ahani, GhafourYuan, Di

Søk i DiVA

Av forfatter/redaktør
Ahani, GhafourYuan, Di
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 128 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf