Comprehensive Dynamic Spectrum Allocation in multi-PU multi-SU CRN using Coalition Game Theory

• Published in: 2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) pp. 1 - 6
• Main Authors: Khedkar, Rakhi, Patil, R.A.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-12-2018
• Subjects: Channel allocation; Coalition Game Theory; Cognitive Radio Network; Comprehensive payoff; Dynamic scheduling; Dynamic Spectrum Allocation; Heuristic algorithms; Interference; Reliability; Resource management; Sensors
• ISSN: 2153-1684
• DOI: 10.1109/ANTS.2018.8710087

For optimal Dynamic Spectrum Allocation (DSA) in multi-PU (Primary User) multi-SU (Secondary User) Cognitive Radio Network (CRN), it is necessary to study the comprehensive behavior of each SU. In this paper, we have designed a database assisted CRN using Coalition Game Theory (CGT) to increase the involvement of the maximum number of SUs in the spectrum sensing and allocation. In this model, we have formed Pareto optimal coalitions considering hidden/mobile/remotely located SUs. To enlarge the spectrum allocation rate of this CRN, we have proposed a DSA technique using an even and odd channel allocation scheme. In this scheme, we have used a comprehensive function to determine the payoff of each SU. The simulation result shows that the proposed channel allocation scheme enriching in the payoff of each SU and spectrum allocation rate of the CRN compared with the former coalition game scheme.