| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
09 February 2025 |
|
| | | |
|
Article overview
| |
|
Fundamental Tradeoff between Storage and Latency in Cache-Aided Wireless Interference Networks | Fan Xu
; Meixia Tao
; Kangqi Liu
; | Date: |
1 May 2016 | Abstract: | This paper studies the fundamental tradeoff between storage and latency in a
general wireless interference network with caches equipped at all transmitters
and receivers. The tradeoff is characterized by an information-theoretic
metric, fractional delivery time (FDT), which is defined as the delivery time
of the actual load normalized by the total requested bits at a transmission
rate specified by degrees of freedom (DoF) of the given channel. We obtain
achievable upper bounds of the minimum FDT for the considered network with
$N_T(ge2)$ transmitters and $N_R= 2$ or $N_R= 3$ receivers. We also obtain a
theoretical lower bound of the minimum FDT for any $N_T$ transmitters and $N_R$
receivers. Both upper and lower bounds are convex and piece-wise linear
decreasing functions of transmitter and receiver cache sizes. The achievable
bound is partially optimal and is at most $frac{4}{3}$ and $frac{3}{2}$ times
of the lower bound in the considered $N_T imes 2$ and $N_T imes 3$ network,
respectively. To show the achievability, we propose a novel cooperative
transmitter/receiver coded caching strategy. It offers the freedom to adjust
file splitting ratios for FDT minimization. Based on this caching strategy, we
then design the delivery phase carefully to turn the considered network
opportunistically into more favorable channels, including X channel, broadcast
channel, multicast channel, or a hybrid form of these channels. Receiver local
caching gain, coded multicasting gain, and transmitter cooperation gain
(interference alignment and interference neutralization) are thus leveraged in
different cache size regions and different channels. | Source: | arXiv, 1605.0203 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|