Novel distributed algorithm for coalition formation in cognitive radio networks for throughput enhancement using matching theory
In this paper, a novel algorithm is proposed for increasing the throughput in cognitive radio networks by forming coalitions among cognitive radio users in AWGN and fading channel environment. Although there have been numerous studies exploring the benefits of coalition formation in cognitive rad...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Wiley
2017
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/57210/ http://irep.iium.edu.my/57210/ http://irep.iium.edu.my/57210/ http://irep.iium.edu.my/57210/1/10.1002%40dac.3332.pdf http://irep.iium.edu.my/57210/7/57210-Novel%20distributed%20algorithm_SCOPUS.pdf |
| id |
iium-57210 |
|---|---|
| recordtype |
eprints |
| spelling |
iium-572102017-06-08T00:44:58Z http://irep.iium.edu.my/57210/ Novel distributed algorithm for coalition formation in cognitive radio networks for throughput enhancement using matching theory Tahir, Mohammad Habaebi, Mohamed Hadi Islam, Md. Rafiqul TK5101 Telecommunication. Including telegraphy, radio, radar, television In this paper, a novel algorithm is proposed for increasing the throughput in cognitive radio networks by forming coalitions among cognitive radio users in AWGN and fading channel environment. Although there have been numerous studies exploring the benefits of coalition formation in cognitive radio networks from the game theory perspective, there are several limitations in their application. To overcome the limitations of game theory, concepts from matching theory are used. Specifically, the stable marriage problem is used to formulate the interactions among the cognitive 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, the stable matching problem is extended to propose a novel algorithm to form coalitions of varying sizes for improving the utility of CR (false alarm and throughput). The coalitions formed using the algorithm are stable and do not deviate from the final matching. Using simulations and mathematical analysis, it is shown that the proposed algorithm leads to stable coalitions and returns significant improvement in terms of reduced probability of false alarm and improved throughput per cognitive radio user as compared to the noncooperative scenario. Wiley 2017-05-28 Article PeerReviewed application/pdf en http://irep.iium.edu.my/57210/1/10.1002%40dac.3332.pdf application/pdf en http://irep.iium.edu.my/57210/7/57210-Novel%20distributed%20algorithm_SCOPUS.pdf Tahir, Mohammad and Habaebi, Mohamed Hadi and Islam, Md. Rafiqul (2017) Novel distributed algorithm for coalition formation in cognitive radio networks for throughput enhancement using matching theory. International Journal of Communication Systems. pp. 1-15. ISSN 1099-1131 (In Press) http://onlinelibrary.wiley.com/doi/10.1002/dac.3332/abstract DOI: 10.1002/dac.3332 |
| 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 Novel distributed algorithm for coalition formation in cognitive radio networks for throughput enhancement using matching theory |
| description |
In this paper, a novel algorithm is proposed for increasing the throughput in cognitive
radio networks by forming coalitions among cognitive radio users in AWGN and
fading channel environment. Although there have been numerous studies exploring
the benefits of coalition formation in cognitive radio networks from the game theory
perspective, there are several limitations in their application. To overcome the limitations
of game theory, concepts from matching theory are used. Specifically, the
stable marriage problem is used to formulate the interactions among the cognitive
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, the stable matching
problem is extended to propose a novel algorithm to form coalitions of varying sizes
for improving the utility of CR (false alarm and throughput). The coalitions formed
using the algorithm are stable and do not deviate from the final matching. Using simulations
and mathematical analysis, it is shown that the proposed algorithm leads to
stable coalitions and returns significant improvement in terms of reduced probability
of false alarm and improved throughput per cognitive radio user as compared to
the noncooperative 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 in cognitive
radio networks for throughput enhancement using
matching theory |
| title_short |
Novel distributed algorithm for coalition formation in cognitive
radio networks for throughput enhancement using
matching theory |
| title_full |
Novel distributed algorithm for coalition formation in cognitive
radio networks for throughput enhancement using
matching theory |
| title_fullStr |
Novel distributed algorithm for coalition formation in cognitive
radio networks for throughput enhancement using
matching theory |
| title_full_unstemmed |
Novel distributed algorithm for coalition formation in cognitive
radio networks for throughput enhancement using
matching theory |
| title_sort |
novel distributed algorithm for coalition formation in cognitive
radio networks for throughput enhancement using
matching theory |
| publisher |
Wiley |
| publishDate |
2017 |
| url |
http://irep.iium.edu.my/57210/ http://irep.iium.edu.my/57210/ http://irep.iium.edu.my/57210/ http://irep.iium.edu.my/57210/1/10.1002%40dac.3332.pdf http://irep.iium.edu.my/57210/7/57210-Novel%20distributed%20algorithm_SCOPUS.pdf |
| first_indexed |
2023-09-18T21:20:49Z |
| last_indexed |
2023-09-18T21:20:49Z |
| _version_ |
1777411869677453312 |