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