Multi-Winner Auction Based Mobile User Caching in D2D-Enabled Cellular Networks

Abstract

In device-to-device (D2D) enabled caching cellular networks, user terminals (UTs) collaboratively store and share a large volume of popular contents from the base stations (BSs) for traffic offloading and delay reduction. In this paper, the multi-winner auction based caching placement in D2D-enabled caching cellular networks is investigated for UT edge caching incentive and content caching redundancy reduction. Firstly, a multi-winner once auction caching placement (MOAC) algorithm is proposed. The maximum social welfare problem is solved by semidefinite programming (SDP) relaxation to obtain a near optimal caching placement. Moreover, the pricing strategy of the auction is developed as a Nash bargaining game. We further propose a multi-winner repeated auction based caching placement (MRAC) algorithm, which can greatly reduce the computation complexity with tiny performance loss. Simulation results show that the proposed algorithms can reduce the traffic load and the average content access delay effectively compared with the existing caching placement algorithms.