Tree formation with physical layer security considerations in wireless multi-hop networks

Walid Saad, Xiangyun Zhou, Behrouz Maham, Tamer Başar, H. Vincent Poor

Research output: Contribution to journalArticle

40 Citations (Scopus)

Abstract

Physical layer security has emerged as a promising technique that complements existing cryptographic approaches and enables the securing of wireless transmissions against eavesdropping. In this paper, the impact of optimizing physical layer security metrics on the architecture and interactions of the nodes in multi-hop wireless networks is studied. In particular, a game-theoretic framework is proposed using which a number of nodes interact and choose their optimal and secure communication paths in the uplink of a wireless multi-hop network, in the presence of eavesdroppers. To this end, a tree formation game is formulated in which the players are the wireless nodes that seek to form a network graph among themselves while optimizing their multi-hop secrecy rates or the path qualification probabilities, depending on their knowledge of the eavesdroppers' channels. To solve this game, a distributed tree formation algorithm is proposed and is shown to converge to a stable Nash network. Simulation results show that the proposed approach yields significant performance gains in terms of both the average bottleneck secrecy rate per node and the average path qualification probability per node, relative to classical best-channel algorithms and the single-hop star network. The results also assess the properties and characteristics of the resulting Nash networks.

Original languageEnglish
Article number6314476
Pages (from-to)3980-3991
Number of pages12
JournalIEEE Transactions on Wireless Communications
Volume11
Issue number11
DOIs
StatePublished - Oct 4 2012

Fingerprint

Wireless multi-hop Networks
Vertex of a graph
Qualification
Game
Path
Stars
Wireless networks
Multi-hop Wireless Networks
Secure Communication
Uplink
Multi-hop
Star
Complement
Choose
Converge
Metric
Graph in graph theory
Interaction
Simulation

Keywords

  • game theory
  • multi-hop networks
  • network formation
  • Physical layer security

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

Tree formation with physical layer security considerations in wireless multi-hop networks. / Saad, Walid; Zhou, Xiangyun; Maham, Behrouz; Başar, Tamer; Vincent Poor, H.

In: IEEE Transactions on Wireless Communications, Vol. 11, No. 11, 6314476, 04.10.2012, p. 3980-3991.

Research output: Contribution to journalArticle

Saad, Walid ; Zhou, Xiangyun ; Maham, Behrouz ; Başar, Tamer ; Vincent Poor, H. / Tree formation with physical layer security considerations in wireless multi-hop networks. In: IEEE Transactions on Wireless Communications. 2012 ; Vol. 11, No. 11. pp. 3980-3991.
@article{05d8ece9f0bc47f4b8210e3e01542cef,
title = "Tree formation with physical layer security considerations in wireless multi-hop networks",
abstract = "Physical layer security has emerged as a promising technique that complements existing cryptographic approaches and enables the securing of wireless transmissions against eavesdropping. In this paper, the impact of optimizing physical layer security metrics on the architecture and interactions of the nodes in multi-hop wireless networks is studied. In particular, a game-theoretic framework is proposed using which a number of nodes interact and choose their optimal and secure communication paths in the uplink of a wireless multi-hop network, in the presence of eavesdroppers. To this end, a tree formation game is formulated in which the players are the wireless nodes that seek to form a network graph among themselves while optimizing their multi-hop secrecy rates or the path qualification probabilities, depending on their knowledge of the eavesdroppers' channels. To solve this game, a distributed tree formation algorithm is proposed and is shown to converge to a stable Nash network. Simulation results show that the proposed approach yields significant performance gains in terms of both the average bottleneck secrecy rate per node and the average path qualification probability per node, relative to classical best-channel algorithms and the single-hop star network. The results also assess the properties and characteristics of the resulting Nash networks.",
keywords = "game theory, multi-hop networks, network formation, Physical layer security",
author = "Walid Saad and Xiangyun Zhou and Behrouz Maham and Tamer Başar and {Vincent Poor}, H.",
year = "2012",
month = "10",
day = "4",
doi = "10.1109/TWC.2012.091812.111923",
language = "English",
volume = "11",
pages = "3980--3991",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - Tree formation with physical layer security considerations in wireless multi-hop networks

AU - Saad, Walid

AU - Zhou, Xiangyun

AU - Maham, Behrouz

AU - Başar, Tamer

AU - Vincent Poor, H.

PY - 2012/10/4

Y1 - 2012/10/4

N2 - Physical layer security has emerged as a promising technique that complements existing cryptographic approaches and enables the securing of wireless transmissions against eavesdropping. In this paper, the impact of optimizing physical layer security metrics on the architecture and interactions of the nodes in multi-hop wireless networks is studied. In particular, a game-theoretic framework is proposed using which a number of nodes interact and choose their optimal and secure communication paths in the uplink of a wireless multi-hop network, in the presence of eavesdroppers. To this end, a tree formation game is formulated in which the players are the wireless nodes that seek to form a network graph among themselves while optimizing their multi-hop secrecy rates or the path qualification probabilities, depending on their knowledge of the eavesdroppers' channels. To solve this game, a distributed tree formation algorithm is proposed and is shown to converge to a stable Nash network. Simulation results show that the proposed approach yields significant performance gains in terms of both the average bottleneck secrecy rate per node and the average path qualification probability per node, relative to classical best-channel algorithms and the single-hop star network. The results also assess the properties and characteristics of the resulting Nash networks.

AB - Physical layer security has emerged as a promising technique that complements existing cryptographic approaches and enables the securing of wireless transmissions against eavesdropping. In this paper, the impact of optimizing physical layer security metrics on the architecture and interactions of the nodes in multi-hop wireless networks is studied. In particular, a game-theoretic framework is proposed using which a number of nodes interact and choose their optimal and secure communication paths in the uplink of a wireless multi-hop network, in the presence of eavesdroppers. To this end, a tree formation game is formulated in which the players are the wireless nodes that seek to form a network graph among themselves while optimizing their multi-hop secrecy rates or the path qualification probabilities, depending on their knowledge of the eavesdroppers' channels. To solve this game, a distributed tree formation algorithm is proposed and is shown to converge to a stable Nash network. Simulation results show that the proposed approach yields significant performance gains in terms of both the average bottleneck secrecy rate per node and the average path qualification probability per node, relative to classical best-channel algorithms and the single-hop star network. The results also assess the properties and characteristics of the resulting Nash networks.

KW - game theory

KW - multi-hop networks

KW - network formation

KW - Physical layer security

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

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

U2 - 10.1109/TWC.2012.091812.111923

DO - 10.1109/TWC.2012.091812.111923

M3 - Article

AN - SCOPUS:84870524343

VL - 11

SP - 3980

EP - 3991

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 11

M1 - 6314476

ER -