2010
DOI: 10.1002/ett.1434
|View full text |Cite
|
Sign up to set email alerts
|

Optimal soft frequency reuse and dynamic sub‐carrier assignments in cellular OFDMA networks

Abstract: SUMMARYSoft frequency reuse (SFR) is a common technique for co-channel interference (CCI) mitigation in cellular OFDMA networks. The performance of such networks significantly depends on the configuration of the power profiles that implement the soft frequency reuse patterns. In this paper, we investigate the performance of static soft frequency reuse by comparing it against the optimal case, in which a central entity optimally distributes power among the users of the network. It is shown that there is a signi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…In general, we observe that the MMTF scheduler leads to higher minimum user throughput than IS-PTF. This is not surprising since MMTF is guaranteed to maximize minimum temporal share according to (10). Also, when increases, the minimum user throughput and temporal share decrease for both schedulers because increasing leads to less chance for the users to be scheduled.…”
Section: Performance Of the Proposed Scheduler In Nonhomogeneously Pomentioning
confidence: 92%
See 4 more Smart Citations
“…In general, we observe that the MMTF scheduler leads to higher minimum user throughput than IS-PTF. This is not surprising since MMTF is guaranteed to maximize minimum temporal share according to (10). Also, when increases, the minimum user throughput and temporal share decrease for both schedulers because increasing leads to less chance for the users to be scheduled.…”
Section: Performance Of the Proposed Scheduler In Nonhomogeneously Pomentioning
confidence: 92%
“…Let { * } =1 and * denote the solution of MMTF problem (10). Because the patterns are mutually exclusive, each section of the network is covered by one pattern.…”
Section: Theorem 4 If the Patterns Are Mutually Exclusive The Solutmentioning
confidence: 99%
See 3 more Smart Citations