Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks
In this paper, we propose a novel algorithm for improving spectrum sensing in cognitive radio networks by forming coalitions among cognitive radio users in a fading channel environment. We use concepts from matching theory, specifically the stable marriage problem, to formulate the interactions am...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English English English |
Published: |
Elsevier
2017
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/57209/ http://irep.iium.edu.my/57209/ http://irep.iium.edu.my/57209/ http://irep.iium.edu.my/57209/1/57209_Novel%20distributed%20algorithm_article.pdf http://irep.iium.edu.my/57209/2/57209_Novel%20distributed%20algorithm_WOS.pdf http://irep.iium.edu.my/57209/3/57209_Novel%20distributed%20algorithm_scopus.pdf |
id |
iium-57209 |
---|---|
recordtype |
eprints |
spelling |
iium-572092017-10-05T05:44:20Z http://irep.iium.edu.my/57209/ Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks Tahir, Mohammad Habaebi, Mohamed Hadi Islam, Md. Rafiqul TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices In this paper, we propose a novel algorithm for improving spectrum sensing in cognitive radio networks by forming coalitions among cognitive radio users in a fading channel environment. We use concepts from matching theory, specifically the stable marriage problem, to formulate the interactions among the cogni- tive radio users as a matching game for collaborative distributed spectrum sensing under target detection probability constraint. The utility function is defined as the average probability of false alarm per cognitive radio user. The advantage of stable marriage is that it always converges to a stable matching and is Pareto optimal when the preferences of cognitive radios are strict. In the proposed model, we extend the stable matching problem to propose a novel algorithm to form coalitions of varying sizes for improving the utility of cognitive radios (false alarm and throughput). The coalitions formed using the algorithm are stable and do not deviate from the final matching. We show using simulations that the proposed algorithm leads to stable coalitions and returns significant improvement in term of reduced probability of false alarm and improved throughput per cognitive radio user as compared to the non-cooperative scenario. Elsevier 2017-07-01 Article PeerReviewed application/pdf en http://irep.iium.edu.my/57209/1/57209_Novel%20distributed%20algorithm_article.pdf application/pdf en http://irep.iium.edu.my/57209/2/57209_Novel%20distributed%20algorithm_WOS.pdf application/pdf en http://irep.iium.edu.my/57209/3/57209_Novel%20distributed%20algorithm_scopus.pdf Tahir, Mohammad and Habaebi, Mohamed Hadi and Islam, Md. Rafiqul (2017) Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks. International Journal of Electronics and Communications ( AEU), 77 (7). pp. 139-148. ISSN 1434-8411 E-ISSN 1618-0399 https://www.journals.elsevier.com/aeu-international-journal-of-electronics-and-communications/ 10.1016/j.aeue.2017.04.033 |
repository_type |
Digital Repository |
institution_category |
Local University |
institution |
International Islamic University Malaysia |
building |
IIUM Repository |
collection |
Online Access |
language |
English English English |
topic |
TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices |
spellingShingle |
TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices Tahir, Mohammad Habaebi, Mohamed Hadi Islam, Md. Rafiqul Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks |
description |
In this paper, we propose a novel algorithm for improving spectrum sensing in cognitive radio networks
by forming coalitions among cognitive radio users in a fading channel environment. We use concepts from
matching theory, specifically the stable marriage problem, to formulate the interactions among the cogni-
tive radio users as a matching game for collaborative distributed spectrum sensing under target detection
probability constraint. The utility function is defined as the average probability of false alarm per cognitive
radio user. The advantage of stable marriage is that it always converges to a stable matching and is Pareto
optimal when the preferences of cognitive radios are strict. In the proposed model, we extend the stable
matching problem to propose a novel algorithm to form coalitions of varying sizes for improving the utility of
cognitive radios (false alarm and throughput). The coalitions formed using the algorithm are stable and do
not deviate from the final matching. We show using simulations that the proposed algorithm leads to stable
coalitions and returns significant improvement in term of reduced probability of false alarm and improved
throughput per cognitive radio user as compared to the non-cooperative scenario. |
format |
Article |
author |
Tahir, Mohammad Habaebi, Mohamed Hadi Islam, Md. Rafiqul |
author_facet |
Tahir, Mohammad Habaebi, Mohamed Hadi Islam, Md. Rafiqul |
author_sort |
Tahir, Mohammad |
title |
Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks |
title_short |
Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks |
title_full |
Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks |
title_fullStr |
Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks |
title_full_unstemmed |
Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks |
title_sort |
novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks |
publisher |
Elsevier |
publishDate |
2017 |
url |
http://irep.iium.edu.my/57209/ http://irep.iium.edu.my/57209/ http://irep.iium.edu.my/57209/ http://irep.iium.edu.my/57209/1/57209_Novel%20distributed%20algorithm_article.pdf http://irep.iium.edu.my/57209/2/57209_Novel%20distributed%20algorithm_WOS.pdf http://irep.iium.edu.my/57209/3/57209_Novel%20distributed%20algorithm_scopus.pdf |
first_indexed |
2023-09-18T21:20:49Z |
last_indexed |
2023-09-18T21:20:49Z |
_version_ |
1777411869528555520 |