社交感知的D2D内容安全缓存算法

Social-aware D2D Secure Caching Algorithm

Device-to-Device(D2D)内容共享技术在使用户能够更加便捷、高效地获取内容的同时,也面临着更为严峻的安全挑战。针对窃听用户存在的D2D内容共享场景,通过设计基于最大距离可分(Maximum Distance Separable,MDS)码的D2D内容安全缓存机制,在提高缓存性能的同时实现内容共享的信息安全。首先,为了避开窃听用户并选择能够带来更好传输性能的内容提供者,提出了基于用户距离和社交信任度的内容提供者选择方案,以明确进行预缓存的用户。在此基础上,为了保证内容在D2D链路上的传输性能,并促使内容更多地缓存在用户更信任的内容提供者中,基于社交信任度和能效提出了社交相关能效的性能度量指标。然后,以最大化社交相关能效为目的,设计缓存内容布设方案,其核心优势在于:利用MDS编码特性提出安全缓存条件,从而在优化社交相关能效的基础上确保窃听用户无法获取足以恢复出原内容的编码块。最后,提出社交感知的基于MDS编码的D2D内容安全缓存算法。仿真分析表明,相比内容提供者随机选择的D2D内容安全缓存算法,所提算法的最优性能提升了15%;相比没有安全缓存条件的D2D内容缓存算法,所提算法虽然需要以42%的性能损失来确保信息安全,但其能够在内容提供者的缓存容量相对更小时实现性能最优。

Device-to-Device (D2D) content sharing technology is faced with some serious security challenges,which can be adopted to make users more conveniently and efficiently obtain contents.For D2D content sharing scenarios with eavesdroppers,secure caching mechanism based on Maximum Distance Separable (MDS) coding was designed to improve caching performance and meet security requirement.Firstly,content provider selection scheme based on users’ distance and social trust was designed to avoid that the eavesdroppers were selected to cache contents,and select content providers who could obtain higher transmission performance.Based on this,social- related energy efficiency was proposed to ensure the transmission performance and make contents be cached in the content providers that users believed in by using social trust and energy efficiency.Further,content caching placement was designed by maximizing social- related energy efficiency,whose core advantage is that secrecy constraints based on MDS coding was proposed to achieve that eavesdroppers could not obtain enough encoded packets to recover original contents.Finally,social-aware D2D secure caching algorithm based on MDS coding was proposed.Simulation results show that compared with the D2D content secure caching algorithm that content providers are selected randomly,the optimal performance of the proposed algorithm is improved by 15%.Compared with the D2D content caching algorithm without secrecy constraints,the proposed algorithm needs to achieve information security with a performance loss of 42%,but it can achieve its optimal performance when the content provider’s cache capacity is lower.