Performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks

We consider the problem of increasing the throughput in cognitive radio networks by forming coalitions among cognitive radio user in additive white Gaussian noise (AWGN) channel. For coalition formation using matching theory, we analyze two algorithms, namely Gale-Shapely algorithm and one-sided sta...

Full description

Bibliographic Details
Main Authors: Tahir, Mohammad, Habaebi, Mohamed Hadi, Islam, Md. Rafiqul
Format: Conference or Workshop Item
Language:English
English
Published: IEEE 2017
Subjects:
Online Access:http://irep.iium.edu.my/54042/
http://irep.iium.edu.my/54042/
http://irep.iium.edu.my/54042/
http://irep.iium.edu.my/54042/13/54042.pdf
http://irep.iium.edu.my/54042/19/54042_Performance%20analysis%20of%20coalition%20formation%20algorithms_SCOPUS.pdf
id iium-54042
recordtype eprints
spelling iium-540422017-06-20T02:25:34Z http://irep.iium.edu.my/54042/ Performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks Tahir, Mohammad Habaebi, Mohamed Hadi Islam, Md. Rafiqul TK5101 Telecommunication. Including telegraphy, radio, radar, television We consider the problem of increasing the throughput in cognitive radio networks by forming coalitions among cognitive radio user in additive white Gaussian noise (AWGN) channel. For coalition formation using matching theory, we analyze two algorithms, namely Gale-Shapely algorithm and one-sided stable matching algorithm. For the first algorithm for coalition formation, well-known gale shapely algorithm is used to achieve cooperation among the cognitive radios for spectrum detection and sharing. Each cognitive radio prepares a preference list of other radios in the vicinity for cooperation and hence to form a coalition formation. The second algorithm is based one-sided matching theory which is a variant of the Gale-Shapely algorithm, however, to achieve a stable cooperation, certain criteria must be satisfied. The procedure is similar to the first algorithm (.i.e. formation of preference list and then making offers to other cognitive radio for cooperation) however the difference is in how the coalition formation takes place among the cognitive radios. Finally, using simulations we investigate various aspects of the algorithms and analyse their performance. The proposed algorithms result in improved spectrum detection as well as increasing the spectrum efficiency. IEEE 2017-01-09 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/54042/13/54042.pdf application/pdf en http://irep.iium.edu.my/54042/19/54042_Performance%20analysis%20of%20coalition%20formation%20algorithms_SCOPUS.pdf Tahir, Mohammad and Habaebi, Mohamed Hadi and Islam, Md. Rafiqul (2017) Performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks. In: 14th Student Conference on Research and Development, IEEE (SCOReD2016), 13th-14th December 2016, Kuala Lumpur. http://ieeexplore.ieee.org/document/7810084/ 10.1109/SCORED.2016.7810084
repository_type Digital Repository
institution_category Local University
institution International Islamic University Malaysia
building IIUM Repository
collection Online Access
language English
English
topic TK5101 Telecommunication. Including telegraphy, radio, radar, television
spellingShingle TK5101 Telecommunication. Including telegraphy, radio, radar, television
Tahir, Mohammad
Habaebi, Mohamed Hadi
Islam, Md. Rafiqul
Performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks
description We consider the problem of increasing the throughput in cognitive radio networks by forming coalitions among cognitive radio user in additive white Gaussian noise (AWGN) channel. For coalition formation using matching theory, we analyze two algorithms, namely Gale-Shapely algorithm and one-sided stable matching algorithm. For the first algorithm for coalition formation, well-known gale shapely algorithm is used to achieve cooperation among the cognitive radios for spectrum detection and sharing. Each cognitive radio prepares a preference list of other radios in the vicinity for cooperation and hence to form a coalition formation. The second algorithm is based one-sided matching theory which is a variant of the Gale-Shapely algorithm, however, to achieve a stable cooperation, certain criteria must be satisfied. The procedure is similar to the first algorithm (.i.e. formation of preference list and then making offers to other cognitive radio for cooperation) however the difference is in how the coalition formation takes place among the cognitive radios. Finally, using simulations we investigate various aspects of the algorithms and analyse their performance. The proposed algorithms result in improved spectrum detection as well as increasing the spectrum efficiency.
format Conference or Workshop Item
author Tahir, Mohammad
Habaebi, Mohamed Hadi
Islam, Md. Rafiqul
author_facet Tahir, Mohammad
Habaebi, Mohamed Hadi
Islam, Md. Rafiqul
author_sort Tahir, Mohammad
title Performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks
title_short Performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks
title_full Performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks
title_fullStr Performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks
title_full_unstemmed Performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks
title_sort performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks
publisher IEEE
publishDate 2017
url http://irep.iium.edu.my/54042/
http://irep.iium.edu.my/54042/
http://irep.iium.edu.my/54042/
http://irep.iium.edu.my/54042/13/54042.pdf
http://irep.iium.edu.my/54042/19/54042_Performance%20analysis%20of%20coalition%20formation%20algorithms_SCOPUS.pdf
first_indexed 2023-09-18T21:16:27Z
last_indexed 2023-09-18T21:16:27Z
_version_ 1777411595186470912