Mobile Device-to-Device (D2D) Content Delivery Networking: A Design and Optimization Framework
- Authors
- Kang, Hye Joong; Kang, Chung Gu
- Issue Date
- 10월-2014
- Publisher
- KOREAN INST COMMUNICATIONS SCIENCES (K I C S)
- Keywords
- Caching probability; caching server device; device-to-device (D2D) communication; mobile contents distributed network (mCDN); Poisson point process (PPP)
- Citation
- JOURNAL OF COMMUNICATIONS AND NETWORKS, v.16, no.5, pp.568 - 577
- Indexed
- SCIE
SCOPUS
KCI
- Journal Title
- JOURNAL OF COMMUNICATIONS AND NETWORKS
- Volume
- 16
- Number
- 5
- Start Page
- 568
- End Page
- 577
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/97249
- DOI
- 10.1109/JCN.2014.000095
- ISSN
- 1229-2370
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.