A Dynamic Resource Allocation Scheme for Guaranteed Bit Rate Services in OFDMA Networks

Koutsimanis, C.; Fodor, Gábor

doi:10.1109/icc.2008.478

Cited by 43 publications

(76 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SIMULATION RESULTS In this section, we compare the performance of the uniformly-distributed random assignment sequences in [4], with that of the cyclic sequences generated by the greedy algorithm, and the exhaustive search in [5] at different relative loads K N ; i.e., the ratio of the currently assigned RBs to the total number of RBs in the system. For the scheme in [5] and the one proposed herein, the cyclic sequences are generated by using the MCG structure.…”

Section: Computational Complexity Of the Greedy Algorithmmentioning

confidence: 99%

“…For example, for a system with N = 40 RBs at a relative load, K N = 90%, the average number of hits of the random assignment scheme in [4] and the cyclically-generated sequences obtained by exhaustive search, and the greedy Average number of hits…”

Section: Computational Complexity Of the Greedy Algorithmmentioning

confidence: 99%

“…To maintain autonomy, RB assignments can be performed randomly [4] or according to prescribed assignment sequences [5] with entries corresponding to available RBs. In either approach, no coordination with the BS or other RTs is required.…”

Section: Sequencesmentioning

confidence: 99%

“…However, the mobility of both WTs and RTs in terminal relaying networks renders this assumption rather difficult to realize in practice. In contrast, in the absence of CQIs, blind allocation schemes that use random RB assignments are available, e.g., [4]. These schemes offer a significant reduction in the overhead necessary to acquire the CQIs, but the lack of coherence in their structure results in, otherwise avoidable, RB allocation conflicts.…”

mentioning

confidence: 99%

See 3 more Smart Citations

An efficient greedy-based autonomous resource block assignment scheme for 5G cellular networks with self-organizing relaying terminals

Fouad

Gohary

Yanıkömeroğlu

2014

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

View full text Add to dashboard Cite

Abstract-In future cellular networks, self-organizing relaying terminals (RTs) are expected to play a crucial role in assisting the communication between base stations and wireless terminals (WTs), which include, not only active user terminals, but also machine-type communication devices. In the absence of channel quality indicators, the effective utilization of RTs requires a mechanism by which these RTs can assign available resource blocks (RBs) to a potentially large number of WTs with minimal conflicts. This requires optimizing RB assignments over a large set of lengthy sequences, which is computationally prohibitive for networks with large numbers of RTs. To alleviate the difficulty in designing such sequences, we develop a greedy algorithm, whereby pairs of RB assignment sequences are selected in an efficient sequential manner. The performance of the sequences generated by this algorithm is comparable to that of the sequences generated by exhaustive search, but with a significantly less computational cost.

show abstract

Section: Computational Complexity Of the Greedy Algorithmmentioning

confidence: 99%

Section: Computational Complexity Of the Greedy Algorithmmentioning

confidence: 99%

Section: Sequencesmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

An efficient greedy-based autonomous resource block assignment scheme for 5G cellular networks with self-organizing relaying terminals

Fouad

Gohary

Yanıkömeroğlu

2014

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

View full text Add to dashboard Cite

show abstract

“…For example, a hybrid of centralized and distributed algorithms for subcarrier (i.e., channel) assignment to maximize the overall throughput is proposed in [9]. This scheme has been extended to include power allocation by [10]. Paper [11] studies three adaptive schemes for subcarrier (channel) allocation by means of cross-layer techniques for the purpose of throughput enhancement.…”

Section: Introductionmentioning

confidence: 99%

An Optimization Approach to Joint Cell and Power Allocation in Multicell Networks

Fallgren

Oddsdóttir

Fodor

2011

2011 IEEE International Conference on Communications Workshops (ICC)

View full text Add to dashboard Cite

Abstract-Since the seminal paper by Knopp and Humblet that showed that the system throughput of a singlecell system is maximized if only one terminal transmits at a time, there has been a large interest in opportunistic communications and its relation to various fairness measures. On the other hand, in multicell systems there is a need to allocate transmission power such that some overall utility function is maximized typically under fairness constraints. Furthermore, in multicell systems the degree of resource allocation freedom includes the serving cell selection that allows for load balancing and thereby the efficient use of radio resources. In this paper we formulate the joint serving cell selection (link selection) and power allocation problem as an optimization task whose purpose is to maximize either the minimum user throughput or the multicell sum throughput. The max-min problem and a simplified max throughput problem are both NP-hard and we therefore propose heuristic solution approaches. We present numerical results that give new and valuable insights into the trade off between fair and sum throughput optimal joint resource allocation strategies.

show abstract

Optimal power control in OFDMA cellular networks

et al. 2011

View full text Add to dashboard Cite

This article addresses the problem of allocating users to radio resources in the downlink of an OFDMA cellular system. We consider a classical multicellular environment with a realistic interference model and a margin adaptive approach, i.e., we aim at minimizing total transmission power while maintaining a certain given rate for each user. We discuss computational complexity issues of the resulting model and present a heuristic approach that finds optima under suitable conditions or reasonably good solutions in the general case. Computational experiments show the effectiveness of the proposed heuristic in a comparison with both a commercial state-of-the-art optimization solver and other approaches from the literature.

show abstract

A Dynamic Resource Allocation Scheme for Guaranteed Bit Rate Services in OFDMA Networks

Cited by 43 publications

References 3 publications

An efficient greedy-based autonomous resource block assignment scheme for 5G cellular networks with self-organizing relaying terminals

An efficient greedy-based autonomous resource block assignment scheme for 5G cellular networks with self-organizing relaying terminals

An Optimization Approach to Joint Cell and Power Allocation in Multicell Networks

Optimal power control in OFDMA cellular networks

Contact Info

Product

Resources

About