TY - GEN
T1 - Social-Aware Content Delivery in Low Latency D2D Caching Networks
AU - Gabr, Badiaa Mohamed Fouad H.
AU - Soret, Beatriz
AU - Popovski, Petar
AU - Hosny, Sameh
AU - Nafie, Mohammed
PY - 2020/3/5
Y1 - 2020/3/5
N2 - Proactive caching at the users is an attractive strategy to unload the core network during peak hours. The main principle is to cache some of the most popular contents during off-peak hours, and then exploit the usersâ™ social interactions to distribute the desired contents via device-to- device (D2D) connections. In this work, we introduce an optimal content caching placement and delivery policy based on social interactions between mobile users under a reliability constraint. We adopt the inter-contact mobility model to represent users meeting and mobility patterns. The Service provider (SP) captures users demand and mobility statistics to decide which contents to be cached. Content delivery occurs when users, having social relationships, meet together. Having several nearby users, each user has multiple potential interfaces to get the desired content. We find the optimal caching policy that maximizes contents hit probability and guarantees reliable data transmission.
AB - Proactive caching at the users is an attractive strategy to unload the core network during peak hours. The main principle is to cache some of the most popular contents during off-peak hours, and then exploit the usersâ™ social interactions to distribute the desired contents via device-to- device (D2D) connections. In this work, we introduce an optimal content caching placement and delivery policy based on social interactions between mobile users under a reliability constraint. We adopt the inter-contact mobility model to represent users meeting and mobility patterns. The Service provider (SP) captures users demand and mobility statistics to decide which contents to be cached. Content delivery occurs when users, having social relationships, meet together. Having several nearby users, each user has multiple potential interfaces to get the desired content. We find the optimal caching policy that maximizes contents hit probability and guarantees reliable data transmission.
UR - http://www.scopus.com/inward/record.url?scp=85082298485&partnerID=8YFLogxK
U2 - 10.1109/GCWkshps45667.2019.9024640
DO - 10.1109/GCWkshps45667.2019.9024640
M3 - Article in proceeding
SN - 978-1-7281-0961-9
T3 - Proceedings of the IEEE Globecom Workshops (GC Wkshps)
BT - 2019 IEEE Globecom Workshops (GC Wkshps)
PB - IEEE
T2 - 2019 IEEE Globecom Workshops (GC Wkshps)
Y2 - 9 December 2019 through 13 December 2019
ER -