Multiple-Access Channels With Confidential Messages
IEEE Transactions on Information Theory
Secure Communication Over Fading Channels
IEEE Transactions on Information Theory
On the Secrecy Capacity of Fading Channels
IEEE Transactions on Information Theory
Downlink capacity evaluation of cellular networks with known-interference cancellation
IEEE Journal on Selected Areas in Communications
Coalitional games for distributed eavesdroppers cooperation in wireless networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Distributed Coalition Formation Games for Secure Wireless Transmission
Mobile Networks and Applications
Relay and jammer cooperation as a coalitional game in secure cooperative wireless networks
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Game theory meets network security and privacy
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Cooperation between wireless network nodes is a promising technique for improving the physical layer security of wireless transmission, in terms of secrecy capacity, in the presence of multiple eavesdroppers. While existing physical layer security literature answered the question "what are the link-level secrecy capacity gains from cooperation?", this paper attempts to answer the question of "how to achieve those gains in a practical decentralized wireless network and in the presence of a secrecy capacity cost for information exchange?". For this purpose, we model the physical layer security cooperation problem as a coalitional game with non-transferable utility and propose a distributed algorithm for coalition formation. Through the proposed algorithm, the wireless users can autonomously cooperate and self-organize into disjoint independent coalitions, while maximizing their secrecy capacity taking into account the security costs during information exchange. We analyze the resulting coalitional structures, discuss their properties, and study how the users can self-adapt the network topology to environmental changes such as mobility. Simulation results show that the proposed algorithm allows the users to cooperate and self-organize while improving the average secrecy capacity per user up to 25.32% relative to the non-cooperative case.