The Gaussian Multiple Access Wiretap Channel With Selfish Transmitters: A Coalitional Game Theory Perspective

被引:0
|
作者
Chou, Remi A. [1 ]
Yener, Aylin [2 ]
机构
[1] Univ Texas Arlington, Dept Comp Sci & Engn, Arlington, TX 76019 USA
[2] Ohio State Univ, Dept Elect & Comp Engn, Columbus, OH 43210 USA
关键词
Transmitters; Jamming; Wireless networks; Surveillance; Oral communication; Forensics; Eavesdropping; Gaussian multiple access wiretap channel; adversarial jamming; coalitional game theory;
D O I
10.1109/TIT.2024.3411918
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers the Gaussian multiple access wiretap channel (GMAC-WT) with selfish transmitters, i.e., who are each solely interested in maximizing their individual secrecy rate. The question then arises as to whether selfish transmitters can increase their individual secrecy rate by participating in a collective, i.e, multiple access, protocol instead of operating on their own. If yes, the question arises whether there is a protocol that satisfies all the participating transmitters simultaneously, in the sense that no transmitter has an incentive to deviate from the protocol. Utilizing coalitional game theory, these questions are addressed for the degraded GMAC-WT with an arbitrary number of transmitters and for the non-degraded GMAC-WT with two transmitters. In particular, for the degraded GMAC-WT, cooperation is shown to be in the best interest of all transmitters, and the existence of protocols that incentivize all transmitters to participate is established. Furthermore, a unique, fair, stable, and achievable secrecy rate allocation is determined. For the non-degraded GMAC-WT, depending on the channel parameters, there are cases where cooperation is not in the best interest of all transmitters, and cases where it is. In the latter cases, a unique, fair, stable, and achievable secrecy rate allocation is determined.
引用
收藏
页码:7432 / 7446
页数:15
相关论文
共 50 条
  • [1] The Degraded Gaussian Multiple Access Wiretap Channel with Selfish Transmitters: A Coalitional Game Theory Perspective
    Chou, Remi A.
    Yener, Aylin
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1703 - 1707
  • [2] On the Gaussian Multiple Access Wiretap Channel and the Gaussian Wiretap Channel With a Helper: Achievable Schemes and Upper Bounds
    Fritschek, Rick
    Wunder, Gerhard
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2019, 14 (05) : 1224 - 1239
  • [3] Secure Degrees of Freedom of the Gaussian Multiple Access Wiretap Channel
    Xie, Jianwei
    Ulukus, Sennur
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1337 - 1341
  • [4] LDPC codes over Gaussian multiple access wiretap channel
    Shahbaz, Sahar
    Akhbari, Bahareh
    Asvadi, Reza
    IET COMMUNICATIONS, 2018, 12 (08) : 962 - 969
  • [5] Secure Degrees of Freedom Region of the Gaussian Multiple Access Wiretap Channel
    Xie, Jianwei
    Ulukus, Sennur
    2013 ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, 2013, : 293 - 297
  • [6] Game Theoretic Considerations for the Gaussian Multiple Access Channel
    Gajic, Vojislav
    Rimoldi, Bixio
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2523 - 2527
  • [7] A Constrained Evolutionary Gaussian Multiple Access Channel Game
    Zhu, Quanyan
    Tembine, Hamidou
    Basar, Tamer
    2009 INTERNATIONAL CONFERENCE ON GAME THEORY FOR NETWORKS (GAMENETS 2009), 2009, : 403 - +
  • [8] The Gaussian Multiple Access Wiretap Channel when the Eavesdropper can Arbitrarily Jam
    Chou, Remi A.
    Yener, Aylin
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1958 - 1962
  • [9] Multiple Access Wiretap Channel with Cribbing
    Helal, Noha
    Nosratinia, Aria
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 739 - 743
  • [10] On the Secrecy of Multiple Access Wiretap Channel
    Ekrem, Ersen
    Ulukus, Sennur
    2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, : 1014 - 1021