Again, at the cost of a higher feeder link bandwidth demand for those cases with more feeds or radiating elements than number of beams, more sophisticated and power consuming techniques can be implemented.
The proposed cross-layer algorithm has to comprehend the application layer information, i.e., users' bandwidth demands for the provision of weighted fairness.
As the number of elements that participate in the sensing operation increases, so does the bandwidth demanded for the reporting channel, quickly becoming the limiting factor in this scenario.
We compare FPRRA with four other efficient schemes, from [10 12] and from an "ideal" framework, in which the NCC would "magically" know, without any information exchange exactly what the video terminals' bandwidth demands for the next video frame would be.
The capillary diffusion of smartphones and tablets and the integration of connectivity capabilities in common life objects (such as TVs, domestic appliances, and vehicles) are generating a very fast growth of bandwidth demand for mobile applications[1].
In case that uplink and downlink flows are with different bandwidth demands for various applications, the resources should be allocated based on their bandwidth requirements to provide weighted fairness.
In this paper, these algorithms are modified for satisfying the bandwidth demand and for the purpose of minimizing a hop count of the tree in order to expand the residual capacity of the network.
The bandwidth demands for each request is defined in run time.
Furthermore, if uplink and downlink flows are with different bandwidth demands for various applications, our algorithm can adaptively tune the contention window size to provide weighted fairness based on their resource requirements.
In case that uplink and downlink transmissions are with different bandwidth demands for various applications, our algorithm can efficiently find the optimal minimum contention window size which provides weighted fairness based on their resource requirements.
