Selfish misbehavior in scheduling algorithms of wireless networks

We consider the problem of selfish misbehavior in scheduling algorithms of wireless networks. All wireless scheduling algorithms are designed under the assumption that network users will follow the algorithm specifications. In this paper, we study two scheduling algorithms in which a selfish user might misbehave in order to achieve better performance. In the first case, we consider a network that implements cross-layered rate control mechanism to determine arrival rate of users as well as link schedules. We explain a scenario in which a selfish user obtains extra throughput by misleading the scheduling component of the network. We find an equivalent optimization framework that captures misbehavior pattern of the selfish user. We present a solution to prevent such a greedy behavior by imposing a cost term on the utility function of the users. In the second part of the work, we consider the family of random access scheduling algorithms in which users of the wireless network wait for randomly chosen back-off intervals before accessing the medium. A selfish user might wait for smaller back-off in order to obtain an unfair advantage. We present a comparison method to detect such a greedy misbehavior.