Adaptive Resource Allocation for Secure Two-Hop Relaying Communication

Khoa T. Phan, Yi Hong, Emanuele Viterbo

Research output: Contribution to journalArticleResearchpeer-review

Abstract

In this paper, we develop novel transmission schemes for secure dual-hop Alice–Ray–Bob relaying communication over fading channels in the presence of a passive eavesdropper Eve. To control the risk of secrecy outage under unknown eavesdropper channel conditions, we impose secrecy constraint in terms of maximum allowable secrecy outage probability (SOP). We study the throughput–optimal buffer-aided adaptive relaying problem for two scenarios: 1) fixed (Alice and Ray) power allocation; and 2) adaptive power allocation. The resulting constrained optimization problems are solved using Lagrangian approach and convex optimization. In each frame, either Alice or Ray or neither is scheduled for transmission depending on the main (Alice– Ray and Ray–Bob) channel conditions. Since the transmission schemes can result in unboundedly large (queuing) delay at Ray’s buffer, we next study transmission schemes guaranteeing bounded average delay. The optimal transmission problem is formulated as an infinite horizon average reward constrained Markov decision process (MDP). Subsequently, by relying on a novel state value function approach, we show that in each frame, the solution can be obtained by solving a concave maximization problem, taking into account both the main channel conditions and the buffer state. An online transmission algorithm is developed to iteratively update the state value function, which converges to the optimal solution without requiring a-priori statistical information on the fading channels. Simulation results demonstrate the effectiveness of the proposed schemes over benchmark schemes under various secrecy constraint, and signalto- noise power ratio (SNR) regimes.

Original languageEnglish
Pages (from-to)8457-8472
Number of pages16
JournalIEEE Transactions on Wireless Communications
Volume17
Issue number12
DOIs
Publication statusPublished - 1 Dec 2018

Keywords

  • Communication system security
  • Delay-constrained communication
  • Delays
  • dual-hop relaying
  • Fading channels
  • Relays
  • resource allocation
  • Resource management
  • secrecy outage probability
  • Signal to noise ratio
  • Wireless communication
  • wiretap channel

Cite this

@article{cb8f799fa74541a886e9f3fb5aeea418,
title = "Adaptive Resource Allocation for Secure Two-Hop Relaying Communication",
abstract = "In this paper, we develop novel transmission schemes for secure dual-hop Alice–Ray–Bob relaying communication over fading channels in the presence of a passive eavesdropper Eve. To control the risk of secrecy outage under unknown eavesdropper channel conditions, we impose secrecy constraint in terms of maximum allowable secrecy outage probability (SOP). We study the throughput–optimal buffer-aided adaptive relaying problem for two scenarios: 1) fixed (Alice and Ray) power allocation; and 2) adaptive power allocation. The resulting constrained optimization problems are solved using Lagrangian approach and convex optimization. In each frame, either Alice or Ray or neither is scheduled for transmission depending on the main (Alice– Ray and Ray–Bob) channel conditions. Since the transmission schemes can result in unboundedly large (queuing) delay at Ray’s buffer, we next study transmission schemes guaranteeing bounded average delay. The optimal transmission problem is formulated as an infinite horizon average reward constrained Markov decision process (MDP). Subsequently, by relying on a novel state value function approach, we show that in each frame, the solution can be obtained by solving a concave maximization problem, taking into account both the main channel conditions and the buffer state. An online transmission algorithm is developed to iteratively update the state value function, which converges to the optimal solution without requiring a-priori statistical information on the fading channels. Simulation results demonstrate the effectiveness of the proposed schemes over benchmark schemes under various secrecy constraint, and signalto- noise power ratio (SNR) regimes.",
keywords = "Communication system security, Delay-constrained communication, Delays, dual-hop relaying, Fading channels, Relays, resource allocation, Resource management, secrecy outage probability, Signal to noise ratio, Wireless communication, wiretap channel",
author = "Phan, {Khoa T.} and Yi Hong and Emanuele Viterbo",
year = "2018",
month = "12",
day = "1",
doi = "10.1109/TWC.2018.2877677",
language = "English",
volume = "17",
pages = "8457--8472",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "IEEE, Institute of Electrical and Electronics Engineers",
number = "12",

}

