Quality of Service Games for Spectrum Sharing

  title={Quality of Service Games for Spectrum Sharing},
  author={Richard Southwell and Xu Chen and Jianwei Huang},
  journal={IEEE Journal on Selected Areas in Communications},
Today's wireless networks are increasingly crowded with an explosion of wireless users, who have greater and more diverse quality of service (QoS) demands than ever before. However, the amount of spectrum that can be used to satisfy these demands remains finite. This leads to a great challenge for wireless users to effectively share the spectrum to achieve their QoS requirements. This paper presents a game theoretic model for spectrum sharing, where users seek to satisfy their QoS demands in a… 

QoS-splitting for RAT Selection in Heterogeneous Networks

  • Computer Science
  • 2014
This work proposes the concept of “QoS-splitting”, a system model originated from the QoS satisfaction game, but with split demand, and proposes a satisfaction-guaranteed better reply (SBR) algorithm to approach the Nash Equilibrium.

Stochastic Game-Theoretic Spectrum Access in Distributed and Dynamic Environment

A fully distributed and online algorithm based on stochastic learning for the interference-mitigation channel selection, which is proved to converge to the NE of the formulated game.

Distributed cell selection in heterogeneous wireless networks

Distributed Opportunistic Spectrum Access in an Unknown and Dynamic Environment: A Stochastic Learning Approach

A new stochastic learning automata (SLA)-based algorithm is designed, called N-SLA, which can converge to the pure-strategy NEPs of the formulated ordinal potential game in a fully distributed way, and is the first to address the convergence issue of the SLA-based algorithms for general ordinals potential games.

Prospect Pricing in Cognitive Radio Networks

This paper considers the impact of end-user decision making on pricing and management of radio resources in a cognitive radio enabled network when there is uncertainty in the quality of service (QoS) guarantees offered by the service provider (SP).

Generalized Satisfaction Equilibrium for Service-Level Provisioning in Wireless Networks

A generalization of the satisfaction equilibrium for games in satisfaction form (SF) is presented and Bayesian games in SF and the corresponding Bayesian GSE are introduced, providing a theoretical framework for studying service-level provisioning problems in communications networks.

A Paradigm Shift Toward Satisfaction, Realism and Efficiency in Wireless Networks Resource Sharing

This article argues and demonstrates that not only the stability of these solutions depends on whether or not each user achieves the highest performance possible, but they do not properly reflect in reality the most desirable operation points from both the user and system point of view.

A New Theoretical Evaluation Framework for Satisfaction Equilibria in Wireless Networks

Specific measures for evaluating the efficiency of various satisfaction equilibria, in a formal and quantitative manner, expressing the tradeoff with respect to the achieved utility or a given objective function and corresponding cost, are defined and analyzed.

Distributed radio resource allocation in wireless heterogeneous networks

This thesis demonstrates that the HetSNets are amenable to self-organization, albeit with adapted incentives and equilibria to fit the wireless environment, and presents the generalized satisfaction equilibrium (GSE) for games in satisfaction-form.



Spectrum mobility games

This work considers the scenario where cognitive radio users are given the foreknowledge of channel availabilities as a game which is equivalent to a network congestion game in the literature after proper and non-trivial transformations, and designs a protocol which the users can apply to find Nash equilibria in a distributed manner.

Physical interference model based spectrum sharing with generalized spatial congestion games

This paper introduces the generalized spatial congestion game (GSCG), and uses it to model wireless spectrum sharing over a large area, and focuses on determining which GSCGs possess pure Nash equilibria, and how selfish players can organize themselves into pure NashEquilibria.

Spectum sharing as congestion games

  • M. LiuYunnan Wu
  • Computer Science
    2008 46th Annual Allerton Conference on Communication, Control, and Computing
  • 2008
This paper shows how to reformulate two existing distributed spectrum sharing protocols as congestion games, and provides a new formulation by treating frequency-space blocks as resources that is used to construct practical protocols for spectrum sharing between multiple base stations/access points.

Price of Anarchy for Congestion Games in Cognitive Radio Networks

This paper considers a cognitive radio network where multiple heterogenous secondary users (SUs) compete for transmissions on idle primary channels as a singleton congestion game, and studies the price of anarchy (PoA) for four families of such a game: identical, player-specific symmetric, resource-specific asymmetric, and asymmetric games.

Distributed Spectrum Access with Spatial Reuse

This paper proposes a spatial channel selection game to model the distributed channel selection problem with fixed user locations, and develops a distributed learning mechanism that converges to a Nash equilibrium only based on users' local observations.

Convergence Dynamics of Resource-Homogeneous Congestion Games

This work investigates congestion games where the resources are homogeneous but can be player-specific, and derives exact conditions for the longest and shortest convergence times.

Power Control and Channel Allocation in Cognitive Radio Networks with Primary Users' Cooperation

This work considers a point-to-multipoint cognitive radio network that shares a set of channels with a primary network and proposes two-phase mixed distributed/centralized control algorithms that require minimal cooperation between cognitive and primary devices.

Interference map for 802.11 networks

While current methods of gathering the interference map may be appropriate for characterizing interference in one card networks, they are unscalable for multiple card networks when considering: 802.11 characteristics (card and channel asymmetries, time variation), required downtime, and complexity of the measurement procedure.

Adaptive Channel Recommendation for Opportunistic Spectrum Access

A new algorithm based on the model reference adaptive search method is proposed and proved its convergence to the optimal policy of stationary spectrum access and is more robust to channel dynamics.

Multi-Agent Q-Learning for Competitive Spectrum Access in Cognitive Radio Systems

  • Husheng Li
  • Computer Science
    2010 Fifth IEEE Workshop on Networking Technologies for Software Defined Radio Networks (SDR)
  • 2010
An Aloha-like spectrum access scheme without negotiation is considered for multi-user and multi-channel cognitive radio systems and a rigorous proof of the convergence of $Q-learning is provided via the similarity between the $Q$-learning and Robinson-Monro algorithm.