Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Wireless Communications and Networking Conference

Energy-delay-secrecy tradeoffs in wireless communications under channel uncertainty

Mustafa Ozmen, M. Cenk Gursoy

Published Apr 1, 2018• 3 citations
Publisher

Abstract

In this paper, energy-efficient and secure communication over wireless fading channels is investigated when data arrivals are modeled as Markovian processes (e.g., discrete Markov and Markov fluid processes) in the presence of limitations on buffer overflow probabilities. It is assumed that the transmitter knows only the distributions of the fading coefficients in both the eavesdropper's and legitimate user's channels. Consequently, data transmissions occur at fixed rates, with secrecy outage happening when the instantaneous secrecy capacity is less than the fixed rate. In this setting, by employing the effective bandwidth and effective capacity formulations, throughput expressions are derived, and energy efficiency metrics, namely minimum energy per bit and wideband slope, are determined. Overall, the impact of source and channel variations as well as the delay quality of service (QoS) requirements on the energy efficiency of secure communications is identified.

DOI
10.1109/wcnc.2018.8377417

Related papers

Secure Wireless Communication and Optimal Power Control Under Statistical Queueing Constraints

Deli Qiao, M. Cenk Gursoy, Senem Velipasalar

In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performance metric to identify the secure throughput of the system, i.e., effective secure throughput. It is assumed that perfect channel side information (CSI) is available at both the transmitter and the receivers. Initially, the scenario in which the transmitter sends common messages to two receivers and confidential messages to one receiver is considered. For this case, the effective secure throughput region, which is the region of constant arrival rates of common and confidential messages that can be supported by the buffer-constrained transmitter and fading broadcast channel, is defined. It is proven that this effective throughput region is convex implying that time-sharing between any two viable transmission and power control strategies results in effective throughput values inside the region. Then, the optimal power control policies that achieve the boundary points of the effective secure throughput region are investigated and an algorithm for the numerical computation of the optimal power adaptation schemes is provided. Additionally, the throughput region achieved by time-division multiplexing of common and confidential messages is explored. Subsequently, the special case in which the transmitter sends only confidential messages to one receiver is addressed in more detail. For this case, effective secure throughput is formulated and two different power adaptation policies are studied. These power adaptation policies are compared with the opportunistic ones that are optimal in the absence of quality of service (QoS) constraints. It is shown that opportunistic schemes, in which data transmission with high rates and high power occurs only when the main channel is much better than the eavesdropper channel, are no longer optimal under buffer constraints, and the transmitter should send the data at a certain moderate rate and power even when the main channel strength is comparable to that of the eavesdropper channel to avoid buffer overflows.

arXiv:1012.0011•IEEE Transactions on Information Forensics and Security•May 20, 2011•15 citations

Secrecy Outage Capacity of Fading Channels

Onur Güngör, Jian Rong Tan, C. Emre Koksal +2 more

This paper considers point-to-point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under two different assumptions on the transmitter channel state information (CSI). First, we find the outage secrecy capacity assuming that the transmitter has perfect knowledge of the legitimate and eavesdropper channel gains. In this scenario, the capacity achieving scheme relies on opportunistically exchanging private keys between the legitimate nodes. These keys are stored in a key buffer and later used to secure delay sensitive data using the Vernam's one time pad technique. We then extend our results to the more practical scenario where the transmitter is assumed to know only the legitimate channel gain. Here, our achievability arguments rely on privacy amplification techniques to generate secret key bits. In the two cases, we also characterize the optimal power control policies which, interestingly, turn out to be a judicious combination of channel inversion and the optimal ergodic strategy. Finally, we analyze the effect of key buffer overflow on the overall outage probability.

IEEE Transactions on Information Theory•Aug 1, 2013•62 citations

Secrecy outage capacity of fading channels

Onur Güngör, Jian Rong Tan, C. Emre Koksal +2 more

This paper considers point to point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under two different assumptions on the transmitter CSI (Channel state information). First, we find the outage secrecy capacity assuming that the transmitter has perfect knowledge of the legitimate and eavesdropper channel gains. In this scenario, the capacity achieving scheme relies on opportunistically exchanging private keys between the legitimate nodes. These keys are stored in a key buffer and later used to secure delay sensitive data using the Vernam's one time pad technique. We then extend our results to the more practical scenario where the transmitter is assumed to know only the legitimate channel gain. Here, our achievability arguments rely on privacy amplification techniques to generate secret key bits. In the two cases, we also characterize the optimal power control policies which, interestingly, turn out to be a judicious combination of channel inversion and the optimal ergodic strategy. Finally, we analyze the effect of key buffer overflow on the overall outage probability.

