Dynamic Resource Matching for Socially Cooperative Caching in IoT Networking

This work investigates content sharing among smart objects (devices) via device-to-device (D2D) communications in the social Internet of Things (IoT) by exploiting distributed content coding schemes. Aiming at minimizing the overall transmission cost, the resource matching between content transmitters and content receivers is optimized by applying matching theory. Particularly, the dynamic distributed Roth and Vande Vate algorithm is employed to optimize the matching problem, achieving a lower computational complexity and a higher system stability. In addition, social characteristics among mobile users are also exploited in the optimization problem to further increase system reliability and robustness. Numerical results demonstrate the effectiveness of the proposed scheme.

I. Introduction

The Internet of Things (IoT) is envisioned to provide promising opportunities to users, equipment manufacturers, and service providers with a wide applicability in many fields [1]. Objects involved in IoT will have the ability to collect information and communicate with one another, bringing physical world data into the world of digital content and services. However, the amount of data collected in IoT is expected to be extremely large, and thus transmitting these data wirelessly will lead to congested backhaul and spectrum overcrowding problems.