#### DMCA

## Spectrum Sharing for Unlicensed Bands (2005)

### Cached

### Download Links

Venue: | in IEEE DySPAN 2005 |

Citations: | 302 - 4 self |

### Citations

2096 |
Information Theory and Reliable Communication
- Gallager
- 1968
(Show Context)
Citation Context ...uring water in a container whose bottom is given by the noise+interference level. This power allocation maximizes the rate of the system for a given Gaussian noise+interference power spectral density =-=[5]-=-. which tends to log(5)[bits/s/Hz] as P →∞. However, if the systems orthogonalize their power allocations using half of the bandwidth each, the resulting rates are: R1 = R2 = 1 log (1 + 2P ) [bits/s/H... |

1944 |
Rate control in communication networks: shadow prices, proportional fairness and stability
- Kelly, Maulloo, et al.
- 1998
(Show Context)
Citation Context ...ting optimal allocations are very unfair for system 2 (R2 ≪ R1) (see Figure 3). A more fair allocation results from choosing the proportional fair metric UP F (R1, R2) = log(R1) + log(R2) proposed in =-=[11]-=-. By applying the log(·) function to each rate, we give higher priority to the system in disadvantage. We can see in Figure 3 how in scenarios (b) and (c) the use of the proportional fair metric resul... |

603 | The Folk Theorem in Repeated Games with Discounting or with Incomplete Information,”
- Fudenberg, Maskin
- 1986
(Show Context)
Citation Context ...nce Game with utilities (U1, . . . , UM) = F S (R1, . . . , RM) whenever (R1, . . . , RM) ∈ R and Ri > Ri factor δ sufficiently close to 1. t=0 for i = 1, . . . , M for a discount Proof: Theorem C of =-=[10]-=- states that any utility vector that Pareto dominates the payoffs of a Nash equilibrium of the stage game can be supported by a sub-game perfect N.E. of the repeated game for a discount factor δ suffi... |

478 |
A new achievable rate region for the interference channel
- Han, Kobayashi
- 1981
(Show Context)
Citation Context ...ion of the interference channel is unknown (see for example [1] for a summary of the known results about the interference channel). The best inner bound known to date is given by Han and Kobayashi in =-=[2]-=-, whose computation is in general prohibitively complex. Instead of using the best known bounds, in the rest of this work we will assume that each system treats the received interference as noise. Thi... |

310 |
A Noncooperative Equilibrium for Supergames
- Friedman
- 1971
(Show Context)
Citation Context ...fficient resource allocation. A natural question that arises is what set of rates can be supported as a N.E. of the repeated game. The following theorem, a general version of which is due to Friedman =-=[8, 9]-=-, gives a sufficient condition for the rate vector (R1, . . . , RM) to be achievable as the resulting utilities in a N.E. of the repeated game. F S Theorem 5 Let Ri be the rate of system i when all th... |

269 | Distributed multiuser power control for digital subscriber lines
- Yu, Ginis, et al.
- 2002
(Show Context)
Citation Context ...eory. 4.1 Short interaction between systems: one shot game We first consider a static game of complete and perfect information, usually referred to in the literature as the Gaussian Interference Game =-=[7]-=-. The complete information assumption is justified in Section 5 where we show that we can incentivize the systems to measure and exchange their parameters truthfully. The game has M players, the M sys... |

200 | Dual methods for nonconvex spectrum optimization of multicarrier systems
- Yu, Lui
- 2006
(Show Context)
Citation Context ...is, however, assumes cooperation among the systems. Obtaining efficient and fair allocations requires solving optimization problems. The problem of optimizing resource allocations has been studied in =-=[15, 16, 17, 18, 19]-=-. Many of these works rely on relaxations (which may not be applicable to all scenarios) to solve the optimization with tractable complexity. Clemens and Rose study in [14] a repeated game between sel... |

177 | Distributed Interference Compensation for Wireless Networks”,
- Huang, Berry, et al.
- 2006
(Show Context)
Citation Context ...ve been presented in [21]. Popescu, et al. observed in [13] that iterative waterfilling may lead to inefficient solutions. Trying to overcome some of the difficulties of IWA, Huang, et al. propose in =-=[20]-=- to take into account the interference created onto other systems by exchang1 Since the channel models of the DSL and the wireless communication problems are essentially the same, the results for DSL ... |

170 | Some fundamental limits on cognitive radio
- Sahai, Tandra
- 2004
(Show Context)
Citation Context ... know to all the systems performing the optimization. In particular, we assume that the number of systems sharing the spectrum is common knowledge. The difficulty of detection has been pointed out in =-=[3]-=-, however, we will assume in this paper that no such limitations exist. Practical algorithms for the estimation and exchange of parameters are presented in Section 5. Let R be the achievable rate regi... |

130 | Power Control by Geometric Programming,”
- Chiang, Tan, et al.
- 2007
(Show Context)
Citation Context ...is, however, assumes cooperation among the systems. Obtaining efficient and fair allocations requires solving optimization problems. The problem of optimizing resource allocations has been studied in =-=[15, 16, 17, 18, 19]-=-. Many of these works rely on relaxations (which may not be applicable to all scenarios) to solve the optimization with tractable complexity. Clemens and Rose study in [14] a repeated game between sel... |

93 |
Oligopoly and the Theory of Games.
- Friedman
- 1977
(Show Context)
Citation Context ...fficient resource allocation. A natural question that arises is what set of rates can be supported as a N.E. of the repeated game. The following theorem, a general version of which is due to Friedman =-=[8, 9]-=-, gives a sufficient condition for the rate vector (R1, . . . , RM) to be achievable as the resulting utilities in a N.E. of the repeated game. F S Theorem 5 Let Ri be the rate of system i when all th... |

76 | Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines,”
- Luo, Pang
- 2006
(Show Context)
Citation Context ... Sufficient conditions for the uniqueness of the equilibrium of the IWA (which coincide with the Nash equilibria of the Gaussian Interference Game to be discussed in Section 4) have been presented in =-=[21]-=-. Popescu, et al. observed in [13] that iterative waterfilling may lead to inefficient solutions. Trying to overcome some of the difficulties of IWA, Huang, et al. propose in [20] to take into account... |

49 | A game-theoretic approach to power allocation in frequency-selective Gaussian interference channels
- Chung, Kim, et al.
- 2003
(Show Context)
Citation Context ...r. We start by formulating a one shot game in which each system chooses its power allocation once and for all, and this yields the data rates at the operating point. We find, by extending a result of =-=[6]-=- that in low interference situations, the full-spread equilibrium is the only possible outcome of the game. And in many cases, the rates that result from the full-spread equilibrium are suboptimal (in... |

28 | Dual optimization methods for multiuser orthogonal frequency division multiplex systems
- Yu, Lui, et al.
(Show Context)
Citation Context ...is, however, assumes cooperation among the systems. Obtaining efficient and fair allocations requires solving optimization problems. The problem of optimizing resource allocations has been studied in =-=[15, 16, 17, 18, 19]-=-. Many of these works rely on relaxations (which may not be applicable to all scenarios) to solve the optimization with tractable complexity. Clemens and Rose study in [14] a repeated game between sel... |

23 | Power Allocation Strategies in an Unlicensed Spectrum,
- Clemens, Rose, et al.
- 2005
(Show Context)
Citation Context ... studied in [15, 16, 17, 18, 19]. Many of these works rely on relaxations (which may not be applicable to all scenarios) to solve the optimization with tractable complexity. Clemens and Rose study in =-=[14]-=- a repeated game between selfish players in a wireless model. They use a genetic algorithm to find good strategies in a limited strategy space. Their analysis, however, does not consider efficiency an... |

16 |
BSolving nonconvex power control problems in wireless networks: Low SIR regime and distributed algorithms,[ in
- Tan, Palomar, et al.
- 2005
(Show Context)
Citation Context |

13 | Signal Space Partitioning Versus Simultaneous Water Filling for Mutually Interfering Systems
- Popescu, Rose, et al.
- 2004
(Show Context)
Citation Context ...queness of the equilibrium of the IWA (which coincide with the Nash equilibria of the Gaussian Interference Game to be discussed in Section 4) have been presented in [21]. Popescu, et al. observed in =-=[13]-=- that iterative waterfilling may lead to inefficient solutions. Trying to overcome some of the difficulties of IWA, Huang, et al. propose in [20] to take into account the interference created onto oth... |

8 |
Information capacity of channels with partially unknown noise. I. finite-dimensional channels
- Baker, Chao
- 1996
(Show Context)
Citation Context ... turns out that the game has a saddle point and a saddle value, that is, suppX infpZ I(X; Y) = infpZ suppX I(X; Y) which is achieved when both the input and interfering signals are white and Gaussian =-=[12]-=-. It follows that the strongest punishment that can be applied over a misbehaving system is achieved when all the other systems use white Gaussian signals. Therefore, the punishments used in Theorem 5... |

7 |
Geometric programming for communication systems,” Short Monograph in Found. Trends in
- Chiang
- 1999
(Show Context)
Citation Context |

3 |
der Meulen, “Some Reflections on the Interference
- van
- 1994
(Show Context)
Citation Context ...e time interval [0,T]. The input of user i has an average power constraint Pi. Unfortunately, except for few special cases, the capacity region of the interference channel is unknown (see for example =-=[1]-=- for a summary of the known results about the interference channel). The best inner bound known to date is given by Han and Kobayashi in [2], whose computation is in general prohibitively complex. Ins... |

3 |
Metric multidimensional scaling as a convex optimization problem
- Etkin
- 2000
(Show Context)
Citation Context ... i does not know the values of Pj it can at most scale all values of {cj,i}j�=i by the same factor without being detected. • Triangulation: This test uses a metric multi dimensional scaling technique =-=[22]-=- to determine the location of transmitters and receivers from the channel gain measurements. The values of the channel gains cannot be arbitrary; they must correspond to actual locations of transmitte... |

1 |
Spectrum sharing for unlicensed bands, Dynamic Spectrum Access Networks (DySPAN 05
- Etkin, Parekh, et al.
- 2005
(Show Context)
Citation Context ...ems to use arbitrary codes (i.e. non-Gaussian). In addition, for clarity of presentation some results are proved in the Appendices. Preliminary versions of this article have been presented in [1] and =-=[2]-=-. 2 Channel Model We model a situation in which M systems, each formed by a single transmitter-receiver pair, coexist in the same area. Consider an M user Gaussian interference channel in discrete tim... |

1 |
control by geometric programming, to appear in
- Chiang, Tan, et al.
- 2006
(Show Context)
Citation Context ... the interference created onto other systems. Obtaining efficient and fair allocations requires solving optimization problems. The problem of optimizing resource allocations has been studied in [14], =-=[15]-=-, [16]. Many of these works rely on relaxations to solve the optimization with tractable complexity. [13] studies a repeated game between selfish players in a wireless model. It uses a genetic algorit... |