18 research outputs found
Joint Distributed Access Point Selection and Power Allocation in Cognitive Radio Networks
Spectrum management has been identified as a crucial step towards enabling
the technology of the cognitive radio network (CRN). Most of the current works
dealing with spectrum management in the CRN focus on a single task of the
problem, e.g., spectrum sensing, spectrum decision, spectrum sharing or
spectrum mobility. In this work, we argue that for certain network
configurations, jointly performing several tasks of the spectrum management
improves the spectrum efficiency. Specifically, we study the uplink resource
management problem in a CRN where there exist multiple cognitive users (CUs)
and access points (APs), with each AP operates on a set of non-overlapping
channels. The CUs, in order to maximize their uplink transmission rates, have
to associate to a suitable AP (spectrum decision), and to share the channels
belong to this AP with other CUs (spectrum sharing). These tasks are clearly
interdependent, and the problem of how they should be carried out efficiently
and distributedly is still open in the literature.
In this work we formulate this joint spectrum decision and spectrum sharing
problem into a non-cooperative game, in which the feasible strategy of a player
contains a discrete variable and a continuous vector. The structure of the game
is hence very different from most non-cooperative spectrum management game
proposed in the literature. We provide characterization of the Nash Equilibrium
(NE) of this game, and present a set of novel algorithms that allow the CUs to
distributively and efficiently select the suitable AP and share the channels
with other CUs. Finally, we study the properties of the proposed algorithms as
well as their performance via extensive simulations.Comment: Accepted by Infocom 2011; Infocom 2011, The 30th IEEE International
Conference on Computer Communication
Distributed Game Theoretic Optimization and Management of Multichannel ALOHA Networks
The problem of distributed rate maximization in multi-channel ALOHA networks
is considered. First, we study the problem of constrained distributed rate
maximization, where user rates are subject to total transmission probability
constraints. We propose a best-response algorithm, where each user updates its
strategy to increase its rate according to the channel state information and
the current channel utilization. We prove the convergence of the algorithm to a
Nash equilibrium in both homogeneous and heterogeneous networks using the
theory of potential games. The performance of the best-response dynamic is
analyzed and compared to a simple transmission scheme, where users transmit
over the channel with the highest collision-free utility. Then, we consider the
case where users are not restricted by transmission probability constraints.
Distributed rate maximization under uncertainty is considered to achieve both
efficiency and fairness among users. We propose a distributed scheme where
users adjust their transmission probability to maximize their rates according
to the current network state, while maintaining the desired load on the
channels. We show that our approach plays an important role in achieving the
Nash bargaining solution among users. Sequential and parallel algorithms are
proposed to achieve the target solution in a distributed manner. The
efficiencies of the algorithms are demonstrated through both theoretical and
simulation results.Comment: 34 pages, 6 figures, accepted for publication in the IEEE/ACM
Transactions on Networking, part of this work was presented at IEEE CAMSAP
201
Stochastic characterization of the spectrum sharing game in ad-hoc networks
Abstract This work focuses on infrastructure-less ad hoc wireless networks where multiple transmitter/receiver pairs share the same radio resources (spectrum); transmitters have to choose how to split a total power budget across orthogonal spectrum bands with the goal to maximize their sum rate under cumulative interference from concurrent transmissions. We start off by introducing and characterizing the non-cooperative game among transmitter/receiver pairs when the network topology is deterministically given. The corresponding Nash equilibria are derived, highlighting their dependency on the topological parameters (distances between wireless nodes, propagation model, and background noise power). The analysis is then extended to the case of random network topologies drawn from a given spatial stochastic process. Tools of stochastic geometry are leveraged to derive a statistical characterization of the equilibria of the spectrum sharing game. Finally, a distributed algorithm is proposed to let the players of the spectrum sharing game converge to equilibria conditions. Numerical simulations show that the proposed algorithm drives the users to stable points that are close to the equilibria of the game requiring limited information exchange among nodes
Chapter Primary Outage-Based Resource Allocation Strategies
Cognition & cognitive psycholog
Distributed power allocation algorithm for spectrum sharing cognitive radio networks with QoS guarantee
In this paper we study the distributed multi-channel power allocation for spectrum sharing cognitive radio networks with QoS guarantee. We formulate this problem as a non-cooperative game G<sub>MCPA-C</sub> with coupled strategy space to address both the co-channel interference among secondary users and the interference temperature regulation imposed by primary systems. We investigate the properties of Nash equilibrium (N.E.) for our G<sub>MCPA-C</sub>, including the existence and QoS provisioning. Furthermore, we derive a layered structure by applying the Lagrangian dual decomposition to G<sub>MCPA-C</sub> and design a distributed algorithm to find the N.E. via this structure. Simulation results are presented to show both the validity of our game theoretic model and the performance of our proposed algorithm. Finally, we incorporate the Pigouvian taxation into our algorithm to improve the efficiency of N.E. when social optimality is considered. © 2009 IEEE