Pith. sign in

REVIEW 1 cited by

Caching Policy Optimization for D2D Communications by Learning User Preference

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1704.04860 v1 pith:S6N25CQU submitted 2017-04-17 cs.IT math.IT

classification cs.ITmath.IT
keywords usercachingpolicypreferencerequestuserscontentprobability
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Cache-enabled device-to-device (D2D) communications can boost network throughput. By pre-downloading contents to local caches of users, the content requested by a user can be transmitted via D2D links by other users in proximity. Prior works optimize the caching policy at users with the knowledge of content popularity, defined as the probability distribution of request for every file in a library from by all users. However, content popularity can not reflect the interest of each individual user and thus popularity-based caching policy may not fully capture the performance gain introduced by caching. In this paper, we optimize caching policy for cache-enabled D2D by learning user preference, defined as the conditional probability distribution of a user's request for a file given that the user sends a request. We first formulate an optimization problem with given user preference to maximize the offloading probability, which is proved as NP-hard, and then provide a greedy algorithm to find the solution. In order to predict the preference of each individual user, we model the user request behavior by probabilistic latent semantic analysis (pLSA), and then apply expectation maximization (EM) algorithm to estimate the model parameters. Simulation results show that the user preference can be learnt quickly. Compared to the popularity-based caching policy, the offloading gain achieved by the proposed policy can be remarkably improved even with predicted user preference.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Caching Strategy Towards Maximal D2D Assisted Offloading Gain

    eess.SP 2019-08 conditional novelty 6.0 of 10

    An analytical D2D success probability under trust-biased association is derived, and per-group caching densities are optimized to maximize successful D2D offloading.

Pith tools