LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint

Photo from wikipedia

Pre-caching popular files at mobile users with the aid of device-to-device (D2D) communications can offload the data traffic to low-cost D2D links and reduce the network transmission cost. This leads… Click to show full abstract

Pre-caching popular files at mobile users with the aid of device-to-device (D2D) communications can offload the data traffic to low-cost D2D links and reduce the network transmission cost. This leads to additional cache leasing cost brought by the lease of storage from mobile users. Besides, newly-emerging video-related applications also pose strict requirement on the network delay. Thus, it is of great significance to design caching strategies considering the transmission cost, the cache leasing cost and the delay. As the movement of mobile users can improve the communication opportunities among different users and increase the cache hit ratio, in this paper, mobility-aware caching strategies are designed to minimize the network cost including both the transmission cost and the cache leasing cost with the delay constraint. In specific, by characterizing the user mobility as an inter-contact model, analytical expressions of the average network cost and the average file delivery delay are derived and a cost-oriented mobility-aware caching problem is formulated. To handle this mixed integer nonlinear programming (MINLP) problem, we first relax the binary cache placement indicator as a continuous one and prove that both the average network cost and the average file delivery delay are convex. Hence, an iterative caching algorithm is proposed with the successive convex approximation method. Moreover, to lower the complexity, combinatorial optimization method is adopted. Firstly, to make the caching problem tractable, the average file delivery delay constraint is implicitly added in the cost objective function as a penalty term. Then, the reformulated objective function is proved to have the non-monotone submodular property and thus a modified low-complexity greedy caching strategy is proposed. Simulation results show that, compared with the most popular caching strategy, our proposed mobility-aware caching strategy can reduce the average cost by 46% when the user speed is high.

Keywords: mobility; mobility aware; aware caching; caching strategies; delay; cost

Journal Title: IEEE Access
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.