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/ Transactions on Emer...arrow_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/
Transactions on Emerging Telecommunications Technologies
Article . 2023 . Peer-reviewed
License: CC BY
Data sources: Crossref
DBLP
Article . 2023
Data sources: DBLP
versions View all 2 versions
addClaim

Optimal and sub‐optimal rate and power allocation for random networks

Authors: Sapir Nativ Zucker; Itsik Bergel;

Optimal and sub‐optimal rate and power allocation for random networks

Abstract

AbstractWe consider the power and rate allocation for a transmission in a wireless network where the transmitter knows the channel state of the desired receiver but only knows the statistics of the interferes. While this scenario is often encountered in practice, and extremely important in dense networks, its optimal solution was not yet known. The analysis considers nodes that are distributed according to a homogeneous Poisson point process, and hence applies both to cellular and to ad‐hoc networks. We derive (for the first time) the optimal power allocation at a node, based only on the channel gain to its desired receiver. We also derive the optimal rate allocation in networks that are characterized by the outage rate model. Considering sub‐optimal allocations, we advocate the use of the simple threshold scheduling scheme for power allocation and linear rate adaptation for rate allocation. We prove that these suboptimal schemes are close to optimal, for any channel fading. We also present simulation results over Rayleigh fading channels that show a maximum loss of 1.5% between the advocated schemes and the optimal schemes.

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).
    1
    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!
1
Average
Average
Average
hybrid