A Novel Socially Stable Matching Model for Secure Relay Selection in D2D Communications

Abstract

In this letter, we investigate how to leverage inter-human social ties to strike a trade-off between the physical layer security and throughput performance in device-to-device (D2D) communications with relay selection. Different from standard stable matching model assuming that all agents are trusted, we first relax this assumption by considering the fact that the blocking pair with social ties can facilitate the deviation. In the so-called socially stable matching model, we can find a stable matching over two independent graph models rather than over a reconstructed graph by reserving the intersection between edges in physical graph and social graph. Simulation results corroborate the superiority of our proposed scheme.