Linear network coded wireless caching

Shi, L; Cai, K; Yang, T; Wang, T

Linear network coded wireless caching

Shi, L Cai, K Yang, T

Wang, T

Permalink

Publication Type:: Conference Proceeding
Citation:: 2018 IEEE International Conference on Communications Workshops, ICC Workshops 2018 - Proceedings, 2018, pp. 1 - 6
Issue Date:: 2018-07-03

Closed Access

	Filename	Description	Size
	Linear network coded wireless caching.pdf	Published version	519.83 kB	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	Shi, L	en_US
dc.contributor.author	Cai, K	en_US
dc.contributor.author	Yang, T https://orcid.org/0000-0002-9870-6866	en_US
dc.contributor.author	Wang, T	en_US
dc.date.issued	2018-07-03	en_US
dc.identifier.citation	2018 IEEE International Conference on Communications Workshops, ICC Workshops 2018 - Proceedings, 2018, pp. 1 - 6	en_US
dc.identifier.isbn	9781538643280	en_US
dc.identifier.uri	http://hdl.handle.net/10453/133902
dc.description.abstract	© 2018 IEEE. This paper studies a K × M multiple-input multiple-output (MIMO) wireless caching that consists of a library, K base stations (BSs), and Mellintrf users, where each BS and user are equipped with NT and NR antennas respectively. Consider that each BS has a local cache that can prefetch some popular data requested by users from the library. We propose a linear network coding (NC) assisted wireless caching, considering the finite cache size and the variability of the user requests. In the cache placement phase, we design a joint NC caching function at K BSs to store linear combinations of messages from the library. In the content delivery phase, each user can successfully decode its requested messages by the receiver shaping and reverse NC operation. Our analytical results verify that, without any shared caching messages at different BSs, the proposed caching scheme is compatible with distinct user requests. In particular, for a 2×2 MIMO wireless caching network, the proposed caching scheme can achieve a higher total degree of freedom (DoF) of min(2NT, 2NR)-1 while consuming a smaller cache size, compared with the existing caching scheme.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DE150100636
dc.relation.ispartof	2018 IEEE International Conference on Communications Workshops, ICC Workshops 2018 - Proceedings	en_US
dc.relation.isbasedon	10.1109/ICCW.2018.8403706	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Linear network coded wireless caching	en_US
dc.type	Conference Proceeding
utslib.for	0805 Distributed Computing	en_US
pubs.embargo.period	Not known	en_US
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/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access	*
pubs.publication-status	Published	en_US

Abstract:

© 2018 IEEE. This paper studies a K × M multiple-input multiple-output (MIMO) wireless caching that consists of a library, K base stations (BSs), and Mellintrf users, where each BS and user are equipped with NT and NR antennas respectively. Consider that each BS has a local cache that can prefetch some popular data requested by users from the library. We propose a linear network coding (NC) assisted wireless caching, considering the finite cache size and the variability of the user requests. In the cache placement phase, we design a joint NC caching function at K BSs to store linear combinations of messages from the library. In the content delivery phase, each user can successfully decode its requested messages by the receiver shaping and reverse NC operation. Our analytical results verify that, without any shared caching messages at different BSs, the proposed caching scheme is compatible with distinct user requests. In particular, for a 2×2 MIMO wireless caching network, the proposed caching scheme can achieve a higher total degree of freedom (DoF) of min(2NT, 2NR)-1 while consuming a smaller cache size, compared with the existing caching scheme.

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

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