Research Article
A Gain-Computation Enhancements Resource Allocation for Heterogeneous Service Flows in IEEE 802.16 m Mobile Networks
Algorithm 2
An adaptive resource allocation scheme.
BEGIN | (i) Initialization | Equal power is allocated to groups | ; ; | ; ; . | (ii) Users Ordering | for to do | Sort in decreasing order. | Order user according to its best channel gain . | end for | (iii) Subchannels Allocation | for to where do | find the subchannel n where the user k has its best | channel gain. | Step (1): | if then | . | Sub-step : | if then | {% the subchannel n is not allocated} | {% allocate the subchannel n} | ; Updated data rate | end if | Sub-step : | if then | { % the subchannel n is allocated} | repeat | {% search the next free subchannel} | until or k* is the user | less priority than the actual one and | Jump to Sub-step | end if | end if | Step (2): | if then | {% two or more users have the same order}. | Sub-step (2.a): | if then | {% users with the same order do not require the | same subchannel} | jump to Sub-step or Sub-step | end if | Sub-step : | if then | {% these users require the same subchannel | if then | determine the user that has the minimum | second best sub-channe % this user has a low | chance to get a good subchannel}. | Jump to Sub-step | end if | if then | determine the user that has the minimum | second best subchannel; Jump to Sub-step (1.b) | end if | end if | end if | end for | END |
|