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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Wiley
2017
|
| Subjects: | |
| Online Access: | 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 http://irep.iium.edu.my/57210/ http://onlinelibrary.wiley.com/doi/10.1002/dac.3332/abstract |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Islam Antarabangsa Malaysia |
| Language: | English English |
| Summary: | 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. |
|---|