103 research outputs found
RESOURCE ALLOCATION FOR WIRELESS RELAY NETWORKS
In this thesis, we propose several resource allocation strategies for relay networks in the context of joint power and bandwidth allocation and relay selection, and joint power allocation and subchannel assignment for orthogonal frequency division multiplexing (OFDM) and orthogonal frequency division multiple access (OFDMA) systems. Sharing the two best ordered relays with equal power between the two users over Rayleigh flat fading channels is proposed to establish full diversity order for both users. Closed form expressions for the outage probability, and bit error probability (BEP) performance measures for both amplify and forward (AF) and decode and forward (DF) cooperative communication schemes are developed for different scenarios. To utilize the full potentials of relay-assisted transmission in multi user systems, we propose a mixed strategy of AF relaying and direct transmission, where the user transmits part of the data using the relay, and the other part is transmitted using the direct link. The resource allocation problem is formulated to maximize the sum rate. A recursive algorithm alternating between power allocation and bandwidth allocation steps is proposed to solve the formulated resource allocation problem. Due to the conflict between limited wireless resources and the fast growing wireless demands, Stackelberg game is proposed to allocate the relay resources (power and bandwidth) between competing users, aiming to maximize the relay benefits from selling its resources. We prove the uniqueness of Stackelberg Nash Equilibrium (SNE) for the proposed game. We develop a distributed algorithm to reach SNE, and investigate the conditions for the stability of the proposed algorithm. We propose low complexity algorithms for AF-OFDMA and DF-OFDMA systems to assign the subcarriers to the users based on high SNR approximation aiming to maximize the weighted sum rate. Auction framework is proposed to devise competition based solutions for the resource allocation of AF-OFDMA aiming tomaximize either vi the sum rate or the fairness index. Two auction algorithms are proposed; sequential and one-shot auctions. In sequential auction, the users evaluate the subcarrier based on the rate marginal contribution. In the one-shot auction, the users evaluate the subcarriers based on an estimate of the Shapley value and bids on all subcarriers at once
Basics of coalitional games with applications to communications and networking
Game theory is the study of decision making in an interactive environment. Coalitional games fulfill the promise of group efficient solutions to problems involving strategic actions. Formulation of optimal player behavior is a fundamental element in this theory. This paper comprises a self-instructive didactic means to study basics of coalitional games indicating how coalitional game theory tools can provide a framework to tackle different problems in communications and networking. We show that coalitional game approaches achieve an improved performance compare to non-cooperative game theoretical solutions
Resource allocation in networks via coalitional games
The main goal of this dissertation is to manage resource allocation in network
engineering problems and to introduce efficient cooperative algorithms to obtain high performance, ensuring fairness and stability. Specifically, this dissertation introduces
new approaches for resource allocation in Orthogonal Frequency Division Multiple Access (OFDMA) wireless networks and in smart power grids by casting the problems to the coalitional game framework and by providing a constructive iterative algorithm based on dynamic learning theory.
Software Engineering (Software)Algorithms and the Foundations of Software technolog
Energy Efficiency in MIMO Underlay and Overlay Device-to-Device Communications and Cognitive Radio Systems
This paper addresses the problem of resource allocation for systems in which
a primary and a secondary link share the available spectrum by an underlay or
overlay approach. After observing that such a scenario models both cognitive
radio and D2D communications, we formulate the problem as the maximization of
the secondary energy efficiency subject to a minimum rate requirement for the
primary user. This leads to challenging non-convex, fractional problems. In the
underlay scenario, we obtain the global solution by means of a suitable
reformulation. In the overlay scenario, two algorithms are proposed. The first
one yields a resource allocation fulfilling the first-order optimality
conditions of the resource allocation problem, by solving a sequence of easier
fractional problems. The second one enjoys a weaker optimality claim, but an
even lower computational complexity. Numerical results demonstrate the merits
of the proposed algorithms both in terms of energy-efficient performance and
complexity, also showing that the two proposed algorithms for the overlay
scenario perform very similarly, despite the different complexity.Comment: to appear in IEEE Transactions on Signal Processin
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
Distributed energy-aware resource allocation in multi-antenna multi-carrier interference networks with statistical CSI
Resource allocation for energy efficiency optimization in multi-carrier interference networks with multiple receive antennas is tackled. First, a one-hop network is considered, and then, the results are extended to the case of a two-hop network in which amplify-and-forward relaying is employed to enable communication. A distributed algorithm which optimizes a system-wide energy-efficient performance function, and which is guaranteed to converge to a stable equilibrium point, is provided. Unlike most previous works, in the definition of the energy efficiency, not only the users' transmit power but also the circuit power that is required to operate the devices is taken into account. All of the proposed procedures are guaranteed to converge and only require statistical channel state information, thus lending themselves to a distributed implementation. The asymptotic regime of a saturated network in which both the active users and the number of receive antennas deployed in each receiver grow large is also analyzed. Numerical results are provided to confirm the merits of the proposed algorithms
- …