Low-rate TCP-targeted denial of service attacks: the shrew vs. the mice and elephants
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
The cdma2000 System for Mobile Communications: 3G Wireless Evolution
The cdma2000 System for Mobile Communications: 3G Wireless Evolution
Exploiting the Transients of Adaptation for RoQ Attacks on Internet Resources
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
User-level performance of channel-aware scheduling algorithms in wireless data networks
IEEE/ACM Transactions on Networking (TON)
HSDPA/HSUPA for UMTS: High Speed Radio Access for Mobile Communications
HSDPA/HSUPA for UMTS: High Speed Radio Access for Mobile Communications
Backtracking Algorithmic Complexity Attacks against a NIDS
ACSAC '06 Proceedings of the 22nd Annual Computer Security Applications Conference
A measurement study of scheduler-based attacks in 3G wireless networks
PAM'07 Proceedings of the 8th international conference on Passive and active network measurement
WDA: A Web farm Distributed Denial Of Service attack attenuator
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.