Optimization between throughput and fairness in WiMAX network

Yasir, Muhammad; Kiani, Aysha Karim

doi:10.1109/wocn.2011.5872932

Cited by 3 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…During the process of dynamic subchannel allocation, improved maximum carrier-to-interference and noise (max C/I) algorithm is adopted to ensure each user can be assigned at least one subchannel. As is shown in [16,17], the max C/I algorithm, as a classic multiuser wireless resource algorithm, provides near optimal system throughput. Given that each subchannel of a cell is assigned equal power, all users' SINR on certain subchannel can be calculated according to the channel quality indicator.…”

Section: Improved Maximum Carrier-to-interference Algorithmmentioning

confidence: 96%

See 1 more Smart Citation

A multi‐cell adaptive resource allocation scheme based on potential game for ICIC in LTE‐A

Ling

et al. 2013

Int J Communication

View full text Add to dashboard Cite

SUMMARY Intercell interference coordination in Third Generation Partnership Project long‐term evolution‐advanced system has received much attention both from the academia and the standardization communities. Moreover, the network architecture of long‐term evolution‐advanced system is modified to take into account coordinated transmission. In this article, we study the dynamic resource allocation problem and potential game theory and propose a multicell adaptive distributed resource allocation algorithm based on potential game. The allocation process is divided into two steps; subchannel is allocated first, and then, transmitted power is optimized dynamically according to a novel pricing factor. Besides, existence and uniqueness of Nash equilibrium of the proposed game model are assured. As a result, intercell interference is well coordinated. Simulation results show that transmitted power is saved efficiently and system fairness is improved to a large extent, accompanied with good performance gain of total and cell‐edge throughputs. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Section: Improved Maximum Carrier-to-interference Algorithmmentioning

confidence: 96%

“…According to the solution of pricing factor l k , p i,k,m in Eq. (16), which is restricted in the interval p min k ; p max k Â Ã , is the optimal solution of Eq. (13).…”

Section: Existence and Uniqueness Of Nash Equilibrium For Resource Almentioning

confidence: 99%

A multi‐cell adaptive resource allocation scheme based on potential game for ICIC in LTE‐A

Ling

et al. 2013

Int J Communication

View full text Add to dashboard Cite

show abstract

“…There are several strategies for resource sharing. Such a strategy is maximizing the efficiency of the radio resource by scheduling the user with the instantaneously best radio link conditions such as max-C/I (or maximum rate) scheduling [44]. Max-C/I is optimal in obtaining the maximum network throughput [45].…”

Section: Multiuser Scheduling Algorithmsmentioning

confidence: 99%

“…Max-C/I is optimal in obtaining the maximum network throughput [45]. However, a major drawback is unfairness because the user with bad channel conditions may never be scheduled [44]. Another scheduling strategy is round-robin scheduling.…”

Section: Multiuser Scheduling Algorithmsmentioning

confidence: 99%

Algorithms for Opportunistic Load Balancing Cognitive Engine

Mäkeläinen¹,

Khan²,

Hänninen³

et al. 2014

Proceedings of the 9th International Conference on Cognitive Radio Oriented Wireless Networks

View full text Add to dashboard Cite

Due to the increasing use of more and more powerful smart devices demands on the scarce radio spectrum are becoming more intense. One way to cope with increasing demands on radio spectrum is to apply innovative and flexible authorization schemes like spectrum sharing. Under the spectrum sharing paradigm, multiple users and/or systems are authorized to utilize the same spectrum band in a defined sharing agreement. A technology that is generally recommended for the implementation of spectrum sharing is called cognitive radio (CR).In this thesis, we design and implement a cognitive engine (CE) that intelligently and dynamically allocates spectrum resources to users. We first consider a scenario where a network has an exclusive access to a spectrum band and the CE accepts or rejects the arrival user requests based on an algorithm that takes into account a user's priority and its bandwidth demand. We then consider a spectrum sharing scenario where along with the exclusive utilization to its own spectrum band a network also can opportunistically utilize another network's spectrum band. For this scenario, we design and implement a CE that performs two main tasks: 1) Accepts or rejects arrival user requests based on a priority based algorithm; and 2) it intelligently load balances the user traffic between the two available network resources, while taking into account the primary user activity in the shared spectrum band. We provide a load balancing algorithm and evaluate its performance under different primary and secondary user traffic scenarios. We show that the proposed load balancing algorithm increases average throughput of the network and it also reduces the average number of users rejected by the network. Keywords: cognitive radio, simulator, medium access, radio resource management Mäkeläinen M. (2013) Opportunistiset kuormituksentasausalgoritmit kognitiivisessa koneessa. Oulun yliopisto, tietotekniikan osasto. Diplomityö, 64 s. TIIVISTELMÄYhä tehokkaampien älykkäiden langattomien päätelaitteiden nopea lisääntymi-nen johtaa niukan radiospektrin yhä kiihtyvään käyttöön. Eräs menetelmä radiospektrin lisääntyvän kysynnän tyydyttämiseen on hyödyntää innovatiivista ja joustavaa resurssin käytönjakoa kuten spektrin jakamista. Spektrinjakamismalli mahdollistaa useiden käyttäjien ja/tai järjestelmien yhtäaikaisen käytön samalla taajuuskaistalla hyödyntämällä sovittua käytäntöä resurssien jakamisesta. Radiospektrin jakaminen on tänä päivänä yleisesti suositeltu toteuttamaan hyödyn-tämällä kognitiivista radioteknologiaa.Tässä työssä suunnittellaan ja toteutetaan kognitiivinen päätöksentekokone, joka jakaa radiospektriresursseja käyttäjille älykkäästi ja dynaamisesti. Kognitiivista päätöksentekokonetta radioresurssien jakamisessa hyödynnetään kahdessa skenaariossa. Ensimmäisessä skenaariossa radioverkolla on yksinomainen pää-sy taajuuskaistalle, jonka käyttöä kognitiivinen päätöksentekokone säätelee joko hyväksymällä tai hylkäämällä verkkoon liittyviä käyttäjiä. Kognitiivinen päätök-sentekokoneen päätökset perustuu...

show abstract