SPECTRUM SHARING IN COGNITIVE RADIO NETWORKS WITH QUALITY OF SERVICE AWARENESS

The goal of this thesis is to study performance of cognitive radio networks in terms of total spectrum utilization and throughput of secondary networks under perfect and imperfect sensing for Additive White Gaussian Noise (AWGN) and fading channels. The effect of imperfect sensing was studied by applying non-collaborative and collaborative sensing techniques using energy detecting and square law combining techniques, respectively. Spectrum allocation for heterogeneous networks in cognitive radio networks was discussed and a new sharing algorithm that guarantee Quality of Service (QoS) for different secondary users’ applications was proposed. The throughput degradation of secondary users due to the activities of the primary users was explored by varying the arrival rate of the primary users in a given spectrum band. Computer simulation showed that increasing the primary user’s activity will increase the total spectrum utilization but decreases the secondary users’ throughput simultaneously. The effect of the received Signal to Noise Ratio (SNR) of the primary user on the cognitive radio network performance is studied in which, a high SNR of primary users led to a higher throughput of secondary network in AWGN channels compared to Nakagami fading channels. The effect of applying cooperative sensing is also presented in this thesis. As we increased the number of cooperating sensors, the network throughput increased which proves the advantage of applying cooperative sensing. A spectrum allocation algorithm for heterogeneous network model is developed to study the QoS assurance of secondary users in cognitive radio networks. The system performance of the heterogeneous network was investigated in terms of the total spectrum utilization. It is found that, higher number of secondary users, better channel’s condition and low required QoS of applications would increase the spectrum utilization significantly. vii In this thesis, the proposed allocation algorithm was applied to the heterogeneous cognitive radio model and its performance was compared to the First Come First Served (FCFS) algorithm in both AWGN and fading channels. The proposed algorithm provided a higher average SNR and spectrum utilization than FCFS algorithm and guaranteed the QoS requirement for applications of secondary users. The effect of imperfect sensing on the system performance was investigated, and it was shown that, as the probability of detection increases the total applications’ data rate increases significantly. The proposed algorithm guaranteed the QoS requirement for each application of secondary users. The effect of imperfect sensing on the system performance was investigated, and it was shown that, as the probability of detection increases the total data rate increases significantly

Resource management in location aware cognitive radio networks

Dynamic spectrum access (DSA) aims at utilizing spectral opportunities both in time and frequency domains at any given location, which arise due to variations in spectrum usage. Recently, Cognitive radios (CRs) have been proposed as a means of implementing DSA. In this work we focus on the aspect of resource management in overlaid CRNs. We formulate resource allocation strategies for cognitive radio networks (CRNs) as mathematical optimization problems. Specifically, we focus on two key problems in resource management: Sum Rate Maximization and Maximization of Number of Admitted Users. Since both the above mentioned problems are NP hard due to presence of binary assignment variables, we propose novel graph based algorithms to optimally solve these problems. Further, we analyze the impact of location awareness on network performance of CRNs by considering three cases: Full location Aware, Partial location Aware and Non location Aware. Our results clearly show that location awareness has significant impact on performance of overlaid CRNs and leads to increase in spectrum utilization effciency

A bipartite graph based proportional fair scheduling strategy to improve throughput with multiple resource blocks

The fifth-generation wireless communication is expected to provide a huge amount of capacity to cater to the need of an increasing number of mobile consumers, which can be satisfied by device-to-device (D2D) communication. Reusing the cellular user’s resources in an efficient manner helps to increase the spectrum efficiency of the network but it leads to severe interference. The important point in reusing cellular user resources is that D2D communication should not affect the cellular user’s efficiency. After achieving this requirement, the focus is now turned toward the allocation of resources to D2D communication. This resource allocation strategy is to be designed in such a way that it will not affect communication among the cellular user (CU). This scheme improves various performance objectives. This paper aims at designing a proportional fair resource allocation algorithm based on the bipartite graph which maintains the quality of service (QoS) of CUs while providing D2D communication. This algorithm can be merged with any other scheme of resource allocation for improving QoS and adopting changing channels. In this scheme, a D2D pair can be allocated with one or more than one resource blocks. The MATLAB simulations analyze the performance of the proposed scheme