Name
Abstract | ||
|---|---|---|
We consider a cache-aided wireless device-to-device (D2D) network under the constraint of one-shot delivery, where the placement phase is orchestrated by a central server. We assume that the devices' caches are filled with uncoded data, and the whole file database at the server is made available in the collection of caches. Following this phase, the files requested by the users are serviced by inter-device multicast communication. For such a system setting, we provide the exact characterization of load-memory trade-off, by deriving both the minimum average and the minimum peak sum-loads of links between devices, for a given individual memory size at disposal of each user. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ISIT.2019.8849211 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Field | DocType | Citations |
Discrete mathematics,Wireless,Computer science,Cache,Computer network,Multicast communication | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Çagkan Yapar | 1 | 0 | 0.34 |
| Kai Wan | 2 | 0 | 2.70 |
| Rafael F. Schaefer | 3 | 165 | 35.85 |
| Giuseppe Caire | 4 | 9797 | 807.61 |