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

Authors:
Matteo Cesana;Nicola Gatti;Ilaria Malanchini
Affiliations:
DEI, Politecnico di Milano, Milano, Italy;DEI, Politecnico di Milano, Milano, Italy;DEI, Politecnico di Milano, Milano, Italy
Venue:
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Year:
2008

Citing 9
Cited 2

Network selection and discovery of service information in public WLAN hotspots

Proceedings of the 2nd ACM international workshop on Wireless mobile applications and services on WLAN hotspots
The Price of Stability for Network Design with Fair Cost Allocation

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The Price of Routing Unsplittable Flow

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Autonomic control and personalization of a wireless access network

Computer Networks: The International Journal of Computer and Telecommunications Networking
Packet-switched network selection with the highest QoS in 4G networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Always best connected

IEEE Wireless Communications
Network selection in an integrated wireless LAN and UMTS environment using mathematical modeling and computing techniques

IEEE Wireless Communications
Seamless internetworking of WLANs and cellular networks: architecture and performance issues in a Mobile IPv6 scenario

IEEE Wireless Communications

Cooperative user-network interactions in next generation communication networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A game theoretical study of access point association in wireless mesh networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.