In addition, it provides any resolution of user bandwidth allocation for the uplink multiple access with comparable computational complexity, because the DFT is avoided.
Several key intuitions behind BHS can be summarized as below: Drawing support from BI model to guide the bandwidth allocation for the traffic demands in the most advantageous order.
Centralized coordination functions in wireless LANs offer several advantages over distributed approaches, having the benefit of a system overview at the controller, but obtaining a stable configuration of bandwidth allocation for the system is nontrivial.
Then, the bandwidth allocation for the centre users in cluster i is given by, W_{c}^{(i)} = leftlceil left(frac{M_{c}^{(i)}}{M^{(i)}} right) W rightrceil (46).
In the downlink subframe, the downlink MAP (DL-MAP) and Uplink MAP (UL-MAP) messages are transmitted by the base station, which comprise the bandwidth allocations for data transmission in both downlink and uplink directions, respectively.
The information about bandwidth allocations for DL and UL transmissions is broadcast to the MSs through DL-MAP and UL-MAP messages at the beginning of each frame.
We now describe an efficient computational framework to compute the bandwidth allocations for each subframe under utility maximization, queue-driven Log, and queue-driven MaxWeight scheduling policies.
Comparatively, THS only needs to compute the capable minimum network subset based on the sum of traffics without doing any bandwidth allocations for each particular flow, thus THS scales at roughly O(N) where N is the number of servers.
