Open Access

ARTICLE

Efficient Algorithms for Cache-Throughput Analysis in Cellular-D2D 5G Networks

Nasreen Anjum^1,*, Zhaohui Yang¹, Imran Khan², Mahreen Kiran³, Falin Wu⁴, Khaled Rabie⁵, Shikh Muhammad Bahaei¹

1 Department of Informatics, King’s College London, London, UK
2 Department of Electrical Engineering, University of Peshawar, Peshawar, Pakistan
3 Department of Computer Science, Institute of Management Sciences, Peshawar, Pakistan
4 School of Instrumentation and Optoelectronic Engineering, Beihang University, Beijing, 100191, China
5 Department of Electrical and Electronic Engineering, Manchester Metropolitan University, Manchester, UK

* Corresponding Author: Nasreen Anjum. Email:

Computers, Materials & Continua 2021, 67(2), 1759-1780. https://doi.org/10.32604/cmc.2021.014635

Received 05 October 2020; Accepted 10 November 2020; Issue published 05 February 2021

Abstract

In this paper, we propose a two-tiered segment-based Device-to-Device (S-D2D) caching approach to decrease the startup and playback delay experienced by Video-on-Demand (VoD) users in a cellular network. In the S-D2D caching approach cache space of each mobile device is divided into two cache-blocks. The first cache-block reserve for caching and delivering the beginning portion of the most popular video files and the second cache-block caches the latter portion of the requested video files ‘fully or partially’ depending on the users’ video watching behaviour and popularity of videos. In this approach before caching, video is divided and grouped in a sequence of fixed-sized fragments called segments. To control the admission to both cache-blocks and improve the system throughput, we further propose and evaluate three cache admission control algorithms. We also propose a video segment access protocol to elaborate on how to cache and share the video segments in a segmentation based D2D caching architecture. We formulate an optimisation problem and find the optimal cache probability and beginning-segment size that maximise the cache-throughput probability of beginning-segments. To solve the non-convex cache-throughout maximisation problem, we derive an iterative algorithm, where the optimal solution is derived in each step. We used extensive simulations to evaluate the performance of our proposed S-D2D caching system.

---

Keywords

---