Home Technology Auction-based Security Game for Multiuser Cooperative Networks
Article
Licensed
Unlicensed Requires Authentication

Auction-based Security Game for Multiuser Cooperative Networks

  • , EMAIL logo , and
Published/Copyright: April 11, 2013
Become an author with De Gruyter Brill

Abstract

In this paper, we develop an auction-based algorithm to allocate the relay power efficiently to improve the system secrecy rate in a cooperative network, where several source-destination pairs and one cooperative relay are involved. On the one hand, the cooperative relay assists these pairs to transmit under a peak power constraint. On the other hand, the relay is untrusty and is also a passive eavesdropper. The whole auction process is completely distributed and no instantaneous channel state information exchange is needed. We also prove the existence and uniqueness of the Nash Equilibrium (NE) for the proposed power auction game. Moreover, the Pareto optimality is also validated. Simulation results show that our proposed auction-based algorithm can effectively improve the system secrecy rate. Besides, the proposed auction-based algorithm can converge to the unique NE point within a finite number of iterations. More interestingly, we also find that the proposed power auction mechanism is cheat-proof.


Institute of Communications Engineering, PLA University of Science and Technology, Nanjing 210007, China

Received: 2012-07-30
Published Online: 2013-04-11
Published in Print: 2013-04-13

©[2013] by Walter de Gruyter Berlin Boston

Downloaded on 1.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/freq-2012-0098/html
Scroll to top button