Conference on Information Sciences and Systems•Mar 1, 2012•14 citations

Secrecy Outage Capacity of Fading Channels

Onur Güngör, Jian Rong Tan, C. Emre Koksal +2 more

This paper considers point to point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under two different assumptions on the transmitter CSI (Channel state information). First, we find the outage secrecy capacity assuming that the transmitter has perfect knowledge of the legitimate and eavesdropper channel gains. In this scenario, the capacity achieving scheme relies on opportunistically exchanging private keys between the legitimate nodes. These keys are stored in a key buffer and later used to secure delay sensitive data using the Vernam's one time pad technique. We then extend our results to the more practical scenario where the transmitter is assumed to know only the legitimate channel gain. Here, our achievability arguments rely on privacy amplification techniques to generate secret key bits. In the two cases, we also characterize the optimal power control policies which, interestingly, turn out to be a judicious combination of channel inversion and the optimal ergodic strategy. Finally, we analyze the effect of key buffer overflow on the overall outage probability.

arXiv:1112.2791•Dec 13, 2011•4 citations

Secure communication over fading channels with statistical QoS constraints

Deli Qiao, M. Cenk Gursoy, Senem Velipasalar

In this paper, secure transmission of information over an ergodic fading channel is studied in the presence of statistical quality of service (QoS) constraints.We employ effective capacity to measure the secure throughput of the system, i.e., effective secure throughput. We assume that the channel side information (CSI) of the main and the eavesdropper channels is available at the transmitter side. Under this assumption, we investigate the optimal power control policies that maximize the effective secure throughput. In particular, it is noted that opportunistic transmission is no longer optimal and the transmitter should not wait to send the data at a high rate until the main channel is much better than the eavesdropper channel. Moreover, it is shown that the benefits of adapting the power with respect to the CSI of both the eavesdropper and main channels rather than the CSI of only the main channel diminish as QoS constraints become more stringent.

arXiv:1004.0891•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•4 citations

Secure communication in the low-SNR regime: A Characterization of the energy-secrecy tradeoff

M. Cenk Gursoy

Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived. Transmission strategies required to achieve these derivatives are identified. In particular, it is shown that it is optimal in the low-SNR regime to transmit in the maximum-eigenvalue eigenspace of Phi = HmdaggerHm- Nm/NeHedaggerHewhere Hmand Hedenote the channel matrices associated with the legitimate receiver and eavesdropper, respectively, and Nmand Neare the noise variances at the receiver and eavesdropper, respectively. Energy efficiency is analyzed by finding the minimum bit energy required for secure and reliable communications, and the wideband slope. Increased bit energy requirements under secrecy constraints are quantified. Finally, the impact of fading is investigated.

