English
Related papers

Related papers: Optimal Geographical Caching in Heterogeneous Cell…

200 papers

A recent approach in modeling and analysis of the supply and demand in heterogeneous wireless cellular networks has been the use of two independent Poisson point processes (PPPs) for the locations of base stations (BSs) and user equipments…

Networking and Internet Architecture · Computer Science 2015-05-04 Meisam Mirahsan , Rainer Schoenen , Halim Yanikomeroglu

In heterogeneous cellular networks with caching capability, due to mobility of users and storage constraints of small-cell base stations (SBSs), users may not be able to download all of their requested content from the SBSs within the delay…

Information Theory · Computer Science 2017-11-22 Emre Ozfatura , Deniz Gündüz

Optimizing the cellular network's cell locations is one of the most fundamental problems of network design. The general objective is to provide the desired Quality-of-Service (QoS) with the minimum system cost. In order to meet a growing…

Networking and Internet Architecture · Computer Science 2013-07-23 Weisi Guo , Siyi Wang , Xiaoli Chu , Jiming Chen , Hui Song , Jie Zhang

Caching at the base stations (BSs) has been widely adopted to reduce the delivery delay and alleviate the backhaul traffic between BSs and the core network. In this paper, we consider a collaborative content caching scheme among BSs in…

Information Theory · Computer Science 2016-05-04 Yaping Sun , Zhiyong Chen , Hui Liu

Cache-enabled device-to-device (D2D) networks turn memory of the devices at the network edge, such as smart phones and tablets, into bandwidth by enabling asynchronous content sharing directly between proximate devices. Limited storage…

Information Theory · Computer Science 2016-03-08 Mehrnaz Afshang , Harpreet S. Dhillon

This paper explores the physical-layer security in a small cell network (SCN) with cooperative cache-enabled small base stations (SBSs) in the presence of randomly distributed eavesdroppers. We propose a joint design on the caching…

Information Theory · Computer Science 2018-06-22 Tong-Xing Zheng , Hui-Ming Wang , Jinhong Yuan

This paper develops a new approach to the modeling and analysis of HetNets that accurately incorporates coupling across the locations of users and base stations, which exists due to the deployment of small cell base stations (SBSs) at the…

Information Theory · Computer Science 2017-04-18 Mehrnaz Afshang , Harpreet S. Dhillon

The performance of a cellular network can be significantly improved by employing many base stations (BSs), which shortens transmission distances. However, there exist no known results on quantifying the performance gains from deploying many…

Networking and Internet Architecture · Computer Science 2012-04-09 Seunghyun Lee , Kaibin Huang

Emerging heterogeneous wireless architectures consist of a dense deployment of local-coverage wireless access points (APs) with high data rates, along with sparsely-distributed, large-coverage macro-cell base stations (BS). We design a…

Information Theory · Computer Science 2016-11-17 Jad Hachem , Nikhil Karamchandani , Suhas Diggavi

Caching the popular multimedia content is a promising way to unleash the ultimate potential of wireless networks. In this paper, we contribute to proposing and analyzing the cache-based content delivery in a three-tier heterogeneous network…

Information Theory · Computer Science 2015-08-13 Chenchen Yang , Yao Yao , Zhiyong Chen , Bin Xia

In heterogeneous networks (HetNets), load balancing among different tiers can be effectively achieved by a biased user association scheme with which each user chooses to associate with one base station (BS) based on the biased received…

Networking and Internet Architecture · Computer Science 2017-01-05 Fancheng Kong , Xinghua Sun , Victor C. M. Leung , Hongbo Zhu

This paper studies the performance of cache-enabled dense small cell networks consisting of multi-antenna sub-6 GHz and millimeter-wave base stations. Different from the existing works which only consider a single antenna at each base…

Networking and Internet Architecture · Computer Science 2018-01-18 Yongxu Zhu , Gan Zheng , Lifeng Wang , Kai-Kit Wong , Liqiang Zhao

We study optimal geographic content placement for device-to-device (D2D) networks in which each file's popularity follows the Zipf distribution. The locations of the D2D users (caches) are modeled by a Poisson point process (PPP) and have…

Information Theory · Computer Science 2017-10-04 Derya Malak , Mazin Al-Shalash , Jeffrey G. Andrews

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…

Information Theory · Computer Science 2019-07-19 Zhaohui Yang , Cunhua Pan , Yijin Pan , Yongpeng Wu , Wei Xu , Mohammad Shikh-Bahaei , Ming Chen

When dedicated positioning systems, such as GPS, are unavailable, a mobile device has no choice but to fall back on its cellular network for localization. Due to random variations in the channel conditions to its surrounding base stations…

Information Theory · Computer Science 2015-10-27 Javier Schloemann , Harpreet S. Dhillon , R. Michael Buehrer

Small basestations (SBs) equipped with caching units have potential to handle the unprecedented demand growth in heterogeneous networks. Through low-rate, backhaul connections with the backbone, SBs can prefetch popular files during…

Networking and Internet Architecture · Computer Science 2018-03-14 Alireza Sadeghi , Fatemeh Sheikholeslami , Georgios B. Giannakis

Coded caching is able to exploit accumulated cache size and hence superior to uncoded caching by distributing different fractions of a file in different nodes. This work investigates coded caching in a large-scale small-cell network (SCN)…

Information Theory · Computer Science 2017-03-31 Xuejian Xu , Meixia Tao

User mobility has a large effect on optimal content placement in D2D caching networks. Since a typical user can communicate neighboring users who stay in the D2D communication area of the typical user, the optimal content placement should…

Information Theory · Computer Science 2020-01-03 Jaeyoung Song , Wan Choi

We study the problem of wireless edge caching when file popularity is unknown and possibly non-stationary. A bank of $J$ caches receives file requests and a utility is accrued for each request depending on the serving cache. The network…

Networking and Internet Architecture · Computer Science 2020-01-20 Georgios Paschos , Apostolos Destounis , George Iosifidis

Most of prior works optimize caching policies based on the following assumptions: 1) every user initiates request according to content popularity, 2) all users are with the same active level, and 3) users are uniformly located in the…

Information Theory · Computer Science 2018-03-05 Dong Liu , Chenyang Yang , Victor C. M. Leung