Algoritmo para la provisión de QoS en redes inalámbricas 802.11 basado en restricciones de retardo extremo a extremo Algorithm for the QoS Provision in Wireless Networks 802.11 Based on End-to-End Delay Restrictions

Currently in the world of telecommunication there is the problem to ensure that user services can be transported properly in wireless networks, such networks must certify that the maximum end-to-end delay experienced is below the thresholds necessary to provide quality of service (QoS) especially in applications and services that require transfer of information in real time, such as voice calls, video calls, online games, among others; therefore, it is necessary that the delays are minimal to perform correct communication. In this paper, the problem is approached from the perspective of the theory of noncooperative games using equilibrium arguments such as the equilibrium of satisfaction (ES) as this solution concept ensures meet delay constraints end to end providing the required QoS in this regard.

[1]  Michael J. Neely Delay-Based Network Utility Maximization , 2010, 2010 Proceedings IEEE INFOCOM.

[2]  Hamidou Tembine,et al.  Satisfaction Equilibrium: A General Framework for QoS Provisioning in Self-Configuring Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[3]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Brahim Chaib-draa,et al.  Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games , 2006, Canadian Conference on AI.

[5]  Panganamala Ramana Kumar,et al.  Utility Maximization for Delay Constrained QoS in Wireless , 2009, 2010 Proceedings IEEE INFOCOM.

[6]  Babak Hossein Khalaj,et al.  Delay-constrained utility maximisation in multi-hop random access networks , 2010, IET Commun..

[7]  H. Vincent Poor,et al.  Energy-efficient resource allocation in wireless networks with quality-of-service constraints , 2007, IEEE Transactions on Communications.