Resource Allocation for Wireless Networks: Basics, Techniques, and Applications
Resource Allocation for Wireless Networks: Basics, Techniques, and Applications
Wireless Ad Hoc and Sensor Networks: Theory and Applications
Wireless Ad Hoc and Sensor Networks: Theory and Applications
Amplify-and-forward based cooperation for secure wireless communications
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Distributed GABBA space-time codes in amplify-and-forward relay networks
IEEE Transactions on Wireless Communications
Physical layer security: coalitional games for distributed cooperation
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Physical layer security game: interaction between source, eavesdropper, and friendly jammer
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
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
Approximate core allocation for large cooperative security games
ISRN Communications and Networking
| Hi-index | 0.00 |
Cooperation among wireless nodes has been recently proposed for improving the physical layer (PHY) security of wireless transmission in the presence of multiple eavesdroppers. While existing PHY security literature answered the question "what are the link-level secrecy rate 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 cost for information exchange?". For this purpose, we model the PHY security cooperation problem as a coalitional game with non-transferable utility and propose a distributed algorithm for coalition formation. Using the proposed algorithm, the wireless users can cooperate and self-organize into disjoint independent coalitions, while maximizing their secrecy rate taking into account the costs during information exchange. We analyze the resulting coalitional structures for both decode-and-forward and amplify-and-forward cooperation and study how the users can adapt the network topology to environmental changes such as mobility. Through simulations, we assess the performance of the proposed algorithm and show that, by coalition formation using decode-and-forward, the average secrecy rate per user is increased of up to 25.3 and 24.4% (for a network with 45 users) relative to the non-cooperative and amplify-and-forward cases, respectively.