335 research outputs found
Cooperative Caching and Transmission Design in Cluster-Centric Small Cell Networks
Wireless content caching in small cell networks (SCNs) has recently been
considered as an efficient way to reduce the traffic and the energy consumption
of the backhaul in emerging heterogeneous cellular networks (HetNets). In this
paper, we consider a cluster-centric SCN with combined design of cooperative
caching and transmission policy. Small base stations (SBSs) are grouped into
disjoint clusters, in which in-cluster cache space is utilized as an entity. We
propose a combined caching scheme where part of the available cache space is
reserved for caching the most popular content in every SBS, while the remaining
is used for cooperatively caching different partitions of the less popular
content in different SBSs, as a means to increase local content diversity.
Depending on the availability and placement of the requested content,
coordinated multipoint (CoMP) technique with either joint transmission (JT) or
parallel transmission (PT) is used to deliver content to the served user. Using
Poisson point process (PPP) for the SBS location distribution and a hexagonal
grid model for the clusters, we provide analytical results on the successful
content delivery probability of both transmission schemes for a user located at
the cluster center. Our analysis shows an inherent tradeoff between
transmission diversity and content diversity in our combined
caching-transmission design. We also study optimal cache space assignment for
two objective functions: maximization of the cache service performance and the
energy efficiency. Simulation results show that the proposed scheme achieves
performance gain by leveraging cache-level and signal-level cooperation and
adapting to the network environment and user QoS requirements.Comment: 13 pages, 10 figures, submitted for possible journal publicatio
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
Edge Caching in Dense Heterogeneous Cellular Networks with Massive MIMO Aided Self-backhaul
This paper focuses on edge caching in dense heterogeneous cellular networks
(HetNets), in which small base stations (SBSs) with limited cache size store
the popular contents, and massive multiple-input multiple-output (MIMO) aided
macro base stations provide wireless self-backhaul when SBSs require the
non-cached contents. Our aim is to address the effects of cell load and hit
probability on the successful content delivery (SCD), and present the minimum
required base station density for avoiding the access overload in an arbitrary
small cell and backhaul overload in an arbitrary macrocell. The massive MIMO
backhaul achievable rate without downlink channel estimation is derived to
calculate the backhaul time, and the latency is also evaluated in such
networks. The analytical results confirm that hit probability needs to be
appropriately selected, in order to achieve SCD. The interplay between cache
size and SCD is explicitly quantified. It is theoretically demonstrated that
when non-cached contents are requested, the average delay of the non-cached
content delivery could be comparable to the cached content delivery with the
help of massive MIMO aided self-backhaul, if the average access rate of cached
content delivery is lower than that of self-backhauled content delivery.
Simulation results are presented to validate our analysis.Comment: Accepted to appear in IEEE Transactions on Wireless Communication
Spectrum Sharing, Latency, and Security in 5G Networks with Application to IoT and Smart Grid
The surge of mobile devices, such as smartphones, and tables, demands additional capacity. On the other hand, Internet-of-Things (IoT) and smart grid, which connects numerous sensors, devices, and machines require ubiquitous connectivity and data security. Additionally, some use cases, such as automated manufacturing process, automated transportation, and smart grid, require latency as low as 1 ms, and reliability as high as 99.99\%. To enhance throughput and support massive connectivity, sharing of the unlicensed spectrum (3.5 GHz, 5GHz, and mmWave) is a potential solution. On the other hand, to address the latency, drastic changes in the network architecture is required. The fifth generation (5G) cellular networks will embrace the spectrum sharing and network architecture modifications to address the throughput enhancement, massive connectivity, and low latency.
To utilize the unlicensed spectrum, we propose a fixed duty cycle based coexistence of LTE and WiFi, in which the duty cycle of LTE transmission can be adjusted based on the amount of data. In the second approach, a multi-arm bandit learning based coexistence of LTE and WiFi has been developed. The duty cycle of transmission and downlink power are adapted through the exploration and exploitation. This approach improves the aggregated capacity by 33\%, along with cell edge and energy efficiency enhancement. We also investigate the performance of LTE and ZigBee coexistence using smart grid as a scenario.
In case of low latency, we summarize the existing works into three domains in the context of 5G networks: core, radio and caching networks. Along with this, fundamental constraints for achieving low latency are identified followed by a general overview of exemplary 5G networks. Besides that, a loop-free, low latency and local-decision based routing protocol is derived in the context of smart grid. This approach ensures low latency and reliable data communication for stationary devices.
To address data security in wireless communication, we introduce a geo-location based data encryption, along with node authentication by k-nearest neighbor algorithm. In the second approach, node authentication by the support vector machine, along with public-private key management, is proposed. Both approaches ensure data security without increasing the packet overhead compared to the existing approaches
Soft Cache Hits and the Impact of Alternative Content Recommendations on Mobile Edge Caching
Caching popular content at the edge of future mobile networks has been widely
considered in order to alleviate the impact of the data tsunami on both the
access and backhaul networks. A number of interesting techniques have been
proposed, including femto-caching and "delayed" or opportunistic cache access.
Nevertheless, the majority of these approaches suffer from the rather limited
storage capacity of the edge caches, compared to the tremendous and rapidly
increasing size of the Internet content catalog. We propose to depart from the
assumption of hard cache misses, common in most existing works, and consider
"soft" cache misses, where if the original content is not available, an
alternative content that is locally cached can be recommended. Given that
Internet content consumption is increasingly entertainment-oriented, we believe
that a related content could often lead to complete or at least partial user
satisfaction, without the need to retrieve the original content over expensive
links. In this paper, we formulate the problem of optimal edge caching with
soft cache hits, in the context of delayed access, and analyze the expected
gains. We then show using synthetic and real datasets of related video contents
that promising caching gains could be achieved in practice
- …