Optimal SU Allocation to Multi-PU LCC CR Networks Consisting of Multiple SUs Using Cooperative Resource Sharing and Capacity Theory

Abstract

Resource Allocation is a significant issue in wireless communication and Cognitive Radio Networks in particular, in order to ensure effective utilization of spectrum and telecommunication resources. In this paper we discuss an optimal resource allocation policy for SU in a multi-PU Lost Calls Cleared (LCC) CR Network environment. Here, the primary user (PU) initiates a bargaining to optimally share its underutilized radio resources with the Secondary Users and optimize its profit subject to system constraints. In our proposed model, the Secondary User (SUs) also participate in the bargaining and jointly decides the optimum usage of the shared spectrum from the primary user (PU) satisfying its utility function. Since both the primary and the secondary users aim to maximize their profits by mutual cooperation, we model their interaction by a Nash Bargaining problem using Game Theoretic Approach. We introduce a two-step algorithm in order to obtain the optimal resource allocation for PU and SU. We propose a multi-PU LCC model for optimal resource allocation and obtain an optimal SU assignment policy satisfying the system constraints. The comprehensive simulation results of the analytical model are presented. The result shows encouraging values of average blocking probability and low degradation of system performance with enhanced interference levels.