On Social-Aware Content Caching for D2D-Enabled Cellular Networks with Matching Theory

Jun Li, Miao Liu, Jinhui Lu, Feng Shu, Yijin Zhang, Siavash Bayat, Dushantha Nalin K. Jayakody

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper, the problem of content caching in 5G cellular networks relying on social-aware device-to-device (D2D) communications is investigated. Our focus is on how to efficiently select important users (IUs) and how to allocate content files to the storage of these selected IUs to form a distributed caching system. We aim at proposing a novel approach for minimizing the downloading latency and maximizing the social welfare simultaneously. In particular, we first model the problem of maximizing the social welfare as a many-to-one matching game based on the social property of mobile users. We study this game by exploiting users’ social properties to generate the utility functions of the two-side players, i.e., content providers (CP) and IUs. Then we model the problem of minimizing the downloading latency as a many-to-many matching problem. For solving these games, we design a many-to-one IU selection (MOIS) matching algorithm and a many-to-many file allocation (MMFA) matching algorithm, respectively. Simulation and analytical results show that the proposed mechanisms are stable, and are capable of offering a better performance than other benchmarks in terms of social welfare and network downloading latency.

Original languageEnglish
JournalIEEE Internet of Things Journal
DOIs
Publication statusAccepted/In press - 4 Sep 2017

Fingerprint

Communication
Latency
Social welfare
Matching problem
Social networks
Benchmark
Utility function
Simulation
Distributed systems
Game design

Keywords

  • 5G mobile communication
  • Cellular network
  • content caching
  • D2D
  • Device-to-device communication
  • download latency.
  • Games
  • Internet of Things
  • mobile social network
  • Resource management
  • Social network services
  • social welfare

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems
  • Hardware and Architecture
  • Computer Science Applications
  • Computer Networks and Communications
  • Information Systems and Management

Cite this

On Social-Aware Content Caching for D2D-Enabled Cellular Networks with Matching Theory. / Li, Jun; Liu, Miao; Lu, Jinhui; Shu, Feng; Zhang, Yijin; Bayat, Siavash; Jayakody, Dushantha Nalin K.

In: IEEE Internet of Things Journal, 04.09.2017.

Research output: Contribution to journalArticle

@article{c3c9837a975b46469f1f3c8e56dd6844,
title = "On Social-Aware Content Caching for D2D-Enabled Cellular Networks with Matching Theory",
abstract = "In this paper, the problem of content caching in 5G cellular networks relying on social-aware device-to-device (D2D) communications is investigated. Our focus is on how to efficiently select important users (IUs) and how to allocate content files to the storage of these selected IUs to form a distributed caching system. We aim at proposing a novel approach for minimizing the downloading latency and maximizing the social welfare simultaneously. In particular, we first model the problem of maximizing the social welfare as a many-to-one matching game based on the social property of mobile users. We study this game by exploiting users’ social properties to generate the utility functions of the two-side players, i.e., content providers (CP) and IUs. Then we model the problem of minimizing the downloading latency as a many-to-many matching problem. For solving these games, we design a many-to-one IU selection (MOIS) matching algorithm and a many-to-many file allocation (MMFA) matching algorithm, respectively. Simulation and analytical results show that the proposed mechanisms are stable, and are capable of offering a better performance than other benchmarks in terms of social welfare and network downloading latency.",
keywords = "5G mobile communication, Cellular network, content caching, D2D, Device-to-device communication, download latency., Games, Internet of Things, mobile social network, Resource management, Social network services, social welfare",
author = "Jun Li and Miao Liu and Jinhui Lu and Feng Shu and Yijin Zhang and Siavash Bayat and Jayakody, {Dushantha Nalin K.}",
year = "2017",
month = "9",
day = "4",
doi = "10.1109/JIOT.2017.2749320",
language = "English",
journal = "IEEE Internet of Things Journal",
issn = "2327-4662",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - On Social-Aware Content Caching for D2D-Enabled Cellular Networks with Matching Theory

AU - Li, Jun

AU - Liu, Miao

AU - Lu, Jinhui

AU - Shu, Feng

AU - Zhang, Yijin

AU - Bayat, Siavash

AU - Jayakody, Dushantha Nalin K.

PY - 2017/9/4

Y1 - 2017/9/4

N2 - In this paper, the problem of content caching in 5G cellular networks relying on social-aware device-to-device (D2D) communications is investigated. Our focus is on how to efficiently select important users (IUs) and how to allocate content files to the storage of these selected IUs to form a distributed caching system. We aim at proposing a novel approach for minimizing the downloading latency and maximizing the social welfare simultaneously. In particular, we first model the problem of maximizing the social welfare as a many-to-one matching game based on the social property of mobile users. We study this game by exploiting users’ social properties to generate the utility functions of the two-side players, i.e., content providers (CP) and IUs. Then we model the problem of minimizing the downloading latency as a many-to-many matching problem. For solving these games, we design a many-to-one IU selection (MOIS) matching algorithm and a many-to-many file allocation (MMFA) matching algorithm, respectively. Simulation and analytical results show that the proposed mechanisms are stable, and are capable of offering a better performance than other benchmarks in terms of social welfare and network downloading latency.

AB - In this paper, the problem of content caching in 5G cellular networks relying on social-aware device-to-device (D2D) communications is investigated. Our focus is on how to efficiently select important users (IUs) and how to allocate content files to the storage of these selected IUs to form a distributed caching system. We aim at proposing a novel approach for minimizing the downloading latency and maximizing the social welfare simultaneously. In particular, we first model the problem of maximizing the social welfare as a many-to-one matching game based on the social property of mobile users. We study this game by exploiting users’ social properties to generate the utility functions of the two-side players, i.e., content providers (CP) and IUs. Then we model the problem of minimizing the downloading latency as a many-to-many matching problem. For solving these games, we design a many-to-one IU selection (MOIS) matching algorithm and a many-to-many file allocation (MMFA) matching algorithm, respectively. Simulation and analytical results show that the proposed mechanisms are stable, and are capable of offering a better performance than other benchmarks in terms of social welfare and network downloading latency.

KW - 5G mobile communication

KW - Cellular network

KW - content caching

KW - D2D

KW - Device-to-device communication

KW - download latency.

KW - Games

KW - Internet of Things

KW - mobile social network

KW - Resource management

KW - Social network services

KW - social welfare

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

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

U2 - 10.1109/JIOT.2017.2749320

DO - 10.1109/JIOT.2017.2749320

M3 - Article

JO - IEEE Internet of Things Journal

JF - IEEE Internet of Things Journal

SN - 2327-4662

ER -