On the analysis of cellular networks with caching and coordinated device-to-device communication

Afzal, Asma; Zaidi, Syed Ali Raza; McLernon, Des; Ghogho, Mounir

doi:10.1109/icc.2016.7510696

Cited by 9 publications

(6 citation statements)

References 41 publications

(93 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using Eqs. (5) and (9), it can be derived that the average content download time for a content i can be expressed as…”

Section: A Problem Definitionmentioning

confidence: 99%

“…In this framework, it has been considered that caching popular contents in the cache memory of the mobile devices could result in a two-fold gain: i) offload traffic from the core network, since requests for the same content can be satisfied locally through device-to-device (D2D) communication and ii) achieve high downloading times given the high rates that D2D links can provide [5]. In particular, installing cache memories to the end users allows a content request to be satisfied locally, thus avoiding using x-haul (back/mid/front-haul) connections and, consequently, decreasing service time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Joint Consideration of Content Popularity and Size in Device-to-Device Caching Scenarios

Κόλλιας

Antonopoulos

2020

ICC 2020 - 2020 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Content caching has been considered by both academia and industry as an efficient solution to tackle the problem of the back-haul becoming the bottleneck in the service of users in future heterogeneous cellular networks. Most of the related caching-oriented studies are based on the content popularity, overlooking the impact of content size on their analysis. In this context, this work studies content caching in an environment where cellular users are equipped with cache memories. In particular, we formulate the content caching as an optimization problem, where the objective is to minimize the average download latency of popular videos through self-caching and device-to-device (D2D) caching and, consequently, increase the network throughput. In addition, in order to solve this problem in real-time scenarios, we introduce a low-complexity utility-based algorithm, which accounts for parameters such as the size and the popularity of the requested contents, as well as the density of the end users. Finally, we provide extensive simulation results that validate our analysis and prove that our innovative scheme outperforms other existing solutions.

show abstract

“…Using Eqs. (5) and (9), it can be derived that the average content download time for a content i can be expressed as…”

Section: A Problem Definitionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Joint Consideration of Content Popularity and Size in Device-to-Device Caching Scenarios

Κόλλιας

Antonopoulos

2020

ICC 2020 - 2020 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…It was further shown in [14] that a multi-hop transmission provides a significant throughput gain over one-hop direct transmission for Ad-Hoc networks with cached users. For cache-enabled cellular networks with coordinated D2D communications, cellular and D2D coverage probabilities were derived in [15]. In [16]- [18], multicast beamforming was investigated for cache-enabled content-centric networks.…”

Section: Introductionmentioning

confidence: 99%

Cache Placement in Two-Tier HetNets With Limited Storage Capacity: Cache or Buffer?

Yang

Pan

et al. 2018

IEEE Trans. Commun.

View full text Add to dashboard Cite

In this paper, we aim to minimize the average file transmission delay via bandwidth allocation and cache placement in two-tier heterogeneous networks with limited storage capacity, which consists of cache capacity and buffer capacity. For average delay minimization problem with fixed bandwidth allocation, although this problem is nonconvex, the optimal solution is obtained in closed form by comparing all locally optimal solutions calculated from solving the Karush-Kuhn-Tucker conditions. To jointly optimize bandwidth allocation and cache placement, the optimal bandwidth allocation is first derived and then substituted into the original problem. The structure of the optimal caching strategy is presented, which shows that it is optimal to cache the files with high popularity instead of the files with big size. Based on this optimal structure, we propose an iterative algorithm with low complexity to obtain a suboptimal solution, where the closedfrom expression is obtained in each step. Numerical results show the superiority of our solution compared to the conventional cache strategy without considering cache and buffer tradeoff in terms of delay.Index Terms-Caching policy, heterogeneous networks, cache and buffer, bandwidth allocation.

show abstract

“…By densely deploying low-power low-cost small cell base stations (SBSs), network system can improve local coverage, bandwidth efficiency, network throughput, and energy efficiency [1,2,4]. However, small cell networks cannot solve the problem of backhaul congestion.…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, classical ways of improving cellular network capacity have suffered from physical and economical limitations. Therefore, current research on 5G networks is geared towards developing intelligent ways of data dissemination by deviating from the traditional network architecture [1][2][3].…”

Section: Introductionmentioning

confidence: 99%

D2D-Enabled Small Cell Network Control Scheme Based on the Dynamic Stackelberg Game

Kim

2017

Mobile Information Systems

View full text Add to dashboard Cite

For current and future cellular networks, small cell structure with licensed and unlicensed bandwidth, caching content provisioning, and device-to-device (D2D) communications is seen as a necessary architecture. Recently, a series of control methods have been developed to address a myriad of challenges in next-generation small cell networks. In this study, we focus on the design of novel D2D-enabled small cell network control scheme by allowing caching and unlicensed D2D communications. Motivated by game theory and learning algorithm, the proposed scheme adaptively selects caching contents and splits the available bandwidth for licensed and unlicensed communications. Under dynamically changing network environments, we capture the dynamics of the network system and design a new dynamic Stackelberg game model. Based on a hierarchical and feedback based control manner, small base stations and users can be leaders or followers dynamically while improving 5G network performance. Simulations and performance analysis verify the efficiency of the proposed scheme, showing that our approach can outperform existing schemes by about 5%∼15% in terms of bandwidth utilization, cache hit ratio, and system throughput.

show abstract

On the analysis of cellular networks with caching and coordinated device-to-device communication

Cited by 9 publications

References 41 publications

Joint Consideration of Content Popularity and Size in Device-to-Device Caching Scenarios

Joint Consideration of Content Popularity and Size in Device-to-Device Caching Scenarios

Cache Placement in Two-Tier HetNets With Limited Storage Capacity: Cache or Buffer?

D2D-Enabled Small Cell Network Control Scheme Based on the Dynamic Stackelberg Game

Contact Info

Product

Resources

About