Decentralized spatial spectrum access

In this paper, we study the distributed spectrum sharing problem with spatial reuse and without explicit message passing. We propose tow novel threshold-based decentralized spatial spectrum access algorithms, which do not require information exchange among secondary users and channel switching at the equilibrium state. Moreover, we show that the proposed algorithms can converge to either an approximate Nash equilibrium or an approximate Pareto optimum, based on the different threshold designs. Numerical results show that the performance loss of the proposed algorithms is less than 10%, compared with the centralized optimal solution.