4.7 Article

Security Enhanced Content Sharing in Social IoT: A Directed Hypergraph-Based Learning Scheme

Journal

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume 69, Issue 4, Pages 4403-4416

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2020.2975884

Keywords

Social Internet of Things; directed hypergraph; game theory; machine learning

Funding

  1. Key Research & Development Project for Science and Technology of Xuzhou, China [KC18105]
  2. National Natural Science Foundation of China [51734009, 61771417, 51804304, 61871065]
  3. Newton Fund Institutional Link through the Fly-by Flood Monitoring Project [428328486]

Ask authors/readers for more resources

Security is a critical element to the existing Internet of Things (IoT) deployment, where any user may actively or passively attack the content sharing of others reusing the same channel. As most smart devices are carried by human, we may leverage their owners' social trust to avoid being intercepted by untrusted users, which conforms to the Social Internet of Things (SIoT) paradigm. In this paper, we propose a secure content sharing (SCS) scheme to strike the trade-off between security and quality of experience (QoE) by exploring the social trust. Firstly, to dynamically extract the social trust, the random walk strategy is employed for prediction based on the proposed User-Content-Social Group graph which models users' preference over time. Given the social trust value, we propose a hierarchical game model to decouple the optimization problem into two sub-problems: user pairing and channel selection. More specifically, the user pairing sub-problem is formulated as a matching sub-game with peer effect, and the embedded rotation-swap matching algorithm can accommodate the dynamics caused by mutual interference. The second sub-problem can be formulated as a secure channel selection sub-game with the directed hypergraph being game space, which is proved to be an exact potential game. Then, we design an uncoupled-user concurrent learning algorithm (UUCL) to search for the optimal pure Nash equilibrium, and thereby the global optimum of this sub-game is achieved. Finally, simulation results generated on realistic social dataset verify that our proposed scheme can notably enhance the security without sacrificing users' QoE.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available