Resource Allocation for Covert Communication in D2D Content Sharing: A Matching Game Approach
Device-to-device (D2D) content sharing, as a promising solution to rapidly growing mobile data traffic, is facing serious security issues. Hence, how to ensure its security is challenging and meaningful work. Covert communication is regarded as an emerging and cutting-edge security technique for its...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8725575/ |
| _version_ | 1818349479549468672 |
|---|---|
| author | Xin Shi Dan Wu Chao Yue Cheng Wan Xinrong Guan |
| author_facet | Xin Shi Dan Wu Chao Yue Cheng Wan Xinrong Guan |
| author_sort | Xin Shi |
| collection | DOAJ |
| description | Device-to-device (D2D) content sharing, as a promising solution to rapidly growing mobile data traffic, is facing serious security issues. Hence, how to ensure its security is challenging and meaningful work. Covert communication is regarded as an emerging and cutting-edge security technique for its higher level of security and less need for channel state information (CSI), and accordingly, has attracted wide attention. However, it is not easy to directly apply covert communication to D2D content sharing to ensure both security and efficiency. In this paper, a novel covert communication model is constructed in D2D content sharing scenario, where the co-channel interference (CCI) introduced by spectrum reusing is exploited as the cover of contents so that the contents are hidden from the warden. Then, we propose a secure and efficient resource allocation scheme to ensure both security and efficiency of D2D content sharing by addressing the following two issues: 1) In order to guarantee the robustness of our scheme, covert constraints are learned by analyzing the detection performance at the warden, i.e., the security of D2D content sharing is guaranteed even considering some extremely adverse environments. 2) The joint spectrum allocation and power control is modeled as a two-sided matching problem and then reformulated as the one-to-one matching game based on the principle of mutual benefit, in order to ensure the quality of service (QoS) requirements of both D2D pairs and cellular users. Then, covert constraints guaranteed resource allocation algorithm based on Gale-Shapley algorithm is proposed. Its properties such as stability, optimality, convergence, and complexity are analyzed. The extensive simulation results are provided to verify the theoretical analyses and demonstrate the efficiency of our proposed algorithm, which has at least 7.63% performance gain compared with some existing approaches and no more than 4.83% performance loss compared with the exhaustive search. |
| first_indexed | 2024-12-13T18:06:36Z |
| format | Article |
| id | doaj.art-9235795183404adc90a015b53f20f316 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-13T18:06:36Z |
| publishDate | 2019-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-9235795183404adc90a015b53f20f3162022-12-21T23:36:03ZengIEEEIEEE Access2169-35362019-01-017728357284910.1109/ACCESS.2019.29194538725575Resource Allocation for Covert Communication in D2D Content Sharing: A Matching Game ApproachXin Shi0https://orcid.org/0000-0002-0243-1539Dan Wu1https://orcid.org/0000-0002-2722-8676Chao Yue2Cheng Wan3Xinrong Guan4College of Communications Engineering, Army Engineering University of PLA, Nanjing, ChinaCollege of Communications Engineering, Army Engineering University of PLA, Nanjing, ChinaCollege of Communications Engineering, Army Engineering University of PLA, Nanjing, ChinaCollege of Communications Engineering, Army Engineering University of PLA, Nanjing, ChinaCollege of Communications Engineering, Army Engineering University of PLA, Nanjing, ChinaDevice-to-device (D2D) content sharing, as a promising solution to rapidly growing mobile data traffic, is facing serious security issues. Hence, how to ensure its security is challenging and meaningful work. Covert communication is regarded as an emerging and cutting-edge security technique for its higher level of security and less need for channel state information (CSI), and accordingly, has attracted wide attention. However, it is not easy to directly apply covert communication to D2D content sharing to ensure both security and efficiency. In this paper, a novel covert communication model is constructed in D2D content sharing scenario, where the co-channel interference (CCI) introduced by spectrum reusing is exploited as the cover of contents so that the contents are hidden from the warden. Then, we propose a secure and efficient resource allocation scheme to ensure both security and efficiency of D2D content sharing by addressing the following two issues: 1) In order to guarantee the robustness of our scheme, covert constraints are learned by analyzing the detection performance at the warden, i.e., the security of D2D content sharing is guaranteed even considering some extremely adverse environments. 2) The joint spectrum allocation and power control is modeled as a two-sided matching problem and then reformulated as the one-to-one matching game based on the principle of mutual benefit, in order to ensure the quality of service (QoS) requirements of both D2D pairs and cellular users. Then, covert constraints guaranteed resource allocation algorithm based on Gale-Shapley algorithm is proposed. Its properties such as stability, optimality, convergence, and complexity are analyzed. The extensive simulation results are provided to verify the theoretical analyses and demonstrate the efficiency of our proposed algorithm, which has at least 7.63% performance gain compared with some existing approaches and no more than 4.83% performance loss compared with the exhaustive search.https://ieeexplore.ieee.org/document/8725575/D2D content sharingcovert communicationco-channel interferenceresource allocationmatching game |
| spellingShingle | Xin Shi Dan Wu Chao Yue Cheng Wan Xinrong Guan Resource Allocation for Covert Communication in D2D Content Sharing: A Matching Game Approach IEEE Access D2D content sharing covert communication co-channel interference resource allocation matching game |
| title | Resource Allocation for Covert Communication in D2D Content Sharing: A Matching Game Approach |
| title_full | Resource Allocation for Covert Communication in D2D Content Sharing: A Matching Game Approach |
| title_fullStr | Resource Allocation for Covert Communication in D2D Content Sharing: A Matching Game Approach |
| title_full_unstemmed | Resource Allocation for Covert Communication in D2D Content Sharing: A Matching Game Approach |
| title_short | Resource Allocation for Covert Communication in D2D Content Sharing: A Matching Game Approach |
| title_sort | resource allocation for covert communication in d2d content sharing a matching game approach |
| topic | D2D content sharing covert communication co-channel interference resource allocation matching game |
| url | https://ieeexplore.ieee.org/document/8725575/ |
| work_keys_str_mv | AT xinshi resourceallocationforcovertcommunicationind2dcontentsharingamatchinggameapproach AT danwu resourceallocationforcovertcommunicationind2dcontentsharingamatchinggameapproach AT chaoyue resourceallocationforcovertcommunicationind2dcontentsharingamatchinggameapproach AT chengwan resourceallocationforcovertcommunicationind2dcontentsharingamatchinggameapproach AT xinrongguan resourceallocationforcovertcommunicationind2dcontentsharingamatchinggameapproach |