Trustworthy Operations in Cellular Networks: The case of PF Scheduler

Konstantinos Pelechrinis, Prashant Krishanmurthy, and Christos Gkantsidis

Abstract

Cellular data networks are proliferating to address the need for ubiquitous connectivity. To cope with the increasing number of subscribers and with the spatio-temporal variations of the wireless signals, current cellular networks use opportunistic schedulers, such as the Proportional Fairness scheduler (PF), to maximize network throughput while maintaining fairness among users. Such scheduling decisions are based on channel quality metrics and Automatic Repeat reQuest (ARQ) feedback reports provided by the User’s Equipment (UE). Implicit in current networks is the a priori trust on every UE's feedback. Malicious UEs can thus exploit this trust to disrupt service by intelligently faking their reports. This work proposes a trustworthy version of the PF scheduler (called TPF) to mitigate the effects of such Denial-of-Service (DoS) attacks. In brief, based on the channel quality reported by the UE, we assign a probability to possible ARQ feedbacks. We then use the probability associated with the actual ARQ report to assess the UE's reporting trustworthiness. We adapt the scheduling mechanism to give higher priority to more trusted users. Our evaluations show that TPF (i) does not induce any performance degradation under benign settings, and (ii) it completely mitigates the effects of the activity of malicious UEs.

Details

Publication typeArticle
Published inIEEE Transactions on Parallel and Distributed Systems
URLhttp://dx.doi.org/10.1109/TPDS.2013.144
VolumePP
Number99
PublisherIEEE
> Publications > Trustworthy Operations in Cellular Networks: The case of PF Scheduler