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

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

doi:10.1109/TWC.2012.091812.111923

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 journal › Article › peer-review

49 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 language	English
Article number	6314476
Pages (from-to)	3980-3991
Number of pages	12
Journal	IEEE Transactions on Wireless Communications
Volume	11
Issue number	11
DOIs	https://doi.org/10.1109/TWC.2012.091812.111923
Publication status	Published - 2012

Bibliographical note

Funding Information:
Manuscript received October 27, 2011; revised March 5 and July 16, 2012; accepted July 17, 2012. The associate editor coordinating the review of this paper and approving it for publication was D. Tarchi. W. Saad is with the Electrical and Computer Engineering Department, University of Miami, Coral Gables, FL, USA (e-mail: [email protected]). X. Zhou is with the Research School of Engineering, Australian National University, Australia (e-mail: [email protected]). B. Maham is with the School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran (e-mail: [email protected]). T. Bas¸ar is with the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, USA (e-mail: [email protected]). H. V. Poor is with the Electrical Engineering Department, Princeton University, Princeton, NJ, USA (e-mail: [email protected]). A preliminary version of this work was presented as an invited paper at the Third International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) [47]. This work was supported in part by the Australian Research Council’s Discovery Projects funding scheme (project no. DP110102548), and in part by an AFOSR MURI Grant (FA9550-10-1-0573). Digital Object Identifier 10.1109/TWC.2012.091812.111923

Keywords

Physical layer security
game theory
multi-hop networks
network formation

Access to Document

10.1109/TWC.2012.091812.111923

Cite this

@article{53ab4ab0f835419eb31b9b7b358c06ac,

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 = "Physical layer security, game theory, multi-hop networks, network formation",

author = "Walid Saad and Xiangyun Zhou and Behrouz Maham and Tamer Ba{\c s}ar and \{Vincent Poor\}, H.",

note = "Funding Information: Manuscript received October 27, 2011; revised March 5 and July 16, 2012; accepted July 17, 2012. The associate editor coordinating the review of this paper and approving it for publication was D. Tarchi. W. Saad is with the Electrical and Computer Engineering Department, University of Miami, Coral Gables, FL, USA (e-mail: [email protected]). X. Zhou is with the Research School of Engineering, Australian National University, Australia (e-mail: [email protected]). B. Maham is with the School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran (e-mail: [email protected]). T. Bas¸ar is with the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, USA (e-mail: [email protected]). H. V. Poor is with the Electrical Engineering Department, Princeton University, Princeton, NJ, USA (e-mail: [email protected]). A preliminary version of this work was presented as an invited paper at the Third International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) [47]. This work was supported in part by the Australian Research Council{\textquoteright}s Discovery Projects funding scheme (project no. DP110102548), and in part by an AFOSR MURI Grant (FA9550-10-1-0573). Digital Object Identifier 10.1109/TWC.2012.091812.111923",

year = "2012",

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.

N1 - Funding Information: Manuscript received October 27, 2011; revised March 5 and July 16, 2012; accepted July 17, 2012. The associate editor coordinating the review of this paper and approving it for publication was D. Tarchi. W. Saad is with the Electrical and Computer Engineering Department, University of Miami, Coral Gables, FL, USA (e-mail: [email protected]). X. Zhou is with the Research School of Engineering, Australian National University, Australia (e-mail: [email protected]). B. Maham is with the School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran (e-mail: [email protected]). T. Bas¸ar is with the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, USA (e-mail: [email protected]). H. V. Poor is with the Electrical Engineering Department, Princeton University, Princeton, NJ, USA (e-mail: [email protected]). A preliminary version of this work was presented as an invited paper at the Third International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) [47]. This work was supported in part by the Australian Research Council’s Discovery Projects funding scheme (project no. DP110102548), and in part by an AFOSR MURI Grant (FA9550-10-1-0573). Digital Object Identifier 10.1109/TWC.2012.091812.111923

PY - 2012

Y1 - 2012

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 - Physical layer security

KW - game theory

KW - multi-hop networks

KW - network formation

UR - https://www.scopus.com/pages/publications/84870524343

U2 - 10.1109/TWC.2012.091812.111923

DO - 10.1109/TWC.2012.091812.111923

M3 - Article

AN - SCOPUS:84870524343

SN - 1536-1276

VL - 11

SP - 3980

EP - 3991

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

IS - 11

M1 - 6314476

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this