uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • 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 University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. Komar Univ Sci & Technol, Dept Comp Engn, Sulaymaniyah, Iraq..
Southwest Jiaotong Univ, Inst Mobile Commun, Chengdu, Sichuan, Peoples R China..
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
2017 (English)In: GLOBECOM 2017 - 2017 IEEE Global Communications Conference, IEEE , 2017Conference paper, Published paper (Refereed)
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.

Place, publisher, year, edition, pages
IEEE , 2017.
Series
IEEE Global Communications Conference, ISSN 2334-0983
Keywords [en]
Backhaul networks, caching, D2D, user mobility
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-357086DOI: 10.1109/GLOCOM.2017.8254033ISI: 000428054300113ISBN: 978-1-5090-5019-2 (electronic)OAI: oai:DiVA.org:uu-357086DiVA, id: diva2:1238002
Conference
IEEE Global Communications Conference (GLOBECOM), DEC 04-08, 2017, YourSingapore, Singapore, SINGAPORE
Funder
Swedish Research CouncilAvailable from: 2018-08-10 Created: 2018-08-10 Last updated: 2018-08-10Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Ahani, GhafourYuan, Di

Search in DiVA

By author/editor
Ahani, GhafourYuan, Di
By organisation
Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 126 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf