# Database-assisted Distributed Spectrum Sharing

arXiv: https://arxiv.org/abs/1301.2848 · HTML: https://mlsanity.com/paper/1301.2848/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Jan 2013.

## Built on by (most cited first, 2 of 2)

- [When Machine Learning Meets Spectrum Sharing Security: Methodologies and Challenges](https://mlsanity.com/paper/2201.04677/) (2022)
- [Self-supervised Learning for Clustering of Wireless Spectrum Activity](https://mlsanity.com/paper/2210.02899/) (2022)

## Abstract (arXiv)

According to FCC's ruling for white-space spectrum access, white-space devices are required to query a database to determine the spectrum availability. In this paper, we study the database-assisted distributed white-space access point (AP) network design. We first model the cooperative and non-cooperative channel selection problems among the APs as the system-wide throughput optimization and non-cooperative AP channel selection games, respectively, and design distributed AP channel selection algorithms that achieve system optimal point and Nash equilibrium, respectively. We then propose a state-based game formulation for the distributed AP association problem of the secondary users by taking the cost of mobility into account. We show that the state-based distributed AP association game has the finite improvement property, and design a distributed AP association algorithm that can converge to a state-based Nash equilibrium. Numerical results show that the algorithm is robust to the perturbation by secondary users' dynamical leaving and entering the system.