400 research outputs found
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
Review on Radio Resource Allocation Optimization in LTE/LTE-Advanced using Game Theory
Recently, there has been a growing trend toward ap-plying game theory (GT) to various engineering fields in order to solve optimization problems with different competing entities/con-tributors/players. Researches in the fourth generation (4G) wireless network field also exploited this advanced theory to overcome long term evolution (LTE) challenges such as resource allocation, which is one of the most important research topics. In fact, an efficient de-sign of resource allocation schemes is the key to higher performance. However, the standard does not specify the optimization approach to execute the radio resource management and therefore it was left open for studies. This paper presents a survey of the existing game theory based solution for 4G-LTE radio resource allocation problem and its optimization
A survey of self organisation in future cellular networks
This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks
Spectrum Coordination in Energy Efficient Cognitive Radio Networks
Device coordination in open spectrum systems is a challenging problem,
particularly since users experience varying spectrum availability over time and
location. In this paper, we propose a game theoretical approach that allows
cognitive radio pairs, namely the primary user (PU) and the secondary user
(SU), to update their transmission powers and frequencies simultaneously.
Specifically, we address a Stackelberg game model in which individual users
attempt to hierarchically access to the wireless spectrum while maximizing
their energy efficiency. A thorough analysis of the existence, uniqueness and
characterization of the Stackelberg equilibrium is conducted. In particular, we
show that a spectrum coordination naturally occurs when both actors in the
system decide sequentially about their powers and their transmitting carriers.
As a result, spectrum sensing in such a situation turns out to be a simple
detection of the presence/absence of a transmission on each sub-band. We also
show that when users experience very different channel gains on their two
carriers, they may choose to transmit on the same carrier at the Stackelberg
equilibrium as this contributes enough energy efficiency to outweigh the
interference degradation caused by the mutual transmission. Then, we provide an
algorithmic analysis on how the PU and the SU can reach such a spectrum
coordination using an appropriate learning process. We validate our results
through extensive simulations and compare the proposed algorithm to some
typical scenarios including the non-cooperative case and the
throughput-based-utility systems. Typically, it is shown that the proposed
Stackelberg decision approach optimizes the energy efficiency while still
maximizing the throughput at the equilibrium.Comment: 12 pages, 10 figures, to appear in IEEE Transactions on Vehicular
Technolog
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
Hierarchical Cooperation for Operator-Controlled Device-to-Device Communications: A Layered Coalitional Game Approach
Device-to-Device (D2D) communications, which allow direct communication among
mobile devices, have been proposed as an enabler of local services in 3GPP
LTE-Advanced (LTE-A) cellular networks. This work investigates a hierarchical
LTE-A network framework consisting of multiple D2D operators at the upper layer
and a group of devices at the lower layer. We propose a cooperative model that
allows the operators to improve their utility in terms of revenue by sharing
their devices, and the devices to improve their payoff in terms of end-to-end
throughput by collaboratively performing multi-path routing. To help
understanding the interaction among operators and devices, we present a
game-theoretic framework to model the cooperation behavior, and further, we
propose a layered coalitional game (LCG) to address the decision making
problems among them. Specifically, the cooperation of operators is modeled as
an overlapping coalition formation game (CFG) in a partition form, in which
operators should form a stable coalitional structure. Moreover, the cooperation
of devices is modeled as a coalitional graphical game (CGG), in which devices
establish links among each other to form a stable network structure for
multi-path routing.We adopt the extended recursive core, and Nash network, as
the stability concept for the proposed CFG and CGG, respectively. Numerical
results demonstrate that the proposed LCG yields notable gains compared to both
the non-cooperative case and a LCG variant and achieves good convergence speed.Comment: IEEE Wireless Communications and Networking Conference 201
Distributed power allocation for D2D communications underlaying/overlaying OFDMA cellular networks
The implementation of device-to-device (D2D) underlaying or overlaying
pre-existing cellular networks has received much attention due to the potential
of enhancing the total cell throughput, reducing power consumption and
increasing the instantaneous data rate. In this paper we propose a distributed
power allocation scheme for D2D OFDMA communications and, in particular, we
consider the two operating modes amenable to a distributed implementation:
dedicated and reuse modes. The proposed schemes address the problem of
maximizing the users' sum rate subject to power constraints, which is known to
be nonconvex and, as such, extremely difficult to be solved exactly. We propose
here a fresh approach to this well-known problem, capitalizing on the fact that
the power allocation problem can be modeled as a potential game. Exploiting the
potential games property of converging under better response dynamics, we
propose two fully distributed iterative algorithms, one for each operation mode
considered, where each user updates sequentially and autonomously its power
allocation. Numerical results, computed for several different user scenarios,
show that the proposed methods, which converge to one of the local maxima of
the objective function, exhibit performance close to the maximum achievable
optimum and outperform other schemes presented in the literature
Adaptive Multi-objective Optimization for Energy Efficient Interference Coordination in Multi-Cell Networks
In this paper, we investigate the distributed power allocation for multi-cell
OFDMA networks taking both energy efficiency and inter-cell interference (ICI)
mitigation into account. A performance metric termed as throughput contribution
is exploited to measure how ICI is effectively coordinated. To achieve a
distributed power allocation scheme for each base station (BS), the throughput
contribution of each BS to the network is first given based on a pricing
mechanism. Different from existing works, a biobjective problem is formulated
based on multi-objective optimization theory, which aims at maximizing the
throughput contribution of the BS to the network and minimizing its total power
consumption at the same time. Using the method of Pascoletti and Serafini
scalarization, the relationship between the varying parameters and minimal
solutions is revealed. Furthermore, to exploit the relationship an algorithm is
proposed based on which all the solutions on the boundary of the efficient set
can be achieved by adaptively adjusting the involved parameters. With the
obtained solution set, the decision maker has more choices on power allocation
schemes in terms of both energy consumption and throughput. Finally, the
performance of the algorithm is assessed by the simulation results.Comment: 29 page
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
- âŠ