Wireless device-to- device caching networks with distributed MIMO and hierarchical cooperations

Guo, J; Yuan, J; Zhang, JA

Wireless device-to- device caching networks with distributed MIMO and hierarchical cooperations

Guo, J Yuan, J Zhang, JA

Permalink

Publication Type:: Chapter
Citation:: Edge Caching for Mobile Networks, 2022, pp. 339-370
Issue Date:: 2022-01-01

Closed Access

	Filename	Description	Size
	iet_books.69648.012.pdf	Accepted version	4.92 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Guo, J
dc.contributor.author	Yuan, J
dc.contributor.author	Zhang, JA
dc.date.accessioned	2023-01-16T04:56:11Z
dc.date.available	2023-01-16T04:56:11Z
dc.date.issued	2022-01-01
dc.identifier.citation	Edge Caching for Mobile Networks, 2022, pp. 339-370
dc.identifier.isbn	9781839531231
dc.identifier.uri	http://hdl.handle.net/10453/165017
dc.description.abstract	This chapter first categorizes and summarizes wireless caching on its capability of raising the wireless network throughput in centralized and decentralized network topology. More precisely, what is the throughput scaling law of the wireless caching networks, i.e., how does the network throughput scale with the caching size, the library size, and the number of nodes in different wireless networks? Then, a novel caching scheme for device-to- device (D2D) networks is presented and the throughput scaling law is derived, which shows that the average aggregate throughput of the network scales almost linearly with the number of nodes. Both analytical and numerical results show that the proposed scheme outperforms existing ones when the local cache size is limited.
dc.language	en
dc.relation.ispartof	Edge Caching for Mobile Networks
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Wireless device-to- device caching networks with distributed MIMO and hierarchical cooperations
dc.type	Chapter
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access	*
dc.date.updated	2023-01-16T04:56:08Z
pubs.publication-status	Published

Abstract:

This chapter first categorizes and summarizes wireless caching on its capability of raising the wireless network throughput in centralized and decentralized network topology. More precisely, what is the throughput scaling law of the wireless caching networks, i.e., how does the network throughput scale with the caching size, the library size, and the number of nodes in different wireless networks? Then, a novel caching scheme for device-to- device (D2D) networks is presented and the throughput scaling law is derived, which shows that the average aggregate throughput of the network scales almost linearly with the number of nodes. Both analytical and numerical results show that the proposed scheme outperforms existing ones when the local cache size is limited.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/165017