We study opportunistic feedback of channel state and scheduling of users transmissions at a wireless access point. Our focus is on a regime where users have unknown possibly slowly-varying channel characteristics and it is desirable to limit the resources expended to exchanging channel state opportunistic. The paper argues that opportunistically schedul-ing the user whose current rate is in the highest quantile with respect to an empirical distribution has substantial advantages. Indeed by comparing to other measurement-based opportunistic scheduling schemes it systematically achieves high ‘opportunism ’ and thus throughput in fair and robust manner. Further the throughput penalty resulting from esti-mating users distributions is limited as...
The field of wireless communications has experienced huge growth in the last decades. Various new us...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
textThis dissertation studies and proposes new methods to perform opportunistic scheduling in diffe...
textThis dissertation studies and proposes new methods to perform opportunistic scheduling in diffe...
Opportunistic scheduling can significantly improve wireless network performance by exploiting the un...
Opportunistic scheduling can significantly improve wireless network performance by exploiting the un...
This doctoral thesis is a collection of six papers preceeded by an introduction. All the papers are ...
A novel approach for implementation of opportunistic scheduling without explicit feedback channels i...
A novel approach for implementation of opportunistic scheduling without explicit feedback channels i...
It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic chann...
Wireless scheduling algorithm can extract multiuser diversity (MUDiv) via prioritizing the users wit...
Wireless scheduling algorithm can extract multiuser diversity (MUDiv) via prioritizing the users wit...
Wireless scheduling algorithm can extract multiuser diversity (MUDiv) via prioritizing the users wit...
Wireless scheduling algorithm can extract multiuser diversity (MUDiv) via prioritizing the users wit...
The field of wireless communications has experienced huge growth in the last decades. Various new us...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
textThis dissertation studies and proposes new methods to perform opportunistic scheduling in diffe...
textThis dissertation studies and proposes new methods to perform opportunistic scheduling in diffe...
Opportunistic scheduling can significantly improve wireless network performance by exploiting the un...
Opportunistic scheduling can significantly improve wireless network performance by exploiting the un...
This doctoral thesis is a collection of six papers preceeded by an introduction. All the papers are ...
A novel approach for implementation of opportunistic scheduling without explicit feedback channels i...
A novel approach for implementation of opportunistic scheduling without explicit feedback channels i...
It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic chann...
Wireless scheduling algorithm can extract multiuser diversity (MUDiv) via prioritizing the users wit...
Wireless scheduling algorithm can extract multiuser diversity (MUDiv) via prioritizing the users wit...
Wireless scheduling algorithm can extract multiuser diversity (MUDiv) via prioritizing the users wit...
Wireless scheduling algorithm can extract multiuser diversity (MUDiv) via prioritizing the users wit...
The field of wireless communications has experienced huge growth in the last decades. Various new us...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
We address the problem of developing a well-performing and implementable scheduler of users with wir...