Privacy Concerned D2D-Assisted Delay-Tolerant Content Distribution System
It is foreseeable that device-to-device (D2D) communication will become a standard feature in the future, for the reason that it offloads the data traffic from network infrastructures to user devices. Recent researches prove that delivering delay-tolerant contents through content delivery network (C...
Main Author: | |
---|---|
Other Authors: | |
Language: | en |
Published: |
2019
|
Subjects: | |
Online Access: | http://hdl.handle.net/10754/632512 |
id |
ndltd-kaust.edu.sa-oai-repository.kaust.edu.sa-10754-632512 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-kaust.edu.sa-oai-repository.kaust.edu.sa-10754-6325122020-08-25T05:07:16Z Privacy Concerned D2D-Assisted Delay-Tolerant Content Distribution System Ma, Guoqing Shihada, Basem Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division Alouini, Mohamed-Slim Amin, Osama device to device user privacy content distribution network Markov random field It is foreseeable that device-to-device (D2D) communication will become a standard feature in the future, for the reason that it offloads the data traffic from network infrastructures to user devices. Recent researches prove that delivering delay-tolerant contents through content delivery network (CDN) by D2D helps network operators increase spectral and energy efficiency. However, protecting the private information of mobile users in D2D assistant CDN is the primary concern, which directly affects the willingness of mobile users to share their resources with others. In this thesis, we proposed a privacy concerned top layer system for selecting the sub-optimal set of mobile nodes as initial mobile content provider (MCP) for content delivery in any general D2D communications, which implies that our proposed system does not rely on private user information such as location, affinity, and personal preferences. We model the initial content carrier set problem as an incentive maximization problem to optimize the rewards for network operators and content providers. Then, we utilized the Markov random field (MRF) theory to build a probabilistic graphical model to make an inference on the observation of delivered contents. Furthermore, we proposed a greedy algorithm to solve the non-linear binary integer programming (NLBIP) problem for selecting the optimal initial content carrier set. The evaluations of the proposed system are based on both a simulated dataset and a real-world collected dataset corresponding to the off-line and on-line scenarios. 2019-04-28T12:02:50Z 2020-04-28T00:00:00Z 2019-04-28 Thesis 10.25781/KAUST-08FS9 http://hdl.handle.net/10754/632512 en 2020-04-28 At the time of archiving, the student author of this thesis opted to temporarily restrict access to it. The full text of this thesis became available to the public after the expiration of the embargo on 2020-04-28. |
collection |
NDLTD |
language |
en |
sources |
NDLTD |
topic |
device to device user privacy content distribution network Markov random field |
spellingShingle |
device to device user privacy content distribution network Markov random field Ma, Guoqing Privacy Concerned D2D-Assisted Delay-Tolerant Content Distribution System |
description |
It is foreseeable that device-to-device (D2D) communication will become a standard feature in the future, for the reason that it offloads the data traffic from network infrastructures to user devices. Recent researches prove that delivering delay-tolerant contents through content delivery network (CDN) by D2D helps network operators increase spectral and energy efficiency. However, protecting the private information of mobile users in D2D assistant CDN is the primary concern, which directly affects the willingness of mobile users to share their resources with others. In this thesis, we proposed a privacy concerned top layer system for selecting the sub-optimal set of mobile nodes as initial mobile content provider (MCP) for content delivery in any general D2D communications, which implies that our proposed system does not rely on private user information such as location, affinity, and personal preferences. We model the initial content carrier set problem as an incentive maximization problem to optimize the rewards for network operators and content providers. Then, we utilized the Markov random field (MRF) theory to build a probabilistic graphical model to make an inference on the observation of delivered contents. Furthermore, we proposed a greedy algorithm to solve the non-linear binary integer programming (NLBIP) problem for selecting the optimal initial content carrier set. The evaluations of the proposed system are based on both a simulated dataset and a real-world collected dataset corresponding to the off-line and on-line scenarios. |
author2 |
Shihada, Basem |
author_facet |
Shihada, Basem Ma, Guoqing |
author |
Ma, Guoqing |
author_sort |
Ma, Guoqing |
title |
Privacy Concerned D2D-Assisted Delay-Tolerant Content Distribution System |
title_short |
Privacy Concerned D2D-Assisted Delay-Tolerant Content Distribution System |
title_full |
Privacy Concerned D2D-Assisted Delay-Tolerant Content Distribution System |
title_fullStr |
Privacy Concerned D2D-Assisted Delay-Tolerant Content Distribution System |
title_full_unstemmed |
Privacy Concerned D2D-Assisted Delay-Tolerant Content Distribution System |
title_sort |
privacy concerned d2d-assisted delay-tolerant content distribution system |
publishDate |
2019 |
url |
http://hdl.handle.net/10754/632512 |
work_keys_str_mv |
AT maguoqing privacyconcernedd2dassisteddelaytolerantcontentdistributionsystem |
_version_ |
1719338888339652608 |