129 research outputs found
Distributed Cooperative Sensing in Cognitive Radio Networks: An Overlapping Coalition Formation Approach
Cooperative spectrum sensing has been shown to yield a significant
performance improvement in cognitive radio networks. In this paper, we consider
distributed cooperative sensing (DCS) in which secondary users (SUs) exchange
data with one another instead of reporting to a common fusion center. In most
existing DCS algorithms, the SUs are grouped into disjoint cooperative groups
or coalitions, and within each coalition the local sensing data is exchanged.
However, these schemes do not account for the possibility that an SU can be
involved in multiple cooperative coalitions thus forming overlapping
coalitions. Here, we address this problem using novel techniques from a class
of cooperative games, known as overlapping coalition formation games, and based
on the game model, we propose a distributed DCS algorithm in which the SUs
self-organize into a desirable network structure with overlapping coalitions.
Simulation results show that the proposed overlapping algorithm yields
significant performance improvements, decreasing the total error probability up
to 25% in the Q_m+Q_f criterion, the missed detection probability up to 20% in
the Q_m/Q_f criterion, the overhead up to 80%, and the total report number up
to 10%, compared with the state-of-the-art non-overlapping algorithm
Coalitional Games with Overlapping Coalitions for Interference Management in Small Cell Networks
In this paper, we study the problem of cooperative interference management in
an OFDMA two-tier small cell network. In particular, we propose a novel
approach for allowing the small cells to cooperate, so as to optimize their
sum-rate, while cooperatively satisfying their maximum transmit power
constraints. Unlike existing work which assumes that only disjoint groups of
cooperative small cells can emerge, we formulate the small cells' cooperation
problem as a coalition formation game with overlapping coalitions. In this
game, each small cell base station can choose to participate in one or more
cooperative groups (or coalitions) simultaneously, so as to optimize the
tradeoff between the benefits and costs associated with cooperation. We study
the properties of the proposed overlapping coalition formation game and we show
that it exhibits negative externalities due to interference. Then, we propose a
novel decentralized algorithm that allows the small cell base stations to
interact and self-organize into a stable overlapping coalitional structure.
Simulation results show that the proposed algorithm results in a notable
performance advantage in terms of the total system sum-rate, relative to the
noncooperative case and the classical algorithms for coalitional games with
non-overlapping coalitions
Game-theoretic Resource Allocation Methods for Device-to-Device (D2D) Communication
Device-to-device (D2D) communication underlaying cellular networks allows
mobile devices such as smartphones and tablets to use the licensed spectrum
allocated to cellular services for direct peer-to-peer transmission. D2D
communication can use either one-hop transmission (i.e., in D2D direct
communication) or multi-hop cluster-based transmission (i.e., in D2D local area
networks). The D2D devices can compete or cooperate with each other to reuse
the radio resources in D2D networks. Therefore, resource allocation and access
for D2D communication can be treated as games. The theories behind these games
provide a variety of mathematical tools to effectively model and analyze the
individual or group behaviors of D2D users. In addition, game models can
provide distributed solutions to the resource allocation problems for D2D
communication. The aim of this article is to demonstrate the applications of
game-theoretic models to study the radio resource allocation issues in D2D
communication. The article also outlines several key open research directions.Comment: Accepted. IEEE Wireless Comms Mag. 201
Improving Macrocell - Small Cell Coexistence through Adaptive Interference Draining
The deployment of underlay small base stations (SBSs) is expected to
significantly boost the spectrum efficiency and the coverage of next-generation
cellular networks. However, the coexistence of SBSs underlaid to an existing
macro-cellular network faces important challenges, notably in terms of spectrum
sharing and interference management. In this paper, we propose a novel
game-theoretic model that enables the SBSs to optimize their transmission rates
by making decisions on the resource occupation jointly in the frequency and
spatial domains. This procedure, known as interference draining, is performed
among cooperative SBSs and allows to drastically reduce the interference
experienced by both macro- and small cell users. At the macrocell side, we
consider a modified water-filling policy for the power allocation that allows
each macrocell user (MUE) to focus the transmissions on the degrees of freedom
over which the MUE experiences the best channel and interference conditions.
This approach not only represents an effective way to decrease the received
interference at the MUEs but also grants the SBSs tier additional transmission
opportunities and allows for a more agile interference management. Simulation
results show that the proposed approach yields significant gains at both
macrocell and small cell tiers, in terms of average achievable rate per user,
reaching up to 37%, relative to the non-cooperative case, for a network with
150 MUEs and 200 SBSs
A Cooperative Bayesian Nonparametric Framework for Primary User Activity Monitoring in Cognitive Radio Network
This paper introduces a novel approach that enables a number of cognitive
radio devices that are observing the availability pattern of a number of
primary users(PUs), to cooperate and use \emph{Bayesian nonparametric}
techniques to estimate the distributions of the PUs' activity pattern, assumed
to be completely unknown. In the proposed model, each cognitive node may have
its own individual view on each PU's distribution, and, hence, seeks to find
partners having a correlated perception. To address this problem, a coalitional
game is formulated between the cognitive devices and an algorithm for
cooperative coalition formation is proposed. It is shown that the proposed
coalition formation algorithm allows the cognitive nodes that are experiencing
a similar behavior from some PUs to self-organize into disjoint, independent
coalitions. Inside each coalition, the cooperative cognitive nodes use a
combination of Bayesian nonparametric models such as the Dirichlet process and
statistical goodness of fit techniques in order to improve the accuracy of the
estimated PUs' activity distributions. Simulation results show that the
proposed algorithm significantly improves the estimates of the PUs'
distributions and yields a performance advantage, in terms of reduction of the
average achieved Kullback-Leibler distance between the real and the estimated
distributions, reaching up to 36.5% relative the non-cooperative estimates. The
results also show that the proposed algorithm enables the cognitive nodes to
adapt their cooperative decisions when the actual PUs' distributions change due
to, for example, PU mobility.Comment: IEEE Journal on Selected Areas in Communications (JSAC), to appear,
201
Spectrum Leasing as an Incentive towards Uplink Macrocell and Femtocell Cooperation
The concept of femtocell access points underlaying existing communication
infrastructure has recently emerged as a key technology that can significantly
improve the coverage and performance of next-generation wireless networks. In
this paper, we propose a framework for macrocell-femtocell cooperation under a
closed access policy, in which a femtocell user may act as a relay for
macrocell users. In return, each cooperative macrocell user grants the
femtocell user a fraction of its superframe. We formulate a coalitional game
with macrocell and femtocell users being the players, which can take individual
and distributed decisions on whether to cooperate or not, while maximizing a
utility function that captures the cooperative gains, in terms of throughput
and delay.We show that the network can selforganize into a partition composed
of disjoint coalitions which constitutes the recursive core of the game
representing a key solution concept for coalition formation games in partition
form. Simulation results show that the proposed coalition formation algorithm
yields significant gains in terms of average rate per macrocell user, reaching
up to 239%, relative to the non-cooperative case. Moreover, the proposed
approach shows an improvement in terms of femtocell users' rate of up to 21%
when compared to the traditional closed access policy.Comment: 29 pages, 11 figures, accepted at the IEEE JSAC on Femtocell Network
Sequentially Distributed Coalition Formation Game for Throughput Maximization in C-RANs
Cloud radio access network (C-RAN) has been proposed as a solution to reducing the huge cost of network upgrade while providing the spectral and energy efficiency needed for the new generation cellular networks. In order to reduce the interference that occur in C-RAN and maximize throughput, this paper proposes a sequentially distributed coalition formation (SDCF) game in which players, in this case the remote radio heads (RRHs), can sequentially join multiple coalitions to maximize their throughput. Contrary to overlapping coalition formation (OCF) game where players contribute fractions of their limited resources to different coalitions, the SDCF game offers better stability by allowing sequential coalition formation depending on the availability of resources and therefore providing a balance between efficient spectrum use and interference management. An algorithm for the proposed model is developed based on the merge-only method. The performance of the proposed algorithm in terms of stability, complexity and convergence to final coalition structure is also investigated. Simulation results show that the proposed SDCF game did not only maximize the throughput in the C-RAN, but it also shows better performances and larger capabilities to manage interference with increasing number of RRHs compared to existing methods
- …