Multi-hop cooperative caching in social IoT using matching theory

Li Wang, Huaqing Wu, Zhu Han, Ping Zhang, H. Vincent Poor

Research output: Contribution to journalArticlepeer-review

30 Scopus citations

Abstract

It is envisioned that the Internet of Things (IoT) will provide promising opportunities to users, manufacturers, and service providers with a wide applicability in many fields. By employing social networking and device-to-device (D2D) communications in the IoT, the resulting social IoT can potentially provide services more effectively and efficiently. This paper focuses on content sharing among smart objects (devices) in the social IoT with D2D-based cooperative coded caching. Generally, complete content items or coded fragments are allowed to be delivered via multi-hop cooperative D2D communications. First, aiming at maximizing the overall success rate of multi-hop-based content sharing, the interplay between coding parameter optimization and wireless resource allocation is investigated by considering both physical and social characteristics. Moreover, a Roth and Vande Vate-based distributed scheme is proposed to solve the dynamic matching problem between the content helpers and content requesters. Numerical results demonstrate that the proposed scheme can achieve a good tradeoff between system performance and computational complexity.

Original languageEnglish (US)
Pages (from-to)2127-2145
Number of pages19
JournalIEEE Transactions on Wireless Communications
Volume17
Issue number4
DOIs
StatePublished - Apr 2018

All Science Journal Classification (ASJC) codes

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

Keywords

  • Device-to-device communications
  • cooperative content sharing
  • distributed caching
  • distributed matching
  • social internet of things

Fingerprint Dive into the research topics of 'Multi-hop cooperative caching in social IoT using matching theory'. Together they form a unique fingerprint.

Cite this