# Spectrum Sharing: Fundamental Limits, Scaling Laws, and Self-Enforcing Protocols

### Raul Hernan Etkin

###
EECS Department

University of California, Berkeley

Technical Report No. UCB/EECS-2006-168

December 11, 2006

### http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-168.pdf

Spectrum sharing arises whenever multiple wireless systems operate in the same frequency band. Due to mutual interference, the performance of the systems is coupled and tradeoff occurs between the rates that can be simultaneously achieved. The fundamental characterization of this tradeoff is given by the capacity region of the interference channel, whose determination is an open problem in information theory. For the case of the two-system Gaussian interference channel we provide a characterization of this capacity region to within a single bit/s/Hz. This characterization is obtained by deriving new outer bounds, and by using simple communication schemes that are special cases of the ones introduced by Han and Kobayashi. When many systems share the band, the interference cancellation techniques used in the two-system case may not be feasible, and a large fraction of the interference must be treated as noise. As the number of systems grows, interference aggregates and limits performance. We study the statistical properties of the interference aggregation phenomenon in a random network model and determine how to mitigate the strongest interference components. Frequency selective fading can provide gains in a multi-user system due to multi-user diversity. We investigate whether similar gains can be achieved in multi-system spectrum sharing situations. For this we fix the rate of each system and study how the required bandwidth scales as the number of systems M grows large. While for Rayleigh fading the multi-user diversity gain provides bandwidth savings of the order of log(log M), the multi-system diversity gain can provide larger bandwidth savings, of order log M. We lastly consider the problem of incentives in spectrum sharing. Systems are often independent and selfish. We investigate whether efficiency and fairness can be obtained with self-enforcing spectrum sharing rules that do not require cooperation among the systems. Any self-enforcing protocol must correspond to an equilibrium of a game. We first analyze the possible outcomes of a one shot game, and notice many inefficient solutions. However, since systems often coexist for long periods, a repeated game is more appropriate to model their interaction. In the repeated game, the possibility of building reputations and applying punishments enables a larger set of self-enforcing outcomes. When this set includes the optimal operating point, efficient, fair, and incentive compatible spectrum sharing becomes possible. We prove that our results are tight and quantify the best achievable performance in non-cooperative scenarios.

**Advisor:** David Tse and Abhay Parekh

BibTeX citation:

@phdthesis{Etkin:EECS-2006-168, Author = {Etkin, Raul Hernan}, Title = {Spectrum Sharing: Fundamental Limits, Scaling Laws, and Self-Enforcing Protocols}, School = {EECS Department, University of California, Berkeley}, Year = {2006}, Month = {Dec}, URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-168.html}, Number = {UCB/EECS-2006-168}, Abstract = {Spectrum sharing arises whenever multiple wireless systems operate in the same frequency band. Due to mutual interference, the performance of the systems is coupled and tradeoff occurs between the rates that can be simultaneously achieved. The fundamental characterization of this tradeoff is given by the capacity region of the interference channel, whose determination is an open problem in information theory. For the case of the two-system Gaussian interference channel we provide a characterization of this capacity region to within a single bit/s/Hz. This characterization is obtained by deriving new outer bounds, and by using simple communication schemes that are special cases of the ones introduced by Han and Kobayashi. When many systems share the band, the interference cancellation techniques used in the two-system case may not be feasible, and a large fraction of the interference must be treated as noise. As the number of systems grows, interference aggregates and limits performance. We study the statistical properties of the interference aggregation phenomenon in a random network model and determine how to mitigate the strongest interference components. Frequency selective fading can provide gains in a multi-user system due to multi-user diversity. We investigate whether similar gains can be achieved in multi-system spectrum sharing situations. For this we fix the rate of each system and study how the required bandwidth scales as the number of systems M grows large. While for Rayleigh fading the multi-user diversity gain provides bandwidth savings of the order of log(log M), the multi-system diversity gain can provide larger bandwidth savings, of order log M. We lastly consider the problem of incentives in spectrum sharing. Systems are often independent and selfish. We investigate whether efficiency and fairness can be obtained with self-enforcing spectrum sharing rules that do not require cooperation among the systems. Any self-enforcing protocol must correspond to an equilibrium of a game. We first analyze the possible outcomes of a one shot game, and notice many inefficient solutions. However, since systems often coexist for long periods, a repeated game is more appropriate to model their interaction. In the repeated game, the possibility of building reputations and applying punishments enables a larger set of self-enforcing outcomes. When this set includes the optimal operating point, efficient, fair, and incentive compatible spectrum sharing becomes possible. We prove that our results are tight and quantify the best achievable performance in non-cooperative scenarios.} }

EndNote citation:

%0 Thesis %A Etkin, Raul Hernan %T Spectrum Sharing: Fundamental Limits, Scaling Laws, and Self-Enforcing Protocols %I EECS Department, University of California, Berkeley %D 2006 %8 December 11 %@ UCB/EECS-2006-168 %U http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-168.html %F Etkin:EECS-2006-168