Caching Placement in Stochastic Wireless Caching Helper Networks: Channel Selection Diversity via Caching

Chae, Seong Ho; Choi, Wan

doi:10.1109/twc.2016.2586841

Cited by 155 publications

(108 citation statements)

References 27 publications

Supporting

Mentioning

107

Contrasting

Order By: Relevance

“…It's obvious that cache nodes should store the most popular files if each user can get access to only one cache node. However, the papers [3], [4] showed that caching files randomly with optimized caching probabilities is better than storing the most popular files at each cache node when one user can be served by multiple cache nodes. In [5], the authors took user mobility into consideration, where each user can move among the service regions of different cache nodes.…”

Section: A Related Workmentioning

confidence: 99%

Joint Optimization of File Placement and Delivery in Cache-Assisted Wireless Networks With Limited Lifetime and Cache Space

Wang

Cui

et al. 2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

In this paper, the scheduling of downlink file transmission in one cell with the assistance of cache nodes with finite cache space is studied. Specifically, requesting users arrive randomly and the base station (BS) reactively multicasts files to the requesting users and selected cache nodes. The latter can offload the traffic in their coverage areas from the BS. We consider the joint optimization of the abovementioned file placement and delivery within a finite lifetime subject to the cache space constraint.Within the lifetime, the allocation of multicast power and symbol number for each file transmission at the BS is formulated as a dynamic programming problem with a random stage number. Note that there are no existing solutions to this problem. We develop an asymptotically optimal solution framework by transforming the original problem to an equivalent finite-horizon Markov decision process (MDP) with a fixed stage number. A novel approximation approach is then proposed to address the curse of dimensionality, where the analytical expressions of approximate value functions are provided. We also derive analytical bounds on the exact value function and approximation error. The approximate value functions depend on some system statistics, e.g., requesting users' distribution. One reinforcement learning algorithm is proposed for the scenario where these statistics are unknown.

show abstract

Section: A Related Workmentioning

confidence: 99%

Joint Optimization of File Placement and Delivery in Cache-Assisted Wireless Networks With Limited Lifetime and Cache Space

Wang

Cui

et al. 2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…In this scenario, the content placement [93] is a relevant task that researchers are working on. In particular, researchers are working on Mobile Edge Computing (MEC) [94] and on what, where, when, and how to log cache contents.…”

Section: Cachingmentioning

confidence: 99%

Orchestration and Control in Software‐Defined 5G Networks: Research Challenges

Nencioni

Garroppo

Gonzalez

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

The fifth generation (5G) of cellular networks promises to be a major step in the evolution of wireless technology. 5G is planned to be used in a very broad set of application scenarios. These scenarios have strict heterogeneous requirements that will be accomplished by enhancements on the radio access network and a collection of innovative wireless technologies. Softwarization technologies, such as Software-Defined Networking (SDN) and Network Function Virtualization (NFV), will play a key role in integrating these different technologies. Network slicing emerges as a cost-efficient solution for the implementation of the diverse 5G requirements and verticals. The 5G radio access and core networks will be based on a SDN/NFV infrastructure, which will be able to orchestrate the resources and control the network in order to efficiently and flexibly and with scalability provide network services. In this paper, we present the up-to-date status of the software-defined 5G radio access and core networks and a broad range of future research challenges on the orchestration and control aspects.

show abstract

“…As a result, some other works have considered optimal caching designs in large-scale small cell networks or HetNets [21]- [25]. In [21] and [22], the authors consider random caching at SBSs, and analyze and optimize the cache hit probability (i.e., the probability that a randomly requested file from the typical user is stored at its serving BS) [21] and successful offloading probability (i.e., the probability that the typical user is associated with the SBS tier and its downlink signal-to-interference-plus-noise ratio is larger than a threshold) [22].…”

Section: Introductionmentioning

confidence: 99%

“…In [24], the authors propose a hybrid caching design (consisting of identical caching in the MBS tier and random caching in the SBS tier) and a corresponding multicasting design in a large-scale HetNet, and analyze and optimize the successful transmission probability. In [25], the authors investigate how channel selection diversity affects the optimal random caching design. Note that, none of the above works [14]- [25] has considered SBS cooperation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Random caching based cooperative transmission in heterogeneous wireless networks

Wen

Cui

Zheng

et al. 2017

2017 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Base station cooperation in heterogeneous wireless networks (HetNets) is a promising approach to improve the network performance, but it also imposes a significant challenge on backhaul. On the other hand, caching at small base stations (SBSs) is considered as an efficient way to reduce backhaul load in HetNets. In this paper, we jointly consider SBS caching and cooperation in a downlink largescale HetNet. We propose two SBS cooperative transmission schemes under random caching at SBSs with the caching distribution as a design parameter. Using tools from stochastic geometry and adopting appropriate integral transformations, we first derive a tractable expression for the successful transmission probability under each scheme. Then, under each scheme, we consider the successful transmission probability maximization by optimizing the caching distribution, which is a challenging optimization problem with a non-convex objective function. By exploring optimality properties and using optimization techniques, under each scheme, we obtain a local optimal solution in the general case and global optimal solutions in some special cases. Compared with some existing caching designs in the literature, e.g., the most popular caching, the i.i.d. caching and the uniform caching, the optimal random caching under each scheme achieves better successful transmission probability performance. The analysis and optimization results provide valuable design insights for practical HetNets.

show abstract

Caching Placement in Stochastic Wireless Caching Helper Networks: Channel Selection Diversity via Caching

Cited by 155 publications

References 27 publications

Joint Optimization of File Placement and Delivery in Cache-Assisted Wireless Networks With Limited Lifetime and Cache Space

Joint Optimization of File Placement and Delivery in Cache-Assisted Wireless Networks With Limited Lifetime and Cache Space

Orchestration and Control in Software‐Defined 5G Networks: Research Challenges

Random caching based cooperative transmission in heterogeneous wireless networks

Contact Info

Product

Resources

About