Related papers: Probabilistic Placement Optimization for Non-coher…
To address the exponentially rising demand for wireless content, use of caching is emerging as a potential solution. It has been recently established that joint design of content delivery and storage (coded caching) can significantly…
Multicell joint processing can mitigate inter-cell interference and thereby increase the spectral efficiency of cellular systems. Most previous work has assumed phase-aligned (coherent) transmissions from different base transceiver stations…
A cloud radio access network (C-RAN) is a promising cellular network, wherein densely deployed multi-antenna remote-radio-heads (RRHs) jointly serve many users using the same time-frequency resource. By extremely high signaling overheads…
This paper considers a joint transmission scheme (JT) developed for cloud radio access networks (C-RANs). This proposed scheme features cooperative sets of remote radio heads (RRH) defined in a disk around each user location. The nodes…
Coded caching is a promising technique to create coded multicast opportunities for cache-aided networks. By splitting each file into $F$ equal packets (i.e., the subpacketization level $F$) and letting each user cache a set of packets, the…
Ensuring strong synchronization signal block (SSB) coverage is essential for reliable user equipment (UE) connection during initial access. While techniques such as power boosting and network densification are commonly used, this work…
This paper develops a stochastic geometry-based approach for the modeling, analysis, and optimization of wireless cloud caching networks comprised of multiple-antenna radio units (RUs) inside clouds. We consider the Matern cluster process…
We extend the problem of optimizing user association for load balancing in cellular networks along two dimensions. First, we consider joint transmission (JT), which is one of the coordinated multipoint (CoMP) techniques, with which a user…
We address the problem of distributed cooperative localization in wireless networks, i.e. nodes without prior position knowledge (agents) wish to determine their own positions. In non-cooperative approaches, positioning is only based on…
This paper studies the resource allocation algorithm design for multiuser coordinated multipoint (CoMP) networks with simultaneous wireless information and power transfer (SWIPT). In particular, remote radio heads (RRHs) are connected to a…
As the capacity demand of mobile applications keeps increasing, the backhaul network is becoming a bottleneck to support high quality of experience (QoE) in next-generation wireless networks. Content caching at base stations (BSs) is a…
Existing designs for content dissemination do not fully explore and exploit potential caching and computation capabilities in advanced wireless networks. In this paper, we propose two partition-based caching designs, i.e., a coded caching…
This article considers the joint problem of packet scheduling and self-localization in an underwater acoustic sensor network where sensor nodes are distributed randomly in an operating area. In terms of packet scheduling, our goal is to…
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)…
We propose a decentralized spatial soft-core cache placement (SSCC) policy for wireless networks. SSCC yields a spatially balanced sampling via negative dependence across caches, and can be tuned to satisfy cache size constraints with high…
Caching at mobile devices and leveraging device- to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. The analysis of cache-enabled wireless networks is usually carried out…
Caching contents at the network edge is an efficient mean for offloading traffic, reducing latency and improving users' quality-of-experience. In this letter, we focus on aspects of storage-bandwidth tradeoffs in which small cell base…
We introduce a variant of the capacitated vehicle routing problem that is encountered in sensor networks for scientific data collection. Consider an undirected graph $G=(V \cup \{\mathbf{sink}\},E)$. Each vertex $v \in V$ holds a…
We study joint optimization of service placement, request routing, and CPU sizing in a cooperative MEC system. The problem is considered from the perspective of the service provider (SP), which delivers heterogeneous MEC-enabled…
We develop Gibbs sampling based techniques for learning the optimal content placement in a cellular network. A collection of base stations are scattered on the space, each having a cell (possibly overlapping with other cells). Mobile users…