Distributed coalition formation games for secure wireless transmission

Walid Saad, Zhu Han, Tamer Başar, Mérouane Debbah, Are Hjørungnes

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

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 linklevel 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 nontransferable 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 amplifyand-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.

Original languageEnglish
Pages (from-to)231-245
Number of pages15
JournalMobile Networks and Applications
Volume16
Issue number2
DOIs
StatePublished - Apr 1 2011

Fingerprint

Parallel algorithms
Costs
Wireless networks
Topology

Keywords

  • Coalitional games
  • Game theory
  • Physical layer security
  • Secure communication

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

Distributed coalition formation games for secure wireless transmission. / Saad, Walid; Han, Zhu; Başar, Tamer; Debbah, Mérouane; Hjørungnes, Are.

In: Mobile Networks and Applications, Vol. 16, No. 2, 01.04.2011, p. 231-245.

Research output: Contribution to journalArticle

Saad, W, Han, Z, Başar, T, Debbah, M & Hjørungnes, A 2011, 'Distributed coalition formation games for secure wireless transmission', Mobile Networks and Applications, vol. 16, no. 2, pp. 231-245. https://doi.org/10.1007/s11036-010-0275-1
Saad, Walid ; Han, Zhu ; Başar, Tamer ; Debbah, Mérouane ; Hjørungnes, Are. / Distributed coalition formation games for secure wireless transmission. In: Mobile Networks and Applications. 2011 ; Vol. 16, No. 2. pp. 231-245.
@article{9408dbdcbf784aa584580e151b3a6de8,
title = "Distributed coalition formation games for secure wireless transmission",
abstract = "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 linklevel 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 nontransferable 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 amplifyand-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.",
keywords = "Coalitional games, Game theory, Physical layer security, Secure communication",
author = "Walid Saad and Zhu Han and Tamer Başar and M{\'e}rouane Debbah and Are Hj{\o}rungnes",
year = "2011",
month = "4",
day = "1",
doi = "10.1007/s11036-010-0275-1",
language = "English",
volume = "16",
pages = "231--245",
journal = "Mobile Networks and Applications",
issn = "1383-469X",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Distributed coalition formation games for secure wireless transmission

AU - Saad, Walid

AU - Han, Zhu

AU - Başar, Tamer

AU - Debbah, Mérouane

AU - Hjørungnes, Are

PY - 2011/4/1

Y1 - 2011/4/1

N2 - 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 linklevel 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 nontransferable 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 amplifyand-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.

AB - 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 linklevel 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 nontransferable 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 amplifyand-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.

KW - Coalitional games

KW - Game theory

KW - Physical layer security

KW - Secure communication

UR - http://www.scopus.com/inward/record.url?scp=79956152661&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79956152661&partnerID=8YFLogxK

U2 - 10.1007/s11036-010-0275-1

DO - 10.1007/s11036-010-0275-1

M3 - Article

VL - 16

SP - 231

EP - 245

JO - Mobile Networks and Applications

JF - Mobile Networks and Applications

SN - 1383-469X

IS - 2

ER -