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

A Game-Theoretic Approach to Energy-Efficient Resource Allocation in Device-to-Device Underlay Communications

Despite the numerous benefits brought by Device-to-Device (D2D) communications, the introduction of D2D into cellular networks poses many new challenges in the resource allocation design due to the co-channel interference caused by spectrum reuse and limited battery life of User Equipments (UEs). Most of the previous studies mainly focus on how to maximize the Spectral Efficiency (SE) and ignore the energy consumption of UEs. In this paper, we study how to maximize each UE's Energy Efficiency (EE) in an interference-limited environment subject to its specific Quality of Service (QoS) and maximum transmission power constraints. We model the resource allocation problem as a noncooperative game, in which each player is self-interested and wants to maximize its own EE. A distributed interference-aware energy-efficient resource allocation algorithm is proposed by exploiting the properties of the nonlinear fractional programming. We prove that the optimum solution obtained by the proposed algorithm is the Nash equilibrium of the noncooperative game. We also analyze the tradeoff between EE and SE and derive closed-form expressions for EE and SE gaps.Comment: submitted to IET Communications. arXiv admin note: substantial text overlap with arXiv:1405.1963, arXiv:1407.155

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

Interference aware resource allocation model for D2D under cellular network

Device-to-Device communication (D2D) has emerged as an efficient communication model in future generation cellular network for offloading cellular traffic and enhance overall network performance. D2D communication aid in attaining better spectrum utilization, lower delay, and less energy consumption, which can well adapt to meet demand of higher transmission rate, larger network capacity. Further, enhances spectral efficiency by reutilizing resource. However, it may result in severe cross-tier interference and co-tier interference. Therefore, efficient interference modelling design are required to address performance degradation caused by the interferences. The existing model has focused on addressing interference considering D2D association operating on same cell with the cellular association. As a result, it incurs interference to the cellular user located in the same cell. However, practically D2D association in overlapping area will reutilize spectrum of multiple neighboring cells. As a result, it incurs interference in multiple cells. For overcoming research challenges, this work presented Interference Aware Resource Allocation (IARA) model for D2D under cellular network as a game theory model. This work consider a resource allocation game where base station as a contender for catering D2D resource needs under different assumptions. Experiment are conducted to evaluate performance of IARA. The outcome shows IARA attained significant performance improvement over state-of-art models in terms of sum rate (utility), successful packet transmission, revenue, and delay

Energy-Efficient Matching for Resource Allocation in D2D Enabled Cellular Networks

Energy-efficiency (EE) is critical for device-to-device (D2D) enabled cellular networks due to limited battery capacity and severe co-channel interference. In this paper, we address the EE optimization problem by adopting a stable matching approach. The NP-hard joint resource allocation problem is formulated as a one-to-one matching problem under two-sided preferences, which vary dynamically with channel states and interference levels. A game-theoretic approach is employed to analyze the interactions and correlations among user equipments (UEs), and an iterative power allocation algorithm is developed to establish mutual preferences based on nonlinear fractional programming. We then employ the Gale-Shapley (GS) algorithm to match D2D pairs with cellular UEs (CUs), which is proved to be stable and weak Pareto optimal. We provide a theoretical analysis and description for implementation details and algorithmic complexity. We also extend the algorithm to address scalability issues in large-scale networks by developing tie-breaking and preference deletion based matching rules. Simulation results validate the theoretical analysis and demonstrate that significant performance gains of average EE and matching satisfactions can be achieved by the proposed algorithm

Sum Rate Maximization and Consistency in D2D Communication Based on ACO and Game Theory

Cellular network is the most popular network setup among today’s wireless communication systems. The primary resource in a cellular system is the spectrum for communication, and owing to the rising number of cellular users, the spectrum that is currently accessible from different service providers is depleting quickly. The resource or channel allocation is the most hindering task in cellular networks. Many efforts have been taken by many researchers to allocate the resources properly in order to increase the channel utilization and it is found that one effective method for reusing the channels inside a cell is device to device (D2D) communication. D2D communication was first developed in order to achieve the fundamental goals of fast data rates, widespread coverage with little latency, energy efficiency, and low per-information transmission costs. The dynamic behaviour of this network set-up again increases the risk of different types of interferences, which is another issue faced by the researchers. In this paper an effort is taken to understand and solve various aspects of channel allocation and Cellular networks have incorporated interference management in D2D communication especially. The two major issues of allocation of resource and management of interference in D2D communication is addressed here. This paper considers the meta heuristic algorithm namely Ant Colony Optimization (ACO) for resource allocation issue and interference management. The sum rate maximization is achieved through Game theory along with the concept of resource exchange in turn to increase the consistency of D2D communication setup. The results demonstrate that our algorithm can significantly increase the sum rate of D2D pairs when compared to other algorithms suggested by related works