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
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Review: A review of DoS attack models for 3G cellular networks from a system-design perspective
Computer Communications
Beyond proportional fair: designing robust wireless schedulers
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Selfish manipulation of cooperative cellular communications via channel fabrication
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
On the exploitation of CDF based wireless scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Though high-speed (3G) wide-area wireless networks have been rapidly proliferating, little is known about the robustness and security properties of these networks. In this paper, we make initial steps towards understanding these properties by studying Proportional Fair (PF), the scheduling algorithm used on the downlinks of these networks. We find that the fairness-ensuring mechanism of PF can be easily corrupted by a malicious user to monopolize the wireless channel thereby starving other users. Using extensive experiments on commercial and laboratory-based CDMA networks, we demonstrate this vulnerability and quantify the resulting performance impact. We find that delay jitter can be increased by up to 1 second and TCP throughput can be reduced by as much as 25-30% by a single malicious user. Based on our results, we argue for the need to use a more robust scheduling algorithm and outline one such algorithm.