Socially aware distributed caching in device-to-device communication networks

Ma, C; Ding, M; Chen, H; Lin, Z; Mao, G; Li, X

Socially aware distributed caching in device-to-device communication networks

Ma, C Ding, M Chen, H Lin, Z Mao, G

Li, X

Permalink

Publication Type:: Conference Proceeding
Citation:: 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings, 2016
Issue Date:: 2016-01-01

Closed Access

	Filename	Description	Size
	07849047.pdf	Published version	184.23 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	Ma, C	en_US
dc.contributor.author	Ding, M	en_US
dc.contributor.author	Chen, H	en_US
dc.contributor.author	Lin, Z	en_US
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Li, X	en_US
dc.date.issued	2016-01-01	en_US
dc.identifier.citation	2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings, 2016	en_US
dc.identifier.isbn	9781509024827	en_US
dc.identifier.uri	http://hdl.handle.net/10453/120301
dc.description.abstract	© 2016 IEEE. Content caching in user devices with device-to-device (D2D) communication capacities is becoming a promising technique to address the data traffic explosion problem in the next generation mobile networks. In this paper, we develop a socially aware distributed caching strategy based on a decentralized learning automaton, referred to as the Discrete Generalized Pursuit Algorithm (DGPA), to optimize the cache placement operation in D2D networks. Different from existing caching schemes, the proposed algorithm not only considers the file request probability and the closeness of devices as measured by their distance, but also takes into account the social relationship between D2D users. Furthermore, we characterize the mutual impact between the contents cached in different D2D users. Simulation results show that the proposed algorithm converges quickly and outperforms its counterparts using deterministic caching and random caching. Our work sheds new insights on the optimal design of D2D cache placement operations.	en_US
dc.relation.ispartof	2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings	en_US
dc.relation.isbasedon	10.1109/GLOCOMW.2016.7849047	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Socially aware distributed caching in device-to-device communication networks	en_US
dc.type	Conference Proceeding
utslib.for	080501 Distributed and Grid Systems	en_US
utslib.for	100503 Computer Communications Networks	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 - CRIN - Realtime Information Networks
utslib.copyright.status	closed_access	*
pubs.publication-status	Published	en_US

Abstract:

© 2016 IEEE. Content caching in user devices with device-to-device (D2D) communication capacities is becoming a promising technique to address the data traffic explosion problem in the next generation mobile networks. In this paper, we develop a socially aware distributed caching strategy based on a decentralized learning automaton, referred to as the Discrete Generalized Pursuit Algorithm (DGPA), to optimize the cache placement operation in D2D networks. Different from existing caching schemes, the proposed algorithm not only considers the file request probability and the closeness of devices as measured by their distance, but also takes into account the social relationship between D2D users. Furthermore, we characterize the mutual impact between the contents cached in different D2D users. Simulation results show that the proposed algorithm converges quickly and outperforms its counterparts using deterministic caching and random caching. Our work sheds new insights on the optimal design of D2D cache placement operations.

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

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