arXiv:0901.3130•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•28 citations
In this paper, energy-efficient and secure communication over wireless fading channels is investigated when data arrivals are modeled as Markovian processes (e.g., discrete Markov and Markov fluid processes) in the presence of limitations on buffer overflow probabilities. It is assumed that the transmitter knows only the distributions of the fading coefficients in both the eavesdropper's and legitimate user's channels. Consequently, data transmissions occur at fixed rates, with secrecy outage happening when the instantaneous secrecy capacity is less than the fixed rate. In this setting, by employing the effective bandwidth and effective capacity formulations, throughput expressions are derived, and energy efficiency metrics, namely minimum energy per bit and wideband slope, are determined. Overall, the impact of source and channel variations as well as the delay quality of service (QoS) requirements on the energy efficiency of secure communications is identified.
In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performance metric to identify the secure throughput of the system, i.e., effective secure throughput. It is assumed that perfect channel side information (CSI) is available at both the transmitter and the receivers. Initially, the scenario in which the transmitter sends common messages to two receivers and confidential messages to one receiver is considered. For this case, the effective secure throughput region, which is the region of constant arrival rates of common and confidential messages that can be supported by the buffer-constrained transmitter and fading broadcast channel, is defined. It is proven that this effective throughput region is convex implying that time-sharing between any two viable transmission and power control strategies results in effective throughput values inside the region. Then, the optimal power control policies that achieve the boundary points of the effective secure throughput region are investigated and an algorithm for the numerical computation of the optimal power adaptation schemes is provided. Additionally, the throughput region achieved by time-division multiplexing of common and confidential messages is explored. Subsequently, the special case in which the transmitter sends only confidential messages to one receiver is addressed in more detail. For this case, effective secure throughput is formulated and two different power adaptation policies are studied. These power adaptation policies are compared with the opportunistic ones that are optimal in the absence of quality of service (QoS) constraints. It is shown that opportunistic schemes, in which data transmission with high rates and high power occurs only when the main channel is much better than the eavesdropper channel, are no longer optimal under buffer constraints, and the transmitter should send the data at a certain moderate rate and power even when the main channel strength is comparable to that of the eavesdropper channel to avoid buffer overflows.
This paper considers point-to-point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under two different assumptions on the transmitter channel state information (CSI). First, we find the outage secrecy capacity assuming that the transmitter has perfect knowledge of the legitimate and eavesdropper channel gains. In this scenario, the capacity achieving scheme relies on opportunistically exchanging private keys between the legitimate nodes. These keys are stored in a key buffer and later used to secure delay sensitive data using the Vernam's one time pad technique. We then extend our results to the more practical scenario where the transmitter is assumed to know only the legitimate channel gain. Here, our achievability arguments rely on privacy amplification techniques to generate secret key bits. In the two cases, we also characterize the optimal power control policies which, interestingly, turn out to be a judicious combination of channel inversion and the optimal ergodic strategy. Finally, we analyze the effect of key buffer overflow on the overall outage probability.
This paper considers point to point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under two different assumptions on the transmitter CSI (Channel state information). First, we find the outage secrecy capacity assuming that the transmitter has perfect knowledge of the legitimate and eavesdropper channel gains. In this scenario, the capacity achieving scheme relies on opportunistically exchanging private keys between the legitimate nodes. These keys are stored in a key buffer and later used to secure delay sensitive data using the Vernam's one time pad technique. We then extend our results to the more practical scenario where the transmitter is assumed to know only the legitimate channel gain. Here, our achievability arguments rely on privacy amplification techniques to generate secret key bits. In the two cases, we also characterize the optimal power control policies which, interestingly, turn out to be a judicious combination of channel inversion and the optimal ergodic strategy. Finally, we analyze the effect of key buffer overflow on the overall outage probability.
This paper considers point to point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under two different assumptions on the transmitter CSI (Channel state information). First, we find the outage secrecy capacity assuming that the transmitter has perfect knowledge of the legitimate and eavesdropper channel gains. In this scenario, the capacity achieving scheme relies on opportunistically exchanging private keys between the legitimate nodes. These keys are stored in a key buffer and later used to secure delay sensitive data using the Vernam's one time pad technique. We then extend our results to the more practical scenario where the transmitter is assumed to know only the legitimate channel gain. Here, our achievability arguments rely on privacy amplification techniques to generate secret key bits. In the two cases, we also characterize the optimal power control policies which, interestingly, turn out to be a judicious combination of channel inversion and the optimal ergodic strategy. Finally, we analyze the effect of key buffer overflow on the overall outage probability.
In this paper, secure transmission of information over an ergodic fading channel is studied in the presence of statistical quality of service (QoS) constraints.We employ effective capacity to measure the secure throughput of the system, i.e., effective secure throughput. We assume that the channel side information (CSI) of the main and the eavesdropper channels is available at the transmitter side. Under this assumption, we investigate the optimal power control policies that maximize the effective secure throughput. In particular, it is noted that opportunistic transmission is no longer optimal and the transmitter should not wait to send the data at a high rate until the main channel is much better than the eavesdropper channel. Moreover, it is shown that the benefits of adapting the power with respect to the CSI of both the eavesdropper and main channels rather than the CSI of only the main channel diminish as QoS constraints become more stringent.
Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived. Transmission strategies required to achieve these derivatives are identified. In particular, it is shown that it is optimal in the low-SNR regime to transmit in the maximum-eigenvalue eigenspace of Phi = HmdaggerHm- Nm/NeHedaggerHewhere Hmand Hedenote the channel matrices associated with the legitimate receiver and eavesdropper, respectively, and Nmand Neare the noise variances at the receiver and eavesdropper, respectively. Energy efficiency is analyzed by finding the minimum bit energy required for secure and reliable communications, and the wideband slope. Increased bit energy requirements under secrecy constraints are quantified. Finally, the impact of fading is investigated.