Channel Aware Greedy Algorithm for MISO Cache-Aided Communication

Itsik Bergel, Soheil Mohajer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We present novel schemes for cache-aided communication over networks with a multi-antenna base station (BS) that serves multiple single-antenna users. The schemes are based on a greedy scheduling [1], which simultaneously transmits coded messages to disjoint groups of users. The proposed algorithms use the channel state information to opportunistically choose the groups to be served together and to allocate power to each coded message in order to minimize the overall communication delay. Numerical study shows that the new schemes outperform the previously known schemes.

Original languageEnglish
Title of host publication2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication, SPAWC 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665494557
DOIs
StatePublished - 2022
Event23rd IEEE International Workshop on Signal Processing Advances in Wireless Communication, SPAWC 2022 - Oulu, Finland
Duration: 4 Jul 20226 Jul 2022

Publication series

NameIEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC
Volume2022-July

Conference

Conference23rd IEEE International Workshop on Signal Processing Advances in Wireless Communication, SPAWC 2022
Country/TerritoryFinland
CityOulu
Period4/07/226/07/22

Bibliographical note

Publisher Copyright:
© 2022 IEEE.

Funding

The work of S. Mohajer is supported in part by the National Science Foundation under Grants CCF-1749981.

FundersFunder number
National Science FoundationCCF-1749981

    Keywords

    • Coded caching
    • MISO
    • Subpacketization level
    • greedy algorithm
    • heterogeneous network
    • load balancing

    Fingerprint

    Dive into the research topics of 'Channel Aware Greedy Algorithm for MISO Cache-Aided Communication'. Together they form a unique fingerprint.

    Cite this