Resource Allocation for Covert Communication in D2D Content Sharing: A Matching Game Approach
Authors:
Open Access
- 29 May 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 72835-72849
Abstract
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 a 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: i) In order to guarantee the robustness of our scheme, covert constraints are learnt by analyzing the detection performance at the warden, i.e., the security of D2D content sharing is guaranteed even considering some extremely adverse environments. ii) The joint spectrum allocation and power control is modeled as a two-sided matching problem and then reformulated as an 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, a covert constraints guaranteed resource allocation algorithm based on Gale-Shapley algorithm is proposed. Its properties, such as stability, optimality, convergence and complexity are analyzed. 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.Keywords
Funding Information
- National Natural Science Foundation of China (61671474)
- Jiangsu Provincial Natural Science Fund for Outstanding Young Scholars (BK20180028)
- Jiangsu Provincial Natural Science Fund for Excellent Young Scholars (BK20170089)
This publication has 44 references indexed in Scilit:
- Social Network-Based Content Delivery in Device-to-Device Underlay Cellular Networks Using Matching TheoryIEEE Access, 2016
- D2D Fogging: An Energy-Efficient and Incentive-Aware Task Offloading Framework via Network-assisted D2D CollaborationIEEE Journal on Selected Areas in Communications, 2016
- Fundamental Limits of Communication With Low Probability of DetectionIEEE Transactions on Information Theory, 2016
- Covert Communication Over Noisy Channels: A Resolvability PerspectiveIEEE Transactions on Information Theory, 2016
- Hiding information in noise: fundamental limits of covert wireless communicationIEEE Communications Magazine, 2015
- Enhancing wireless information and power transfer by exploiting multi-antenna techniquesIEEE Communications Magazine, 2015
- Secure key establishment for Device-to-Device communications2014
- Reliable deniable communication: Hiding messages in noise2013
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949