Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ IET Communicationsarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
IET Communications
Article . 2022 . Peer-reviewed
License: CC BY
Data sources: Crossref
DBLP
Article . 2022
Data sources: DBLP
versions View all 2 versions
addClaim

Effective capacity optimization for UDN

Authors: Shaoguo Xie; Liefu Ai; Wenquan Xu;

Effective capacity optimization for UDN

Abstract

Abstract For the ultra‐dense distributed network (UDN), the intensive deployment leads to the collision problem of the unlicensed spectrum access due to the random contention access mechanism of the unlicensed spectrum, which is difficult to improve the user quality of service (QoS). Here, the wireless access process of the licensed assisted access (LAA) network is modelled as a four‐state semi‐Markov model. Then, the effective capacity (EC) of the UDN based on the random access is derived, and the network capacity limit under the QoS requirements in the unlicensed spectrum is given. Based on the obtained EC, two power control algorithms are proposed to maximize the EC and effective energy efficiency (EEE) respectively under the user QoS requirements. Finally, numerical results verify the accuracy of the proposed theory, and the capacity‐delay domain of the UDN is given. The simulation results show that the proposed algorithms improve the EC and the EEE compared with existing classical schemes.

  • 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).
    0
    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!
0
Average
Average
Average
gold