text: We develop a novel design framework for energy-efficient spectrum sharing among autonomous users who aim to minimize their energy consumptions subject to minimum throughput requirements. Most existing works proposed stationary spectrum sharing policies, in which users transmit at fixed power levels. Since users transmit simultaneously under stationary policies, to fulfill minimum throughput requirements, they need to transmit at high power levels to overcome interference. To improve energy efficiency, we construct nonstationary spectrum sharing policies, in which the users transmit at time-varying power levels. Specifically, we focus on TDMA (time-division multiple access) policies in which one user transmits at each time (but not in a round-robin fashion). The proposed policy can be implemented by each user running a low-complexity algorithm in a decentralized manner. It achieves high energy efficiency even when the users have erroneous and binary feedback about their interference levels. Moreover, it can adapt to the dynamic entry and exit of users. The proposed policy is also deviation-proof, namely autonomous users will find it in their self-interests to follow it. Compared to existing policies, the proposed policy can achieve an energy saving of up to 90 when the number of users is high.
  @cite_4: Spectrum management is used to improve performance in multiuser communication system, e.g., cognitive radio or femtocell networks, where multiuser interference can lead to data rate degradation. We study the nonconvex NP-hard problem of maximizing a weighted sum rate in a multiuser Gaussian interference channel by power control subject to affine power constraints. By exploiting the fact that this problem can be restated as an optimization problem with constraints that are spectral radii of specially crafted nonnegative matrices, we derive necessary and sufficient optimality conditions and propose a global optimization algorithm based on the outer approximation method. Central to our techniques is the use of nonnegative matrix theory, e.g., nonnegative matrix inequalities and the Perron-Frobenius theorem. We also study an inner approximation method and a relaxation method that give insights to special cases. Our techniques and algorithm can be extended to a multiple carrier system model, e.g., OFDM system or receivers with interference suppression capability.
  @cite_7: 
  @cite_21: We study a spectrum sharing problem in an unlicensed band where multiple systems coexist and interfere with each other. Due to asymmetries and selfish system behavior, unfair and inefficient situations may arise. We investigate whether efficiency and fairness can be obtained with self-enforcing spectrum sharing rules. These rules have the advantage of not requiring a central authority that verifies compliance to the protocol. Any self-enforcing protocol must correspond to an equilibrium of a game. We first analyze the possible outcomes of a one shot game, and observe that in many cases an inefficient solution results. However, systems often coexist for long periods and a repeated game is more appropriate to model their interaction. In this repeated game the possibility of building reputations and applying punishments allows for 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 present examples that illustrate that in many cases the performance loss due to selfish behavior is small. We also prove that our results are tight and quantify the best achievable performance in a non-cooperative scenario
  @cite_23: In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection by limiting the interference caused by other users. Several models have been considered including: (1) fixed base station assignment where the assignment of users to base stations is fixed, (2) minimum power assignment where a user is iteratively assigned to the base station at which its signal to interference ratio is highest, and (3) diversity reception where a user's signal is combined from several or perhaps all base stations. For the above models, the uplink power control problem can be reduced to finding a vector p of users' transmitter powers satisfying p spl ges I(p) where the jth constraint p sub j spl ges I sub j (p) describes the interference that user j must overcome to achieve an acceptable connection. This work unifies results found for these systems by identifying common properties of the interference constraints. It is also shown that systems in which transmitter powers are subject to maximum power limitations share these common properties. These properties permit a general proof of the synchronous and totally asynchronous convergence of the iteration p(t+1)=I(p(t)) to a unique fixed point at which total transmitted power is minimized. >
  @cite_10: The deployment of cognitive radio networks enables efficient spectrum sharing and opportunistic spectrum access. It also presents new challenges to the classical problem of interference management in wireless networks. This paper develops an axiomatic framework for power allocation in cognitive radio networks based on four goals: QoS protection to primary users, opportunism to secondary users, admissibility to secondary users, and autonomous operation by individual users. Two additional goals, licensing and versatility, which are desirable rather than essential, are also presented. A general class of Duo Priority Class Power Control (DPCPC) policies that satisfy such goals is introduced. Through theoretical analysis and simulation, it is shown that a specific interference-aware power-control algorithm reaches such goals.
  @cite_12: We develop a novel design framework for dynamic distributed spectrum sharing among secondary users (SUs), who adjust their power levels to compete for spectrum opportunities while satisfying the interference temperature (IT) constraints imposed by primary users. The considered interaction among the SUs is characterized by the following three unique features. First, the SUs are interacting with each other repeatedly and they can coexist in the system for a long time. Second, the SUs have limited and imperfect monitoring ability: they only observe whether the IT constraints are violated, and their observation is imperfect due to the erroneous measurements. Third, since the SUs are decentralized, they are selfish and aim to maximize their own long-term payoffs from utilizing the network rather than obeying the prescribed allocation of a centralized controller. To capture these unique features, we model the interaction of the SUs as a repeated game with imperfect monitoring. We first characterize the set of Pareto optimal operating points that can be achieved by deviation-proof spectrum sharing policies, which are policies that the selfish users find it in their interest to comply with. Next, for any given operating point in this set, we show how to construct a deviation-proof policy to achieve it. The constructed deviation-proof policy is amenable to distributed implementation, and allows users to transmit in a time-division multiple-access (TDMA) fashion. In the presence of strong multi-user interference, our policy outperforms existing spectrum sharing policies that dictate users to transmit at constant power levels simultaneously. Moreover, our policy can achieve Pareto optimality even when the SUs have limited and imperfect monitoring ability, as opposed to existing solutions based on repeated game models, which require perfect monitoring abilities. Simulation results validate our analytical results and quantify the performance gains enabled by the proposed spectrum sharing policies.
summary: In this section, we provide a comprehensive comparison between the proposed scheme and existing works. The reader could skip this section and go directly to the system model, if not interested in the detailed comparisons. Although only some works @cite_23 -- @cite_10 use the same problem formulation as ours, we compare against a wide range of related works @cite_4 -- @cite_12 to highlight the technical novelty of our work, and to illustrate that the works @cite_4 -- @cite_7 @cite_21 -- @cite_12 proposed under different problem formulations cannot be adapted to our setting.