Mobility-Aware Caching in D2D Networks

Rui Wang, Jun Zhang, S. H. Song, Khaled Letaief

Research output: Contribution to journalArticle

49 Citations (Scopus)

Abstract

Caching at mobile devices can facilitate device-to-device (D2D) communications, which may significantly improve spectrum efficiency and alleviate the heavy burden on backhaul links. However, most previous works ignored user mobility, thus having limited practical applications. In this paper, we take advantage of the user mobility pattern by the inter-contact times between different users, and propose a mobility-aware caching placement strategy to maximize the data offloading ratio, which is defined as the percentage of the requested data that can be delivered via D2D links rather than through base stations. Given the NP-hard caching placement problem, we first propose an optimal dynamic programming algorithm to obtain a performance benchmark with much lower complexity than exhaustive search. We then prove that the problem falls in the category of monotone submodular maximization over a matroid constraint, and propose a time-efficient greedy algorithm, which achieves an approximation ratio as 12. Simulation results with real-life data sets will validate the effectiveness of our proposed mobility-aware caching placement strategy. We observe that users moving at either a very low or very high speed should cache the most popular files, while users moving at a medium speed should cache less popular files to avoid duplication.

Original languageEnglish
Article number7932468
Pages (from-to)5001-5015
Number of pages15
JournalIEEE Transactions on Wireless Communications
Volume16
Issue number8
DOIs
Publication statusPublished - 1 Aug 2017
Externally publishedYes

Fingerprint

Caching
Placement
Dynamic programming
Mobile devices
Base stations
Cache
Communication
Exhaustive Search
Duplication
Greedy Algorithm
Matroid
Mobile Devices
Low Complexity
Dynamic Programming
Percentage
Monotone
High Speed
Efficient Algorithms
NP-complete problem
Maximise

Keywords

  • Caching
  • device-to-device communications
  • human mobility
  • matroid constraint
  • submodular function

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Mobility-Aware Caching in D2D Networks. / Wang, Rui; Zhang, Jun; Song, S. H.; Letaief, Khaled.

In: IEEE Transactions on Wireless Communications, Vol. 16, No. 8, 7932468, 01.08.2017, p. 5001-5015.

Research output: Contribution to journalArticle

Wang, Rui ; Zhang, Jun ; Song, S. H. ; Letaief, Khaled. / Mobility-Aware Caching in D2D Networks. In: IEEE Transactions on Wireless Communications. 2017 ; Vol. 16, No. 8. pp. 5001-5015.
@article{843d9b3a7ba142659f24d9a2ccccb951,
title = "Mobility-Aware Caching in D2D Networks",
abstract = "Caching at mobile devices can facilitate device-to-device (D2D) communications, which may significantly improve spectrum efficiency and alleviate the heavy burden on backhaul links. However, most previous works ignored user mobility, thus having limited practical applications. In this paper, we take advantage of the user mobility pattern by the inter-contact times between different users, and propose a mobility-aware caching placement strategy to maximize the data offloading ratio, which is defined as the percentage of the requested data that can be delivered via D2D links rather than through base stations. Given the NP-hard caching placement problem, we first propose an optimal dynamic programming algorithm to obtain a performance benchmark with much lower complexity than exhaustive search. We then prove that the problem falls in the category of monotone submodular maximization over a matroid constraint, and propose a time-efficient greedy algorithm, which achieves an approximation ratio as 12. Simulation results with real-life data sets will validate the effectiveness of our proposed mobility-aware caching placement strategy. We observe that users moving at either a very low or very high speed should cache the most popular files, while users moving at a medium speed should cache less popular files to avoid duplication.",
keywords = "Caching, device-to-device communications, human mobility, matroid constraint, submodular function",
author = "Rui Wang and Jun Zhang and Song, {S. H.} and Khaled Letaief",
year = "2017",
month = "8",
day = "1",
doi = "10.1109/TWC.2017.2705038",
language = "English",
volume = "16",
pages = "5001--5015",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - Mobility-Aware Caching in D2D Networks

AU - Wang, Rui

AU - Zhang, Jun

AU - Song, S. H.

AU - Letaief, Khaled

PY - 2017/8/1

Y1 - 2017/8/1

N2 - Caching at mobile devices can facilitate device-to-device (D2D) communications, which may significantly improve spectrum efficiency and alleviate the heavy burden on backhaul links. However, most previous works ignored user mobility, thus having limited practical applications. In this paper, we take advantage of the user mobility pattern by the inter-contact times between different users, and propose a mobility-aware caching placement strategy to maximize the data offloading ratio, which is defined as the percentage of the requested data that can be delivered via D2D links rather than through base stations. Given the NP-hard caching placement problem, we first propose an optimal dynamic programming algorithm to obtain a performance benchmark with much lower complexity than exhaustive search. We then prove that the problem falls in the category of monotone submodular maximization over a matroid constraint, and propose a time-efficient greedy algorithm, which achieves an approximation ratio as 12. Simulation results with real-life data sets will validate the effectiveness of our proposed mobility-aware caching placement strategy. We observe that users moving at either a very low or very high speed should cache the most popular files, while users moving at a medium speed should cache less popular files to avoid duplication.

AB - Caching at mobile devices can facilitate device-to-device (D2D) communications, which may significantly improve spectrum efficiency and alleviate the heavy burden on backhaul links. However, most previous works ignored user mobility, thus having limited practical applications. In this paper, we take advantage of the user mobility pattern by the inter-contact times between different users, and propose a mobility-aware caching placement strategy to maximize the data offloading ratio, which is defined as the percentage of the requested data that can be delivered via D2D links rather than through base stations. Given the NP-hard caching placement problem, we first propose an optimal dynamic programming algorithm to obtain a performance benchmark with much lower complexity than exhaustive search. We then prove that the problem falls in the category of monotone submodular maximization over a matroid constraint, and propose a time-efficient greedy algorithm, which achieves an approximation ratio as 12. Simulation results with real-life data sets will validate the effectiveness of our proposed mobility-aware caching placement strategy. We observe that users moving at either a very low or very high speed should cache the most popular files, while users moving at a medium speed should cache less popular files to avoid duplication.

KW - Caching

KW - device-to-device communications

KW - human mobility

KW - matroid constraint

KW - submodular function

UR - http://www.scopus.com/inward/record.url?scp=85029580610&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029580610&partnerID=8YFLogxK

U2 - 10.1109/TWC.2017.2705038

DO - 10.1109/TWC.2017.2705038

M3 - Article

VL - 16

SP - 5001

EP - 5015

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 8

M1 - 7932468

ER -