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 https://doi.org/10.1...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
https://doi.org/10.1109/globec...
Article . 2019 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Dynamic Cache Placement, Node Association, and Power Allocation in Fog Aided Networks

Authors: Ruoguang Li; Li Wang; Yanmin Gong; Mei Song; Miao Pan; Zhu Han;

Dynamic Cache Placement, Node Association, and Power Allocation in Fog Aided Networks

Abstract

In this paper, we investigate the issue of resource allocation for secure energy efficient communication in a multiuser orthogonal frequency division multiplexing (OFDM) based full-duplex (FD) relaying network in the presence of a passive eavesdropper whose channel state information (CSI) is not perfectly known. Our goal is to maximize the overall secure energy efficiency (SEE), which presents the relationship between energy consumption and secrecy performance. In the context of multiuser communications, such a resource allocation strategy jointly combines subcarrier permutation, subcarrier pair allocation, as well as power allocation altogether. The considered optimization problem is formulated as a mixed integer nonconvex programming problem, which is generally NP hard. Analyzing the property of such a problem, we first use the Dinkelbach's method to eliminate the fractional form and then exploit Generalized Benders decomposition to decouple the original problem into a master problem for pure integer programming and a primal problem for nonlinear programming. More specific, given the nonconvexity of the primal problem, we accordingly transform it into an equivalent relaxed convex problem by applying dual decomposition, alternative convex search, and difference of convex function programming. The numerical results are provided to validate the theoretical analysis and to demonstrate the effectiveness of the proposed algorithm.

  • 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).
    5
    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.
    Top 10%
    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!
5
Top 10%
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!