713 research outputs found
Recommended from our members
Resource allocation for cache-enabled cloud-based small cell networks
To address the serious challenge of satisfying explosively increasing multimedia content requests from a massive number of users in mobile networks, deploying content caching in base stations to offload network traffic while satisfying content requests locally has been regarded as an effective approach to enhance the network performance. Moreover, content delivery via wireless transmissions in a cache-enabled mobile network needs to be optimized taking the proactive caching policy into consideration. Accordingly, in this paper, we investigate and propose an efficient resource allocation framework for cache-enabled cloud-based small cell networks (C-SCNs) to achieve the benefits of content caching by considering two phases, i.e., content placement and content delivery. In particular, for the content placement phase, we propose a low-complexity distributed popularity-based framework for allocating cache sizes of SBSs to popular contents, in order to offload network traffic and satisfy content requests locally. For the content delivery phase, we propose a low-complexity joint user association and subcarrier-power allocation scheme for min-rate guaranteed content delivery over orthogonal frequency division multiple access (OFDMA) based downlink transmissions. Trace-based simulations and numerical results demonstrate the effectiveness of the proposed schemes in the cache-enabled C-SCNs
Cost-Effective Cache Deployment in Mobile Heterogeneous Networks
This paper investigates one of the fundamental issues in cache-enabled
heterogeneous networks (HetNets): how many cache instances should be deployed
at different base stations, in order to provide guaranteed service in a
cost-effective manner. Specifically, we consider two-tier HetNets with
hierarchical caching, where the most popular files are cached at small cell
base stations (SBSs) while the less popular ones are cached at macro base
stations (MBSs). For a given network cache deployment budget, the cache sizes
for MBSs and SBSs are optimized to maximize network capacity while satisfying
the file transmission rate requirements. As cache sizes of MBSs and SBSs affect
the traffic load distribution, inter-tier traffic steering is also employed for
load balancing. Based on stochastic geometry analysis, the optimal cache sizes
for MBSs and SBSs are obtained, which are threshold-based with respect to cache
budget in the networks constrained by SBS backhauls. Simulation results are
provided to evaluate the proposed schemes and demonstrate the applications in
cost-effective network deployment
Cooperative Local Caching under Heterogeneous File Preferences
Local caching is an effective scheme for leveraging the memory of the mobile
terminal (MT) and short range communications to save the bandwidth usage and
reduce the download delay in the cellular communication system. Specifically,
the MTs first cache in their local memories in off-peak hours and then exchange
the requested files with each other in the vicinity during peak hours. However,
prior works largely overlook MTs' heterogeneity in file preferences and their
selfish behaviours. In this paper, we practically categorize the MTs into
different interest groups according to the MTs' preferences. Each group of MTs
aims to increase the probability of successful file discovery from the
neighbouring MTs (from the same or different groups). Hence, we define the
groups' utilities as the probability of successfully discovering the file in
the neighbouring MTs, which should be maximized by deciding the caching
strategies of different groups. By modelling MTs' mobilities as homogeneous
Poisson point processes (HPPPs), we analytically characterize MTs' utilities in
closed-form. We first consider the fully cooperative case where a centralizer
helps all groups to make caching decisions. We formulate the problem as a
weighted-sum utility maximization problem, through which the maximum utility
trade-offs of different groups are characterized. Next, we study two benchmark
cases under selfish caching, namely, partial and no cooperation, with and
without inter-group file sharing, respectively. The optimal caching
distributions for these two cases are derived. Finally, numerical examples are
presented to compare the utilities under different cases and show the
effectiveness of the fully cooperative local caching compared to the two
benchmark cases
- …