Abstract
In this paper, we investigate the secure content delivery issue for device-to-device (D2D) networks based on a trust evaluation mechanism and a covert communication model. Specifically, to stimulate lasting and rational cooperation among mobile devices, we propose a trust evaluation mechanism where the trust degree between two mobile devices is derived from historical assessed values. Simultaneously, a covert communication model is introduced to guarantee the undetectability of content delivery, preventing malicious wardens from launching external attacks. Combining security-aware metrics—trust degree and covert rate—with physical layer transmission performance, we define a "secrecy-aware effective rate" to guide the joint optimization of content delivery mode selection and resource management. This is formulated as a social welfare maximization problem. To solve this complex problem, it is decoupled into two subproblems: mode selection (a many-to-one matching problem) and resource management (a one-to-one matching problem). We propose a novel hierarchical stable matching algorithm (HSMA) to obtain three-dimensional stable matching results. Extensive numerical results demonstrate the advantages of our proposed algorithms in terms of stability, convergence, and optimality.
Introduction
Device-to-Device (D2D) networks represent a paradigm shift in mobile communications, allowing devices to share cached content directly and bypass base stations (BS) to reduce latency and bandwidth consumption. However, the decentralized nature of D2D sharing introduces two critical vulnerabilities. First, internal selfishness (or free-riding) occurs when users hesitate to share content to preserve their own battery and storage. Second, external attacks are facilitated by open wireless channels, where malicious "wardens" can detect and intercept D2D transmissions. This research addresses these challenges by integrating social trust and physical-layer covertness into a unified optimization framework.
System Model and Delivery Modes
The network environment consists of potential content providers, demanders, and cellular users, all operating under the watchful eye of a malicious warden. To maximize system utility, the network must choose between various delivery modes: traditional Base-Station-to-Device (B2D), standard D2D, and Multi-Device-to-Device (MD2D) modes.
Proposed Security Framework
Trust Evaluation Mechanism
To combat user selfishness, the system employs a trust evaluation mechanism. Instead of relying on static social metrics, devices calculate "trust degrees" based on historical interactions. Nodes that consistently share content earn high trust scores, while selfish nodes are marginalized. This creates a self-policing ecosystem where rational cooperation is the most beneficial strategy for all participants.
Covert Communication Model
To defend against external wardens, the system utilizes covert communication. D2D providers reuse the uplink spectrum of active cellular users. In a clever reversal of traditional network logic, the co-channel interference generated by the cellular user is used as a "camouflage noise." This interference masks the D2D signal, making it difficult for a warden to determine if a transmission is even occurring.
Hierarchical Stable Matching Algorithm (HSMA)
The joint optimization of mode selection and resource management is a three-dimensional (3D) matching problem (Providers vs. Demanders vs. Cellular Users), which is notoriously NP-hard. The authors propose the Hierarchical Stable Matching Algorithm (HSMA), which decouples the problem into two interacting 2D matching games:
- Mode Selection Algorithm (MSA): A many-to-one matching game where demanders and providers pair up based on trust and content availability.
- Resource Allocation Algorithm (RAA): A one-to-one matching game where D2D pairs are matched with cellular users to reuse spectrum, balancing interference against the need for covertness.
HSMA iterates between these two stages until a stable 3D matching is achieved, ensuring that no participant has an incentive to deviate from their assigned match.
Key Results and Discussion
Numerical simulations demonstrate that HSMA achieves near-optimal social welfare, closely matching the results of exhaustive search methods while maintaining significantly lower computational complexity. Key findings include:
- Rapid Convergence: The algorithm typically reaches a stable state in fewer than 30 iterations.
- MD2D Advantage: Allowing multiple providers to serve a single demander (MD2D mode) significantly boosts individual user utility and overall system throughput compared to strict 1-to-1 pairings.
- Robustness: By embedding trust into the utility function, the network naturally excludes selfish nodes, maintaining a high level of cooperative efficiency even in diverse user environments.
Conclusion
By combining trust evaluation with covert communication, this research provides a robust framework for secure D2D content delivery. The proposed HSMA offers a computationally efficient way to manage complex 3D matching in dynamic networks. Future work will explore the application of these covert models in unlicensed frequency bands, where interference patterns are more unpredictable.
Summary updated