1,108 research outputs found
Resource Allocation for D2D Communications Based on Matching Theory
PhDDevice-to-device (D2D) communications underlaying a cellular infrastructure takes advantage
of the physical proximity of communicating devices and increasing resource utilisation.
However, adopting D2D communications in complex scenarios poses substantial
challenges for the resource allocation design. Meanwhile, matching theory has emerged
as a promising framework for wireless resource allocation which can overcome some limitations
of game theory and optimisation. This thesis focuses on the resource allocation
optimisation for D2D communications based on matching theory.
First, resource allocation policy is designed for D2D communications underlaying cellular
networks. A novel spectrum allocation algorithm based on many-to-many matching
is proposed to improve system sum rate. Additionally, considering the quality-of-service
(QoS) requirements and priorities of di erent applications, a context-aware resource allocation
algorithm based on many-to-one matching is proposed, which is capable of providing
remarkable performance enhancement in terms of improved data rate, decreased
packet error rate (PER) and reduced delay.
Second, to improve resource utilisation, joint subchannel and power allocation problem
for D2D communications with non-orthogonal multiple access (NOMA) is studied. For
the subchannel allocation, a novel algorithm based on the many-to-one matching is
proposed for obtaining a suboptimal solution. Since the power allocation problem is
non-convex, sequential convex programming is adopted to transform the original power
allocation problem to a convex one. The proposed algorithm is shown to enhance the
network sum rate and number of accessed users.
Third, driven by the trend of heterogeneity of cells, the resource allocation problem for
NOMA-enhanced D2D communications in heterogeneous networks (HetNets) is investigated. In such a scenario, the proposed resource allocation algorithm is able to closely
approach the optimal solution within a limited number of iterations and achieves higher
sum rate compared to traditional HetNets schemes.
Thorough theoretical analysis is conducted in the development of all proposed algorithms,
and performance of proposed algorithm is evaluated via comprehensive simulations.
This thesis concludes that matching theory based resource allocation for D2D communications
achieves near-optimal performance with acceptable complexity. In addition,
the application of D2D communications in NOMA and HetNets can improve system
performance in terms of sum rate and users connectivity
Matching Theory for Future Wireless Networks: Fundamentals and Applications
The emergence of novel wireless networking paradigms such as small cell and
cognitive radio networks has forever transformed the way in which wireless
systems are operated. In particular, the need for self-organizing solutions to
manage the scarce spectral resources has become a prevalent theme in many
emerging wireless systems. In this paper, the first comprehensive tutorial on
the use of matching theory, a Nobelprize winning framework, for resource
management in wireless networks is developed. To cater for the unique features
of emerging wireless networks, a novel, wireless-oriented classification of
matching theory is proposed. Then, the key solution concepts and algorithmic
implementations of this framework are exposed. Then, the developed concepts are
applied in three important wireless networking areas in order to demonstrate
the usefulness of this analytical tool. Results show how matching theory can
effectively improve the performance of resource allocation in all three
applications discussed
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
- …