On the exploitation of CDF based wireless scheduling

Udi Ben-Porat*, Anat Bremler-Barr, Hanoch Levy

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Channel-Aware scheduling strategies - such as the CDF scheduler (CS) algorithm - provide an effective mechanism for utilizing the channel data rate for improving throughput performance in wireless data networks by exploiting channel fluctuations. A highly desired property of such a scheduling strategy is that its algorithm is stable, in the sense that no user has incentive "cheating" the algorithm in order to increase his/hers channel share (on the account of others). Considering a single user we show that no such user can increase his/hers channel share by misreporting the channel capacity. In contrast, considering a group of users, we present a scheme by which coordination allows them to gain permanent increase in both their time slots share and in their throughput at the expense of others, by misreporting their rates. We show that for large populations consisting of regular and coordinated users in equal numbers, the ratio of allocated time slots between a coordinated and a regular user converges to e - 1 ≈ 1.7. Our scheme targets the very fundamental principle of CS (as opposed to just attacking implementation aspects), which bases its scheduling decisions on the Cumulative Distribution Function (CDF) of the channel rates reported by users. Our scheme works both for the continuous channel spectrum and the discrete channel spectrum versions of the problem. Finally, we outline a modified CDF scheduler immune to such attacks.

Original languageEnglish
Pages (from-to)2193-2205
Number of pages13
JournalComputer Networks
Issue number10
StatePublished - 5 Jul 2013


  • Attack
  • CDF
  • DDoS
  • Fairness
  • Scheduling
  • Wireless


Dive into the research topics of 'On the exploitation of CDF based wireless scheduling'. Together they form a unique fingerprint.

Cite this