Privacy-Preserving and Trustworthy Device-to-Device (D2D) Offloading Scheme
- Authors
- Baek, Hosung; Ko, Haneul; Pack, Sangheon
- Issue Date
- 2020
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Blockchain; device-to-device (D2D); offloading; privacy; static game
- Citation
- IEEE ACCESS, v.8, pp.191551 - 191560
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE ACCESS
- Volume
- 8
- Start Page
- 191551
- End Page
- 191560
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/59046
- DOI
- 10.1109/ACCESS.2020.3032735
- ISSN
- 2169-3536
- Abstract
- In device-to-device (D2D) offloading, frequent offloading to a specific mobile device (i.e., an offloadee) can violate the privacy of a task owner and proper offloading results cannot always be guaranteed due to untruthful mobile devices. To address these problems, we propose a privacy-preserving and trustworthy D2D offloading scheme (PPTS) with two steps: 1) a privacy-preserving offloading step and 2) a blockchain-based verification step. In the first step, a task owner selects several offloadees and offloads the tasks redundantly to them to obtain reliable offloading results with a minimum task completion delay while preserving its own privacy at a sufficient level. In addition, the task owner chooses another mobile device as a verifier. In the second step, the task owner and verifier exploit blockchain networks to check whether the offloading results are appropriately processed. We formulate a static game to decide an appropriate redundancy ratio of offloading tasks and incentives for the offloadees.The evaluation results demonstrate that PPTS can provide reliable offloading results with a reduced task completion delay and guarantee a sufficient level of privacy of the task owner.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer and Information Science > 1. Journal Articles
- College of Engineering > School of Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.