Research Article
Fairness Time-Slot Allocation and Scheduling with QoS Guarantees in Multihop WiMAX Mesh Networks
Output: | (1) Step 1. Choose a from set with the minimal total tile requirement | (2) Recover all allocated tiles of to set , | (3) Step 2. | (4) | (5) for | (6) | (7) for | (8) if , then | (9) if | (10) | (11) else | (12) ; | (13) ; ; | (14) else if | (15) free all tiles which allocated to during this step | (16) | (17) go to Step 1 | (18) Step 3. | (19) if the resource is fully allocated successfully to all hops of , then | (20) | (21) ; ; | (22) for all RS on the path from to BS do | (23) ; ; | (24) endfor | (25) ; | (26) Step 4. if all SSs meet QoS or no sufficient resources can be allocated, then | (27) Termination | (28) else go to Step 1 |
|