Access point Selection in 802.11 Wireless Networks Guaranteeing Minimum QoS
Main Article Content
Keywords
Noncooperative games, wireless networks, 802.11, quality of service, satisfaction equilibrium, green communications.
Abstract
In this paper we present the research results that conducted to address the problem of associating a user to a wireless access point (AP) in a multicell 802.11 network in which service a large number of users, each user selfishly is connected to the access point that allows it to guarantee a minimum data transfer rate, determined arbitrarily by the user required service. To do this, the interactions are modeled on the wireless network as a non-cooperative game, then the satisfaction equilibrium concept (SE) is introduced and the algorithm to solve the problem of association under this concept is proposed; finally we illustrate the simulation results obtained in a network scenario where, for simplicity and without loss of generality two users and two access points are assumed.
MSC:91A80
PACS:89.20.Ff
Downloads
References
[2] A. Fabrikant, A. Luthra, E. Maneva, C. Papadimitriou, and S. Shenker. On a Network Creation Game. In ACM PODC, Boston, MA, Jul 2003.
[3] M. Mavronikolas and P. Spirakis. The Price of Selfish Routing. In Symposium on the Theory of Computing, Heraklion, Greece, Jul 2001.
[4] L. Qiu, Y. Yang, Y. Zhang, and S. Shenker. On Selfish Routing in Internet-Like Environments. In ACM Sigcomm, Karlsruhe, Germany, Aug 2003.
[5] T. Roughgarden and E. Tardos. How Bad is Selfish Routing? In FOCS, Redondo Beach, CA, Nov 2000.
[6] A. Akella, S. Seshan, R. Karp, S. Shenker, and C. Papadimitriou. Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP. In ACM Sigcomm, Pittsburgh, PA, Aug 2002.
[7] L. Anderegg and S. Eidenbenz. Ad-hoc VCG: a Truthful and Cost-Efficient Routing Protocol for Mobile Ad hoc Networks with Selfish
Agents. In ACM MobiCom, San Diego, CA, Sep 2003.
[8] W. Wang, X. Li, and Y. Wang. Truthful Multicast Routing in Selfish Wireless Networks. In ACM MobiCom, Philadelphia, PA, Sep 2004.
[9] S. Eidenbenz, V. Kumar, and S. Zust. Equilibria in Topology Control Games for Ad hoc Networks. In DialM-POMC, San Diego, CA, Sep 2003.
[10] C. Saraydar, N. Mandayam, and D. Goodman. Efficient Power Control via Pricing in Wireless Data Networks. IEEE Transactions on Communication, 50(2):291–303, Feb 2002.
[11] V. Srinivasan, P. Nuggehalli, C. Chiasserini, and R. Rao. Co-operation in Wireless Ad Hoc Networks. In IEEE Infocom, San Francisco, CA, Mar 2003.
[12] J. Musacchio and J. Walrand. WiFi Access Point Pricing as a Dynamic Game. In 7th INFORMS Telecommunications Conference, Boca Raton, FL, Mar 2004.
[13] R. K. Lam, D. M. Chiu, and J. C. S. Lui. On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks. In IEEE ICDCS, Lisboa, Portugal, July 2006.
[14] R. K. Lam, D. M. Chiu, and J. C. S. Lui. On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks. IEEE Transactions on Computers, 56(11), Nov 2007.
[15] Mittal, K. Belding, E. Suri, S. A Game Theoretic Analysis of Wireless Access Point Selection by Mobile Users. Estados Unidos. Department of Computer Science, Universidad de California.
[16] S. Perlaza, H. Tembine, S. Lasaulce, M Debbah. Satisfaction equilibrium: A general framework for QoS provisioning in self configuration networks. 2010.
[17] S.M. Perlaza, E.V. Belmega, S. Lasaulce, M. Debbah. On the base station selection and base station sharing in self-configuring networks. France. 2010.
[18] Ciria, R. Estudio de estrategias distribuidas de reparto de recursos en redes inalambricas congnitivas mediante teoria de juegos. España. Departamento de Ingenieria Electronica y Comunicaciones. Universidad de Zaragoza. 2011.
[19] Jose L. Jimeno, Joaquin Perez, Emilio Cerda. Teoria de juegos. Madrid: Pearson Prentice Hall. 2003.