4,511 research outputs found
Spectrum Trading: An Abstracted Bibliography
This document contains a bibliographic list of major papers on spectrum
trading and their abstracts. The aim of the list is to offer researchers
entering this field a fast panorama of the current literature. The list is
continually updated on the webpage
\url{http://www.disp.uniroma2.it/users/naldi/Ricspt.html}. Omissions and papers
suggested for inclusion may be pointed out to the authors through e-mail
(\textit{[email protected]})
Game theoretic aspects of distributed spectral coordination with application to DSL networks
In this paper we use game theoretic techniques to study the value of
cooperation in distributed spectrum management problems. We show that the
celebrated iterative water-filling algorithm is subject to the prisoner's
dilemma and therefore can lead to severe degradation of the achievable rate
region in an interference channel environment. We also provide thorough
analysis of a simple two bands near-far situation where we are able to provide
closed form tight bounds on the rate region of both fixed margin iterative
water filling (FM-IWF) and dynamic frequency division multiplexing (DFDM)
methods. This is the only case where such analytic expressions are known and
all previous studies included only simulated results of the rate region. We
then propose an alternative algorithm that alleviates some of the drawbacks of
the IWF algorithm in near-far scenarios relevant to DSL access networks. We
also provide experimental analysis based on measured DSL channels of both
algorithms as well as the centralized optimum spectrum management
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
Resource Allocation for Device-to-Device Communications Underlaying Heterogeneous Cellular Networks Using Coalitional Games
Heterogeneous cellular networks (HCNs) with millimeter wave (mmWave)
communications included are emerging as a promising candidate for the fifth
generation mobile network. With highly directional antenna arrays, mmWave links
are able to provide several-Gbps transmission rate. However, mmWave links are
easily blocked without line of sight. On the other hand, D2D communications
have been proposed to support many content based applications, and need to
share resources with users in HCNs to improve spectral reuse and enhance system
capacity. Consequently, an efficient resource allocation scheme for D2D pairs
among both mmWave and the cellular carrier band is needed. In this paper, we
first formulate the problem of the resource allocation among mmWave and the
cellular band for multiple D2D pairs from the view point of game theory. Then,
with the characteristics of cellular and mmWave communications considered, we
propose a coalition formation game to maximize the system sum rate in
statistical average sense. We also theoretically prove that our proposed game
converges to a Nash-stable equilibrium and further reaches the near-optimal
solution with fast convergence rate. Through extensive simulations under
various system parameters, we demonstrate the superior performance of our
scheme in terms of the system sum rate compared with several other practical
schemes.Comment: 13 pages, 12 figure
- …