Coalition formation for cooperative spectrum sharing in cognitive radio wireless networks using Gale Shapley Algorithm
Abstract— In this paper we consider the problem of increasing the throughput of cognitive radio in a cognitive radio network by forming coalitions among cognitive radio users. Recently there have been numerous studies exploring the benefits of the cooperation in a cognitive radio network. The cooper...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2016
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/49009/ http://irep.iium.edu.my/49009/ http://irep.iium.edu.my/49009/ http://irep.iium.edu.my/49009/9/Handbook-Biophotoni-Photonic-Healthcare-1.pdf http://irep.iium.edu.my/49009/11/49009_Coalition%20formation%20for%20cooperative%20spectrum_scopus.pdf |
| Summary: | Abstract— In this paper we consider the problem of increasing the throughput of cognitive radio in a cognitive radio network by forming coalitions among cognitive radio users. Recently there have been numerous studies exploring the benefits of the cooperation in a cognitive radio network. The cooperation tends to increase the spectrum sensing performance which in turn results in increased transmission opportunities. In this paper we use the concepts from matching theory, specifically we use gale-shapely algorithm, to form the coalition among cognitive radio user for collaborative spectrum sensing under target detection probability constraint. In the proposed model we modify gale-shapely algorithm for the cognitive radio users to form coalitions of varying size to increase their individual gains (.e.g. throughput and probability of false alarm). We show using simulation that using the modified gale shapely algorithm for coalition formation yields significant gains in term of reduced false alarm probability and increased throughput per cognitive radio user as compared to non-cooperative cognitive radio user. |
|---|