Mobile Applications: A Bayesian Game Approach to Optimize Transmission Strategies

Abstract

Normally, the full use of the network can not be done when we opened a single connection, this can be noticed especially when the quality of the network is not good. The paper aims to maximize the transmission capacity of the mobile applications while guaranteeing the stability of the hole system in presence of an incomplete informations. We formulate a Bayesian game to the network resource allocation problem under the selfish behaviour of mobile applications with multiple connections to a several available network interfaces simultaneously. The maximum data transfer rate for a network interface is private information and is considered as the type of the player(mobile application). The mobile application choses the number of concurrent connections to maximize its own profit. Based on the number of concurrent connections, the mobile applications decide the strategies to maximize their payoffs defined as the difference between the transmission capacity and the connection maintenance cost. After showing the existence and uniqueness of equilibrium in terms of number of concurrent connections, we analyze the impact of interactions between applications on the data transfer rate. We also validated our theoretical study with numerical results, which show that the non-cooperative game has an Bayesian Nash equilibrium (BNE) point which depends on all parameters of the system.