Cache-Aided Interference Channels

被引:0
|
作者
Maddah-Ali, Mohammad Ali [1 ]
Niesen, Urs [2 ]
机构
[1] Alcatel Lucent, Bell Labs, Holmdel, NJ 07733 USA
[2] Qualcomm New Jersey Res Ctr, Bridgewater, NJ USA
关键词
ALIGNMENT; NETWORKS; FREEDOM;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Over the past decade, the bulk of wireless traffic has shifted from speech to content. This shift creates the opportunity to cache part of the content in memories closer to the end users, for example in base stations. Most of the prior literature focuses on the reduction of load in the backhaul and core networks due to caching, i.e., on the benefits caching offers for the wireline communication link between the origin server and the caches. In this paper, we are instead interested in the benefits caching can offer for the wireless communication link between the caches and the end users. To quantify the gains of caching for this wireless link, we consider an interference channel in which each transmitter is equipped with an isolated cache memory. Communication takes place in two phases, a content placement phase followed by a content delivery phase. The objective is to design both the placement and the delivery phases to maximize the rate in the delivery phase in response to any possible user demands. Focusing on the three-user case, we show that through careful joint design of these phases, we can reap three distinct benefits from caching: a load balancing gain, an interference cancellation gain, and an interference alignment gain. In our proposed scheme, load balancing is achieved through a specific file splitting and placement, creating a particular pattern of content overlap at the caches. This overlap allows to implement interference cancellation. Further, it allows us to construct several virtual transmitters, each responsible for a part of the requested content, which increases interference alignment possibilities.
引用
收藏
页码:809 / 813
页数:5
相关论文
共 50 条
  • [41] Updating Content in Cache-Aided Coded Multicast
    Mahdian, Milad
    Prakash, N.
    Medard, Muriel
    Yeh, Edmund
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2018, 36 (06) : 1203 - 1216
  • [42] Cache-aided MISO-NOMA concept
    Paunkoska-Dimoska N.
    Kafedziski V.
    International Journal of Wireless and Mobile Computing, 2024, 26 (03) : 270 - 281
  • [43] Fundamental Limits of Cloud and Cache-Aided Interference Management With Multi-Antenna Edge Nodes
    Zhang, Jingjing
    Simeone, Osvaldo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (08) : 5197 - 5214
  • [44] Fundamental Limits of Cloud and Cache-Aided Interference Management with Multi-Antenna Base Stations
    Zhang, Jingjing
    Simeone, Osvaldo
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 1425 - 1429
  • [45] Cache-Aided Polar Coding: From Theory to Implementation
    Fadlallah, Yasser
    Oubejja, Othmane
    Kamel, Sarah
    Ciblat, Philippe
    Wigger, Michele
    Gorce, Jean-Marie
    IEEE Journal on Selected Areas in Information Theory, 2021, 2 (04): : 1206 - 1223
  • [46] Degrees of Freedom of Cache-Aided Wireless Cellular Networks
    Cao, Youlong
    Tao, Meixia
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (05) : 2777 - 2792
  • [47] Cache-Aided Combination Networks with Asymmetric End Users
    Zewail, Ahmed A.
    Yener, Aylin
    2019 IEEE 20TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC 2019), 2019,
  • [48] A Novel Cache-aided Fog-RAN Architecture
    Wan, Kai
    Tuninetti, Daniela
    Ji, Mingyue
    Caire, Giuseppe
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2977 - 2981
  • [49] NOMA and Coded Multicasting in Cache-Aided Wireless Networks
    Dani, Muhammad Norfauzi
    So, Daniel K. C.
    Tang, Jie
    Ding, Zhiguo
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2022, 21 (04) : 2506 - 2520
  • [50] Cache-Aided MEC With the Assistance of Intelligent Reflecting Surface
    Zhang, Jiadi
    Wang, Rui
    Wu, Jun
    Ai, Lihua
    IEEE INTERNET OF THINGS JOURNAL, 2023, 10 (19) : 16686 - 16699