Towards Finite File Packetizations in Wireless Device-to-Device Caching Networks.
Saved in:
| Title: | Towards Finite File Packetizations in Wireless Device-to-Device Caching Networks. |
|---|---|
| Authors: | Woolsey, Nicholas1 nicholas.woolsey@utah.edu, Chen, Rong-Rong1 rchen@ece.utah.edu, Ji, Mingyue1 mingyue.ji@utah.edu |
| Source: | IEEE Transactions on Communications. Sep2020, Vol. 68 Issue 9, p5283-5298. 16p. |
| Subjects: | Linear network coding, Multicasting (Computer networks), Pocket computers, Wireless communications |
| Abstract: | We consider wireless device-to-device (D2D) caching networks with single-hop transmissions. Previous work has demonstrated that caching and coded multicasting can significantly increase per user throughput. However, the state-of-the-art coded caching schemes for D2D networks are generally impractical because content files are partitioned into an exponential number of packets with respect to the number of users if both library and memory sizes are fixed. In this paper, we present two combinatorial approaches of D2D coded caching network design with reduced packetizations and desired throughput gain compared to the conventional uncoded unicasting. The first approach uses a “hypercube” design, where each user caches a “hyperplane” in this hypercube and the intersections of “hyperplanes” represent coded multicasting codewords. In addition, we extend the hypercube approach to a decentralized design. The second approach uses the Ruzsa-Szeméredi graph to define the cache placement. Disjoint matchings on this graph represent coded multicasting codewords. Both approaches yield an exponential reduction of packetizations while providing a per-user throughput that is comparable to the state-of-the-art designs in the literature. Furthermore, we apply spatial reuse to the new D2D network designs to further reduce the required packetizations and significantly improve per user throughput for some parameter regimes. [ABSTRACT FROM AUTHOR] |
| Copyright of IEEE Transactions on Communications is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 146012578 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Towards Finite File Packetizations in Wireless Device-to-Device Caching Networks. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Woolsey%2C+Nicholas%22">Woolsey, Nicholas</searchLink><relatesTo>1</relatesTo><i> nicholas.woolsey@utah.edu</i><br /><searchLink fieldCode="AR" term="%22Chen%2C+Rong-Rong%22">Chen, Rong-Rong</searchLink><relatesTo>1</relatesTo><i> rchen@ece.utah.edu</i><br /><searchLink fieldCode="AR" term="%22Ji%2C+Mingyue%22">Ji, Mingyue</searchLink><relatesTo>1</relatesTo><i> mingyue.ji@utah.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Communications%22">IEEE Transactions on Communications</searchLink>. Sep2020, Vol. 68 Issue 9, p5283-5298. 16p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Linear+network+coding%22">Linear network coding</searchLink><br /><searchLink fieldCode="DE" term="%22Multicasting+%28Computer+networks%29%22">Multicasting (Computer networks)</searchLink><br /><searchLink fieldCode="DE" term="%22Pocket+computers%22">Pocket computers</searchLink><br /><searchLink fieldCode="DE" term="%22Wireless+communications%22">Wireless communications</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: We consider wireless device-to-device (D2D) caching networks with single-hop transmissions. Previous work has demonstrated that caching and coded multicasting can significantly increase per user throughput. However, the state-of-the-art coded caching schemes for D2D networks are generally impractical because content files are partitioned into an exponential number of packets with respect to the number of users if both library and memory sizes are fixed. In this paper, we present two combinatorial approaches of D2D coded caching network design with reduced packetizations and desired throughput gain compared to the conventional uncoded unicasting. The first approach uses a “hypercube” design, where each user caches a “hyperplane” in this hypercube and the intersections of “hyperplanes” represent coded multicasting codewords. In addition, we extend the hypercube approach to a decentralized design. The second approach uses the Ruzsa-Szeméredi graph to define the cache placement. Disjoint matchings on this graph represent coded multicasting codewords. Both approaches yield an exponential reduction of packetizations while providing a per-user throughput that is comparable to the state-of-the-art designs in the literature. Furthermore, we apply spatial reuse to the new D2D network designs to further reduce the required packetizations and significantly improve per user throughput for some parameter regimes. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of IEEE Transactions on Communications is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=146012578 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1109/TCOMM.2020.3006897 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 16 StartPage: 5283 Subjects: – SubjectFull: Linear network coding Type: general – SubjectFull: Multicasting (Computer networks) Type: general – SubjectFull: Pocket computers Type: general – SubjectFull: Wireless communications Type: general Titles: – TitleFull: Towards Finite File Packetizations in Wireless Device-to-Device Caching Networks. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Woolsey, Nicholas – PersonEntity: Name: NameFull: Chen, Rong-Rong – PersonEntity: Name: NameFull: Ji, Mingyue IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2020 Type: published Y: 2020 Identifiers: – Type: issn-print Value: 00906778 Numbering: – Type: volume Value: 68 – Type: issue Value: 9 Titles: – TitleFull: IEEE Transactions on Communications Type: main |
| ResultId | 1 |