Name
Abstract | ||
|---|---|---|
We consider wireless device-to-device (D2D) caching networks with single-hop transmissions. Previous work in the literature has shown that caching and coded multicasting can be strategically used to significantly increase the per user throughput. However, these schemes require partitioning files into a large number of packets which grows exponentially as the number of users increases. This makes these schemes impractical to implement. In this paper, we address this issue by designing cache placement, coded multicasting and scheduling schemes based on disjoint matchings in Ruzsa-Szemeredi Graphs, which has been applied to design a coded caching scheme in the shared link caching networks [1]. We demonstrate that by using the proposed approach, the per user throughput is not much worse than that proposed in the literature with the requirement of exponential file subpacketization in terms of the number of users. Nevertheless, by using the proposed scheme, the requirement of file subpacketization is at most sub-quadratic in terms of the number of users if no spatial reuse is allowed. In addition, both per user throughput and file subpacketization can be improved significantly when spatial reuse is allowed. |
Year | Venue | Field |
|---|---|---|
2017 | IEEE Global Communications Conference | Wireless,Disjoint sets,Reuse,Computer science,Cache,Scheduling (computing),Network packet,Computer network,Multicast,Throughput |
DocType | ISSN | Citations |
Conference | 2334-0983 | 2 |
PageRank | References | Authors |
0.44 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicholas Woolsey | 1 | 15 | 6.06 |
| Rong-Rong Chen | 2 | 70 | 10.31 |
| Mingyue Ji | 3 | 641 | 51.43 |