Adaptive Resource Allocation for Secure Two-Hop Relaying Communication. / Phan, Khoa T.; Hong, Yi; Viterbo, Emanuele.

In: IEEE Transactions on Wireless Communications, Vol. 17, No. 12, 01.12.2018, p. 8457-8472.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Adaptive Resource Allocation for Secure Two-Hop Relaying Communication

AU - Phan, Khoa T.

AU - Hong, Yi

AU - Viterbo, Emanuele

PY - 2018/12/1

Y1 - 2018/12/1

N2 - In this paper, we develop novel transmission schemes for secure dual-hop Alice–Ray–Bob relaying communication over fading channels in the presence of a passive eavesdropper Eve. To control the risk of secrecy outage under unknown eavesdropper channel conditions, we impose secrecy constraint in terms of maximum allowable secrecy outage probability (SOP). We study the throughput–optimal buffer-aided adaptive relaying problem for two scenarios: 1) fixed (Alice and Ray) power allocation; and 2) adaptive power allocation. The resulting constrained optimization problems are solved using Lagrangian approach and convex optimization. In each frame, either Alice or Ray or neither is scheduled for transmission depending on the main (Alice– Ray and Ray–Bob) channel conditions. Since the transmission schemes can result in unboundedly large (queuing) delay at Ray’s buffer, we next study transmission schemes guaranteeing bounded average delay. The optimal transmission problem is formulated as an infinite horizon average reward constrained Markov decision process (MDP). Subsequently, by relying on a novel state value function approach, we show that in each frame, the solution can be obtained by solving a concave maximization problem, taking into account both the main channel conditions and the buffer state. An online transmission algorithm is developed to iteratively update the state value function, which converges to the optimal solution without requiring a-priori statistical information on the fading channels. Simulation results demonstrate the effectiveness of the proposed schemes over benchmark schemes under various secrecy constraint, and signalto- noise power ratio (SNR) regimes.

AB - In this paper, we develop novel transmission schemes for secure dual-hop Alice–Ray–Bob relaying communication over fading channels in the presence of a passive eavesdropper Eve. To control the risk of secrecy outage under unknown eavesdropper channel conditions, we impose secrecy constraint in terms of maximum allowable secrecy outage probability (SOP). We study the throughput–optimal buffer-aided adaptive relaying problem for two scenarios: 1) fixed (Alice and Ray) power allocation; and 2) adaptive power allocation. The resulting constrained optimization problems are solved using Lagrangian approach and convex optimization. In each frame, either Alice or Ray or neither is scheduled for transmission depending on the main (Alice– Ray and Ray–Bob) channel conditions. Since the transmission schemes can result in unboundedly large (queuing) delay at Ray’s buffer, we next study transmission schemes guaranteeing bounded average delay. The optimal transmission problem is formulated as an infinite horizon average reward constrained Markov decision process (MDP). Subsequently, by relying on a novel state value function approach, we show that in each frame, the solution can be obtained by solving a concave maximization problem, taking into account both the main channel conditions and the buffer state. An online transmission algorithm is developed to iteratively update the state value function, which converges to the optimal solution without requiring a-priori statistical information on the fading channels. Simulation results demonstrate the effectiveness of the proposed schemes over benchmark schemes under various secrecy constraint, and signalto- noise power ratio (SNR) regimes.

KW - Communication system security

KW - Delay-constrained communication

KW - Delays

KW - dual-hop relaying

KW - Fading channels

KW - Relays

KW - resource allocation

KW - Resource management

KW - secrecy outage probability

KW - Signal to noise ratio

KW - Wireless communication

KW - wiretap channel

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

U2 - 10.1109/TWC.2018.2877677

DO - 10.1109/TWC.2018.2877677

M3 - Article

VL - 17

SP - 8457

EP - 8472

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 12

ER -