2020/03/24 by Ramy Amer, Amer, Ramy, Hesham ElSawy +9
Computer Science · Engineering · #Advanced Wireless Network Optimization #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks
paper · pdf · doi:10.48550/arxiv.2003.10809
openalex publication_date 2020/03/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Caching at mobile devices and leveraging device- to-device (D2D)\ncommunication are two promising approaches to support massive content delivery\nover wireless networks. The analysis of cache-enabled wireless networks is\nusually carried out by assuming that devices are uniformly distributed,\nhowever, in social networks, mobile devices are intrinsically grouped into\ndisjoint clusters. In this regards, this paper proposes a spatiotemporal\nmathematical model that tracks the service requests arrivals and account for\nthe clustered devices geometry. Two kinds of devices are assumed, particularly,\ncontent clients and content providers. Content providers are assumed to have a\nsurplus memory which is exploited to proactively cache contents from a known\nlibrary, following a random probabilistic caching scheme. Content clients can\nretrieve a requested content from the nearest content provider in their\nproximity (cluster), or, as a last resort, the base station (BS). The developed\nspatiotemporal model is leveraged to formulate a joint optimization problem of\nthe content caching and spectrum partitioning in order to minimize the average\nservice delay. Due to the high complexity of the optimization problem, the\ncaching and spectrum partitioning problems are decoupled and solved iteratively\nusing the block coordinate descent (BCD) optimization technique. To this end,\nan optimal and suboptimal solutions are obtained for the bandwidth partitioning\nand probabilistic caching subproblems, respectively. Numerical results\nhighlight the superiority of the proposed scheme over conventional caching\nschemes under equal and optimized bandwidth allocations. Particularly, it is\nshown that the average service delay is reduced by nearly 100% and 350%,\ncompared to the Zipf and uniform caching schemes under equal bandwidth\nallocations, respectively.\n