1 paper · 1 filter
Mehmet Karaca, Tansu Alpcan, Ozgur Ercetin
It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic channel and network conditions. However, these algorithms achieve a hypothetical rate…