Mobile Device-to-Device (D2D) Content Delivery Networking: A Design and Optimization Framework

Citations

WEB OF SCIENCE

45
Citations

SCOPUS

53

초록

We consider a mobile content delivery network (mCDN) in which special mobile devices designated as caching servers (caching-server device: CSD) can provide mobile stations with popular contents on demand via device-to-device (D2D) communication links. On the assumption that mobile CSD's are randomly distributed by a Poisson point process (PPP), an optimization problem is formulated to determine the probability of storing the individual content in each server in a manner that minimizes the average caching failure rate. Further, we present a low-complexity search algorithm, optimum dual-solution searching algorithm (ODSA), for solving this optimization problem. We demonstrate that the proposed ODSA takes fewer iterations, on the order of O(log N) searches, for caching N contents in the system to find the optimal solution, as compared to the number of iterations in the conventional subgradient method, with an acceptable accuracy in practice. Furthermore, we identify the important characteristics of the optimal caching policies in the mobile environment that would serve as a useful aid in designing the mCDN.

키워드

Caching probability; caching server device; device-to-device (D2D) communication; mobile contents distributed network (mCDN); Poisson point process (PPP)
제목
Mobile Device-to-Device (D2D) Content Delivery Networking: A Design and Optimization Framework
저자
Kang, Hye Joong; Kang, Chung Gu
DOI
10.1109/JCN.2014.000095
발행일
2014-10
유형
Article
저널명
Journal of Communications and Networks
권
16
호
5
페이지
568 ~ 577