Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint
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-e...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8926452/ |
| _version_ | 1819276404228882432 |
|---|---|
| author | Ruijin Sun Tingting Yang Ailing Wang Meng Qin Zixuan Fei Ying Wang |
| author_facet | Ruijin Sun Tingting Yang Ailing Wang Meng Qin Zixuan Fei Ying Wang |
| author_sort | Ruijin Sun |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-23T23:39:41Z |
| format | Article |
| id | doaj.art-75cd517299cf4aeba74d02dc19febc4f |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-23T23:39:41Z |
| publishDate | 2019-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-75cd517299cf4aeba74d02dc19febc4f2022-12-21T17:25:44ZengIEEEIEEE Access2169-35362019-01-01717702317703410.1109/ACCESS.2019.29582618926452Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay ConstraintRuijin Sun0https://orcid.org/0000-0002-4403-9893Tingting Yang1https://orcid.org/0000-0002-7406-2170Ailing Wang2https://orcid.org/0000-0001-7240-3544Meng Qin3https://orcid.org/0000-0002-4130-4751Zixuan Fei4https://orcid.org/0000-0002-8959-9317Ying Wang5https://orcid.org/0000-0002-4494-6389Peng Cheng Laboratory, Shenzhen, ChinaSchool of Electrical Engineering and Intelligentization, Dongguan University of Technology, Dongguan, ChinaChina Mobile Research Institute, Beijing, ChinaSchool of Electronics and Computer Engineering, Peking University, Shenzhen, ChinaState Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, ChinaState Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, ChinaPre-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.https://ieeexplore.ieee.org/document/8926452/Average file delivery delaycache leasing costD2D networksmobility-aware caching strategy |
| spellingShingle | Ruijin Sun Tingting Yang Ailing Wang Meng Qin Zixuan Fei Ying Wang Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint IEEE Access Average file delivery delay cache leasing cost D2D networks mobility-aware caching strategy |
| title | Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint |
| title_full | Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint |
| title_fullStr | Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint |
| title_full_unstemmed | Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint |
| title_short | Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint |
| title_sort | cost oriented mobility aware caching strategies in d2d networks with delay constraint |
| topic | Average file delivery delay cache leasing cost D2D networks mobility-aware caching strategy |
| url | https://ieeexplore.ieee.org/document/8926452/ |
| work_keys_str_mv | AT ruijinsun costorientedmobilityawarecachingstrategiesind2dnetworkswithdelayconstraint AT tingtingyang costorientedmobilityawarecachingstrategiesind2dnetworkswithdelayconstraint AT ailingwang costorientedmobilityawarecachingstrategiesind2dnetworkswithdelayconstraint AT mengqin costorientedmobilityawarecachingstrategiesind2dnetworkswithdelayconstraint AT zixuanfei costorientedmobilityawarecachingstrategiesind2dnetworkswithdelayconstraint AT yingwang costorientedmobilityawarecachingstrategiesind2dnetworkswithdelayconstraint |