Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: proportional resource allocation

Sortuj według:

Ogranicz wyniki do:

Low Complexity Greedy Power Allocation Algorithm for Proportional Resource Allocation in Multi-User OFDM Systems

Odhah N. A., Dessouky M. I., Al-Hanafy W. E., Abd El-Samie F. E.

Journal of Telecommunications and Information Technology

2012

nr 4

38-45

Multi-User Orthogonal Frequency Division Multiplexing (MU-OFDM) is an efficient technique for achieving high downlink capacity in high-speed communication systems. A key issue in MU-OFDM is the allocation of the OFDM subcarriers and power to users sharing the channel. In this paper a proportional rate-adaptive resource allocation algorithm for MU-OFDM is presented. Subcarrier and power allocation are carried out sequentially to reduce the complexity. The low complexity proportional subcarriers allocation is followed by Greedy Power Allocation (GPA) to solve the rate-adaptive resource allocation problem with proportional rate constraints for MU-OFDM systems. It improves the work of Wong et al. in this area by introducing an optimal GPA that achieves approximate rate proportionality, while maximizing the total sum-rate capacity of MU-OFDM. It is shown through simulation that the proposed GPA algorithm performs better than the algorithm of Wong et al., by achieving higher total capacities with the same computational complexity, especially, at larger number of users and roughly satisfying user rate proportionality.

Proportional allocation of discrete resources using divisor methods of apportionment

Józefowska J., Józefowski Ł., Kubiak W.

Foundations of Computing and Decision Sciences

2007

Vol. 32, No. 3

227-237

In this paper we propose application of the divisor method of apportioning seats in a parliament to proportionally allocate any kind of discrete resources among competing clients. Motivation for this research comes from the observed similarities between the stride scheduling algorithm, used for scheduling threads in operating systems and the Jefferson method of apportioning seats in a parliament. Based on the theory of apportionment we present also the properties of the proposed method and illustrate it with an example. Analysing the class of divisor methods we focus on the parametric sub-class because it has interesting practical properties and it contains for example the Jefferson method which is the core of some resource allocation algorithms.