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) Step 2. | | (3) | | (4) for | | (5) | | (6) for | | (7) if | | (8) ; ; | | (9) ; | | (10) else | | (11) if | | (12) free all tiles which allocated to | | (13) | | (14) go to Step 1 | | (15) else | | (16) ; ; ; | | (17) Step 3. if all hops of are allocated successfully | | (18) | | (19) ; ; | | (20) for all RS on the path from to BS do | | (21) ; ; | | (22) endfor | | (23) ; | | (24) Step 4. if all SSs meet requirement or no sufficient resources can be allocated | | (25) terminate scheduling | | (26) else go to Step 1 |
|