Research Article
Fairness Time-Slot Allocation and Scheduling with QoS Guarantees in Multihop WiMAX Mesh Networks
| Output: | | (1) Step 1. | | (2) Choose a with the smallest satisfaction; | | (3) if == 1, then terminate scheduling | | (4) else go to Step 2 | | (5) Step 2. | | (6) | | (7) for | | (8) | | (9) for | | (10) if | | (11) ; ; | | (12) ; | | (13) else if | | (14) ; | | (15) else if | | (16) free all tiles which allocated to in Step 2 | | (17) | | (18) go to Step 1 | | (19) Step 3. | | (20) if the resource is fully allocated successfully to all hops of , then | | (21) | | (22) ; ; | | (23) for all RS on the path from to BS do | | (24) ; | | (25) ; | | (26) Step 4. | | (27) if = 1 or is empty, then | | (28) terminate scheduling | | (29) else go to Step 1 |
|