Modeling and Analysis for Cache-Enabled Networks With Dynamic Traffic

Abstract

Abstract-Instead of assuming fully loaded cells in the analysis on cache-enabled networks with tools of stochastic geometry, we focus on the dynamic traffic in this letter. With modeling traffic dynamics of request arrivals and departures, probabilities of full-, free-, and modest-load cells in the large-scale cache-enabled network are elaborated based on the traffic queue state. Moreover, we propose to exploit the packets cached at cache-enabled users as side information to cancel the incoming interference. Then the packet loss rates for both the cache-enabled and cache-untenable users are investigated. The simulation results verify our analysis.

Two-Stage Interference Cancellation for Device-to-Device Caching Networks

“…Recently, D2D caching has been actively studied, in order to allow end terminals to cache content files and then to directly serve each other via D2D single-hop or multihop file delivery [5][6][7][8]11,12]. Specifically, the optimal throughput scaling laws for D2D caching networks achievable by single-hop file delivery and multihop file delivery were derived in [5,11,12].…”

“…Specifically, the optimal throughput scaling laws for D2D caching networks achievable by single-hop file delivery and multihop file delivery were derived in [5,11,12]. Analytical modeling for traffic dynamics has been studied in [6] to investigate packet loss rates for cache-enabled networks. In [8], IC by using cached files as side information at each receiver was proposed for cache-enabled networks.…”

“…Node i broadcasts a file request message of the desired file f i , denoted byf i (the file index of f i ), to the other nodes. This file request procedure can be performed based on a predetermined round-robin manner via extra interactive signals, similarly assumed in [6,8]. Note that node i might have multiple requested files or might not have any requested files in its cache memory after finishing the above file request message broadcasting.…”

“…Wireless caching techniques in general consist of two phases: the file placement phase and the file delivery phase. Most existing works have studied the joint design of file placement and delivery strategies to optimize the hit probability, network throughput, etc., for examples, see [2][3][4][5][6][7] and the references therein. Although the joint design and optimization of the file placement and delivery schemes can improve the performance of caching networks, it might excessively increase the system complexity and signaling overhead and, furthermore, such optimization requires a priori knowledge of the file popularity profile, which is very challenging for most of the sensor or IoT networks implemented with low-cost hardware devices that have limited communication and computing capabilities.…”

“…To the best of our knowledge, our work is the first attempt to provide a unified IC framework for wireless D2D caching networks incorporating cooperative transmission from multiple nodes sending the same file [4,8], IC by utilizing cached files as side information [6,8], and IC by interference decoding of undesired files [9,10]. (Throughout the paper, we assume that point-to-point Shannon-capacity-achieving channel codes are used to transmit each file.…”