Success Probability Analysis for Edge Caching in Massive MIMO Networks

Navneet Garg, Mathini Sellathurai, Faheem Khan, Tharmalingam Ratnarajah, Vimal Bhatia

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Edge caching is one of the promising solutions to fulfill the demands in future wireless networks. Considering a multi-cell multi-user massive MIMO (multiple-input-multiple-output) system, in this paper, we analyze average success probability (ASP) measure under the assumption of maximal ratio transmission (MRT) precoding. With respect to caching, ASP represents a measure of both the content placement and delivery performance. For the networks, where the base stations (BSs) and users are distributed as homogeneous Poisson point process (PPP), we show that for interference-limited systems, ASP is independent of the densities of both BS and users, concluding that the evaluation of a given caching scheme depends on the threshold chosen. Simulation results are presented to show the above relations.

Original languageEnglish
Title of host publication2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)
PublisherIEEE
ISBN (Electronic)9781728137155
DOIs
Publication statusPublished - 16 Jun 2020
Event13th IEEE International Conference on Advanced Networks and Telecommunications Systems 2019 - Goa, India
Duration: 16 Dec 201919 Dec 2019

Conference

Conference13th IEEE International Conference on Advanced Networks and Telecommunications Systems 2019
Abbreviated titleANTS 2019
Country/TerritoryIndia
CityGoa
Period16/12/1919/12/19

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Fingerprint

Dive into the research topics of 'Success Probability Analysis for Edge Caching in Massive MIMO Networks'. Together they form a unique fingerprint.

Cite this