Game theoretic analysis of wireless access network selection: models, inefficiency bounds, and algorithms

This paper addresses the problem of network selection, which arises when wireless mobile users can choose among multiple available wireless access networks to connect to. In particular, we are interested in studying the dynamics of the competition among different selfish mobile users which operate the network selection with the goal of minimizing their own selection cost. To this extent, we formalize the problem as a non-cooperative game, and we study the quality of the corresponding Nash equilibria under three expressions for the users' selection cost by deriving tight analytical bounds on the price-of-anarchy and the price-of-stability for the games. Finally, we introduce a mathematical programming formulation for the games which allows one to compute the equilibria in realistic wireless access network topologies.

[1]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[2]  Yossi Azar,et al.  The Price of Routing Unsplittable Flow , 2005, STOC '05.

[3]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[4]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .

[5]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[6]  Antonio Capone,et al.  Modelling network selection and resource allocation in wireless access networks with non-cooperative games , 2008, 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[7]  Michael E. Theologou,et al.  Packet-switched network selection with the highest QoS in 4G networks , 2008, Comput. Networks.

[8]  Gabriel-Miro Muntean,et al.  Utility-based Intelligent Network Selection in Beyond 3G Systems , 2006, 2006 IEEE International Conference on Communications.

[9]  Massimo Bernaschi,et al.  Seamless internetworking of WLANs and cellular networks: architecture and performance issues in a Mobile IPv6 scenario , 2005, IEEE Wireless Communications.

[10]  Tim Roughgarden,et al.  The Price of Stability for Network Design with Fair Cost Allocation , 2004, FOCS.

[11]  ABBAS JAMALIPOUR,et al.  Network selection in an integrated wireless LAN and UMTS environment using mathematical modeling and computing techniques , 2005, IEEE Wireless Communications.

[12]  R. Rosenthal A class of games possessing pure-strategy Nash equilibria , 1973 .

[13]  Yui-Wah Lee Network selection and discovery of service information in public WLAN hotspots , 2004, WMASH '04.

[14]  E. Gustafsson,et al.  Always best connected , 2003, IEEE Wirel. Commun..

[15]  Nicola Blefari-Melazzi,et al.  Autonomic control and personalization of a wireless access network , 2007, Comput. Networks.