Skip to Main content Skip to Navigation
Conference papers

Satisfaction Equilibrium: A General Framework for QoS Provisioning in Self-Configuring Networks

Abstract : This paper is concerned with the concept of equilibrium and quality of service (QoS) provisioning in self-configuring wireless networks with non-cooperative radio devices (RD). In contrast with the Nash equilibrium (NE), where RDs are interested in selfishly maximizing its QoS, we present a concept of equilibrium, named satisfaction equilibrium (SE), where RDs are interested only in guaranteing a minimum QoS. We provide the conditions for the existence and the uniqueness of the SE. Later, in order to provide an equilibrium selection framework for the SE, we introduce the concept of effort or cost of satisfaction, for instance, in terms of transmit power levels, constellation sizes, etc. Using the idea of effort, the set of efficient SE (ESE) is defined. At the ESE, transmitters satisfy their minimum QoS incurring in the lowest effort. We prove that contrary to the (generalized) NE, at least one ESE always exists whenever the network is able to simultaneously support the individual QoS requests. Finally, we provide a fully decentralized algorithm to allow self-configuring networks to converge to one of the SE relying only on local information.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Samir Medina Perlaza Connect in order to contact the contributor
Submitted on : Saturday, January 15, 2011 - 4:26:58 PM
Last modification on : Thursday, June 17, 2021 - 3:48:35 AM
Long-term archiving on: : Saturday, April 16, 2011 - 3:00:49 AM


Files produced by the author(s)


  • HAL Id : hal-00556165, version 1



Samir M. Perlaza, Hamidou Tembine, Samson Lasaulce, Merouane Debbah. Satisfaction Equilibrium: A General Framework for QoS Provisioning in Self-Configuring Networks. GLOBECOM 2010, Dec 2010, United States. 5 p. ⟨hal-00556165⟩



Les métriques sont temporairement indisponibles