Development of Efficient Resource Allocation Techniques for Cooperative Communication Networks using Game Theoretic Models

Abstract

The ever growing need of wireless data services is swiftly saturating channel capacity of present wireless networks. This situation can be dealt with diversity provided by multiple-input multiple-output (MIMO) technology. However, its implementation becomes infeasible for the small size user nodes. Hence, the idea of cooperative communication, which is also regarded as a virtual MIMO, came into existence. With efficient resource allocation, the performance of cooperative systems can be further increased. This research work presents different game theoretic solutions to address the problem of resource allocation in various cooperative networks. First, a novel integrated scheme based on Stackelberg game (SG) and coalitional game (CG) for both disjoint and overlapping coalitions has been implemented in multi-relay environment. This scheme has paid dividend by ensuring an optimal solution, better throughput and fair distribution of payo s among relay nodes. Simulation results have con rmed that the formation of coalitions has yielded comparable system throughput with respect to that of the centralized approach. The difference in system throughput obtained by overlapping coalitions and centralised approach comes out to be a meagre 0.05 Mbps in case of orthogonal multiple access (OMA) and 0.06 Mbps for non-orthogonal multiple access (NOMA). However, for disjoint coalition scheme, it comes out to be 0:09 Mbps and 0:08 Mbps for OMA and NOMA, respectively. Additionally, there is a need to consider the possible uncertainties in the channel parameters known to a user owing to the random and dynamic nature of the wireless medium. A low-complexity robust SG has been presented to investigate the joint problem of relay selection and power allocation in multiple-relay device-to device (D2D) systems in which the imperfect channel state information (CSI) is considered.