Please use this identifier to cite or link to this item:
Title: Robustness of Clustered D2D Cache Placement Against Mobility
Authors: Kazez, Ahmet Cihat
Girici, Tolga
Keywords: Caching 
 Radio Access Networks 
 Zipf Distribution
Issue Date: Sep-2019
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: Kazez, A. C and Girici, T. (2019, September). Robustness of Clustered D2D Cache Placement Against Mobility. In 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) (pp. 1-5). IEEE.
Abstract: In this study we consider the problem of cache placement in a device-to-device (D2D) enabled cellular network with mobile users. D2D communication occurs between helper users and ordinary users, where helpers are able to cache contents and deliver these contents to ordinary users via D2D transmission upon request. The objective of the cache placement is maximizing the offloaded traffic and lighten the burden of the Base Station. We first formulate a single-shot cache placement problem as a Mixed Integer Linear Program (MILP) and obtain the optimal solution. We also propose three clustering algorithms and a cache placement algorithm. Then we tested the performance of these schemes under user and helper mobility. Cache placement is recomputed at a certain cache update periods, in order to take into account the changing topology. Simulation results show that the optimization framework designed for a single-shot scenario fails at challenging conditions, while the proposed algorithms is more robust to mobility. © 2019 IEEE.
ISBN: 978-153868110-7
Appears in Collections:Elektrik ve Elektronik Mühendisliği Bölümü / Department of Electrical & Electronics Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender

Page view(s)

checked on Dec 26, 2022

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.