Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Concurrency and Comp...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Concurrency and Computation Practice and Experience
Article . 2016 . Peer-reviewed
License: Wiley Online Library User Agreement
Data sources: Crossref
DBLP
Article . 2017
Data sources: DBLP
versions View all 2 versions
addClaim

Increasing secret key capacity of OFDM systems: a geometric program approach

Authors: Longwang Cheng; Wei Li 0074; Li Zhou 0002; Chunsheng Zhu; Jibo Wei; Yantao Guo;

Increasing secret key capacity of OFDM systems: a geometric program approach

Abstract

SummaryExtracting secret keys from the common randomness of wireless channels has attracted prominent attention recently. Orthogonal frequency‐division multiplexing (OFDM) systems can provide extra randomness in view of the use of multiple subchannels. So far, the secret key capacity of OFDM systems is still an open issue. In this paper, the secret key capacity of OFDM systems based on the subchannel state information is analyzed, and an expression of the secret key capacity is derived under the assumption that the subchannels are independent. To increase the secret key capacity, a power allocation scheme based on geometric program is proposed. Furthermore, an underlying propagation protocol is designed to realize the power allocation scheme. Performance simulations show that the proposed scheme achieves greater secret key capacity in comparison with equal power allocation scheme, especially at low signal‐to‐noise ratio region. Besides, the secret key bits mismatch rate during the secret key generation based on the power allocated subchannels is decreased.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    3
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
3
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!