Coordinated Multiple-Relays Based Physical-Layer Security Improvement: A Single-Leader Multiple-Followers Stackelberg Game Scheme

Fang, He; Wang, Xianbin

doi:10.1109/tifs.2017.2746001

Cited by 47 publications

(25 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At last, we introduce the communication rate and secrecy rate in above scenario. The communication rate at destinations and eavesdropper are as follows [22],…”

Section: ∑ ∑mentioning

confidence: 99%

Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays

Kong¹,

Wang²,

Li³

et al. 2018

Preprint

View full text Add to dashboard Cite

In this paper, we first investigate secure communications for a two-hop interference relay system in the wireless Internet of Things (IoT), where K source-destination pairs communicate in the presence of an eavesdropper. Explicitly, we jointly design source, relay and destination matrices upon minimizing total mean-squared error (MSE) of all legitimate destinations while keeping the MSE at eavesdropper above a certain threshold. We illuminate that the joint design of the source, relay and destination matrices subject to both secrecy and transmit power constraints. More specifically, we proposed an efficient iterative distributed algorithm to simplify the process of the joint design for optimal source, relay and destination matrices. Furthermore, the convergence of the iterative distributed algorithm is described. Additionally, the performances of the proposed algorithm, including both its secrecy rate and MSE, are characterized with the aid of simulation results. We demonstrate that our proposed algorithm outperforms the traditional approach. As a benefit, secure communications can be guaranteed by using the proposed algorithm for the multiple input multiple output (MIMO) interference relay IoT network in the presence of an eavesdropper.

show abstract

“…At last, we introduce the communication rate and secrecy rate in above scenario. The communication rate at destinations and eavesdropper are as follows [22],…”

Section: ∑ ∑mentioning

confidence: 99%

Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays

Kong¹,

Wang²,

Li³

et al. 2018

Preprint

View full text Add to dashboard Cite

show abstract

“…At last, we introduce the communication rate and secrecy rate in this system model. The communication rate at destinations and eavesdropper are as follows [ 42 ],

…”

Section: The Iterative Distributed Algorithm Of Solving Source Rementioning

confidence: 99%

Robust Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays

Kong

Wang

et al. 2018

Sensors

View full text Add to dashboard Cite

In this article, we first investigate secure communications for a two-hop interference channel relay system with imperfect channel estimation in the wireless Internet of Things (IoT), where K source-destination pairs communicate simultaneously when an eavesdropper exists. We jointly conceive source, relay and destination matrices upon minimizing total mean-squared error (MSE) of all legitimate destinations while keeping the MSE at eavesdropper above a given threshold. We illuminate that the design of the source, relay and destination matrices is subject to both transmit power constraints and secrecy requirements. More specifically, we propose an efficient robust iterative distributed algorithm to simplify the process of the joint design for optimal source, relay and destination matrices. Furthermore, the convergence of the iterative distributed algorithm is described. Additionally, the performances of our proposed algorithm, such as its secrecy rate and MSE, are characterized in the form of simulation results. The simulation results reveal that the proposed algorithm is superior to the traditional approach. As a benefit, secure communications can be ensured by using the proposed algorithm for the multiple input multiple output (MIMO) interference relay IoT network in the presence of an eavesdropper.

show abstract

“…To tackle this problem, collaborative communication has been considered as one important approach to achieve the physical layer security. Due to its inherent metrics of providing spatial diversity, multiplexing ability and the extended coverage of wireless network, relaying secrecy systems have attracted much attention recently 12‐24 . Among them, the optimal beamforming schemes exploiting amplify‐and‐forward (AF) relaying was studied in References 15,16,20.…”

Section: Introductionmentioning

confidence: 99%

Secure transmission for wireless collaborative systems based on second‐order channel statistics

Yan

Yang

et al. 2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

In this article, we investigate the maximum secrecy rates (SRs) and the optimal beamforming schemes for a collaborative wireless network under uncertain channel levels of available second-order statistics. Both decode-and-forward (DF) and amplify-and-forward (AF) strategies under the aggregate and individual power constraints are considered. We have derived the maximum SRs and the optimal beamforming vectors under aforementioned conditions and an efficient cooperation paradigm to provide secrecy in a multirelay environment. A closed-form maximum SR in the DF scheme under aggregate power constraint is presented. Next, the upper and lower bounds for the maximum SR under aggregate power constraint in the AF scheme is derived. The optimization problem in the AF scheme can be converted into a convex semidefinite programming problem, which is efficiently solved by the bisection method. Moreover, the optimal beamforming weights are also obtained to maximize the SRs under both aggregate and individual relay power constraints. Numerical results are provided to demonstrate the effectiveness of proposed algorithms. Lei Yan and Jihua Lu equally contributing authors.

show abstract

Coordinated Multiple-Relays Based Physical-Layer Security Improvement: A Single-Leader Multiple-Followers Stackelberg Game Scheme

Cited by 47 publications

References 31 publications

Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays

Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays

Robust Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays

Secure transmission for wireless collaborative systems based on second‐order channel statistics

Contact Info

Product

Resources

About