On User Cooperative Caching by Reverse Auction

Abstract

Caching is a very effective way to offload data traffic; and when users participate in the caching game, the costs are greatly reduced. Therefore, this paper proposes a novel scheme that user terminals (UTs) cooperatively cache popular services to the intelligent routing relay (IRR) side. We use reverse auction model to motivate UTs to collaborate and cache, since UTs are rational and selfish. In this model, IRR purchases popular services from UTs and assigns rewards to UTs. UTs use personal data traffic to obtain popular services and then cache them to the IRR side. In order to minimize UTs' waiting time while maximizing total social incomes, we use an online reverse auction strategy, first-come-first-served (FCFS) strategy to allocate winning services to UTs. Simulation results verify the effectiveness of the FCFS strategy and show that the performances of FCFS are better than those of random allocation (RA) strategy in terms of incomes, completion rate and user waiting time. Experimental results further verify the authenticity, feasibility and the efficiency of the proposed scheme.