On the Impact of Selfish Behaviors in Wireless Packet Scheduling
In many practical scenarios, wireless devices are autonomous and thus, may exhibit non-cooperative behaviors due to self-interests. For instance, a wireless user may report bogus channel information to gain resource allocation advantages. Such non-cooperative behaviors are practicable as the device's software could be modified by the user. In this paper, we first analyze the impact of these rationally selfish behaviors on the performance of packet scheduling algorithms in time-slotted wireless networks. Using a mixed strategy game theoretic model, we show that the traditional Maximum Rate packet scheduling algorithm can lead non-cooperative users to undesirable Nash equilibriums, in which the wireless channels are used inefficiently. By using repeated game to enforce cooperation, we further propose a novel game theoretic approach that can lead to an efficient equilibrium.