Private Information Retrieval in Wireless Coded Caching
Paper i proceeding, 2019

We consider private information retrieval (PIR) in a content delivery scenario where, to reduce the backhaul usage, data is cached using maximum distance separable codes in a number of small-cell base stations (SBSs). We present a PIR protocol that allows the user to retrieve files of different popularities from the network without revealing the identity of the desired file to curious SBSs that potentially collaborate. We formulate an optimization problem to optimize the content placement and the number of queries of the protocol such that the backhaul rate is minimized. We further prove that, contrary to the case of no PIR, uniform content placement is optimal. Compared to a recently proposed protocol by Kumar et al. the presented protocol gives a reduced backhaul rate.

Författare

Siddhartha Kumar

Simula UiB

Alexandre Graell I Amat

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

Eirik Rosnes

Simula UiB

IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC

1948-3244 (ISSN) 1948-3252 (eISSN)

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
Cannes, France,

Distribuerad lagring för datalagring och trådlös leverans av data

Vetenskapsrådet (VR), 2016-01-01 -- 2019-12-31.

Ämneskategorier

Telekommunikation

DOI

10.1109/SPAWC.2019.8815548

Mer information

Senast uppdaterat

2019-11-03