On the application of network coding with diversity to opportunistic scheduling | Zendy

Zhiguo Ding | Zendy; Kin K. Leung | Zendy; Mugen Peng | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the application of network coding with diversity to opportunistic scheduling

Author(s) -

Zhiguo Ding,

Kin K. Leung,

Mugen Peng

Publication year - 2009

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1049/cp.2009.2008

Subject(s) - linear network coding , computer science , maximum throughput scheduling , computer network , scheduling (production processes) , coding (social sciences) , telecommunications link , wireless network , fairness measure , wireless , distributed computing , round robin scheduling , throughput , fair share scheduling , telecommunications , quality of service , engineering , statistics , mathematics , network packet , operations management

In this correspondence, we study the application of network coding to opportunistic scheduling for wireless uplink channels. An important observation is that existing scheduling protocols occasionally have to allow the users which do not have the largest channel gain to be scheduled, which can maintain the fairness but reduce the throughput. The key idea proposed in this paper is to always schedule the user with best channel gain for transmission, and meantime the use of network coding encourages the scheduled users to help the ones which have not been served previously. Analytical and numerical results have been developed to show that the proposed network coding schedulers can achieve better tradeoff of fairness and system throughput than comparable schemes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research