Cooperation Scheme For Distributed Spectrum Sensing In Cognitive Radio Networks
Spectrum sensing is an essential phase in cognitive radio networks (CRNs). It enables secondary users (SUs) to access licensed spectrum, which is temporarily not occupied by the primary users (PUs). The widely used scheme of spectrum sensing is cooperative sensing, in which an SU shares its sensing...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
European Alliance for Innovation (EAI)
2014-09-01
|
Series: | EAI Endorsed Transactions on Mobile Communications and Applications |
Subjects: | |
Online Access: | http://eudl.eu/doi/10.4108/mca.1.4.e1 |
_version_ | 1818138675437895680 |
---|---|
author | Ying Dai Jie Wu |
author_facet | Ying Dai Jie Wu |
author_sort | Ying Dai |
collection | DOAJ |
description | Spectrum sensing is an essential phase in cognitive radio networks (CRNs). It enables secondary users (SUs) to access licensed spectrum, which is temporarily not occupied by the primary users (PUs). The widely used scheme of spectrum sensing is cooperative sensing, in which an SU shares its sensing results with other SUs to improve the overall sensing performance, while maximizing its throughput. For a single SU, if its sensing results are shared early, it would have more time for data transmission, which improves the throughput. However, when multiple SUs send their sensing results early, they are more likely to send out their sensing results simultaneously over the same signaling channel. Under these conditions, conflicts would likely happen. Then, both the sensing performance and throughput would be affected. Therefore, it is important to take when-to-share into account. We model the spectrum sensing as an evolutionary game. Different from previous works, the strategy set for each player in our game model contains not only whether to share its sensing results, but also when to share. The payoff for each player is defined based on the throughput, which considers the influence of the time spent both on sensing and sharing. We prove the existence of the evolutionarily stable strategy (ESS). In addition, we propose a practical algorithm for each secondary user to converge to the ESS. We conduct experiments on our testbed consisting of 4 USRP N200s. The experimental results verify for our model, including the convergence to the ESS. |
first_indexed | 2024-12-11T10:15:58Z |
format | Article |
id | doaj.art-ae9aba12bae44ba4a5693a1942209447 |
institution | Directory Open Access Journal |
issn | 2032-9504 |
language | English |
last_indexed | 2024-12-11T10:15:58Z |
publishDate | 2014-09-01 |
publisher | European Alliance for Innovation (EAI) |
record_format | Article |
series | EAI Endorsed Transactions on Mobile Communications and Applications |
spelling | doaj.art-ae9aba12bae44ba4a5693a19422094472022-12-22T01:11:37ZengEuropean Alliance for Innovation (EAI)EAI Endorsed Transactions on Mobile Communications and Applications2032-95042014-09-011411110.4108/mca.1.4.e1Cooperation Scheme For Distributed Spectrum Sensing In Cognitive Radio NetworksYing Dai0Jie Wu1Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122Spectrum sensing is an essential phase in cognitive radio networks (CRNs). It enables secondary users (SUs) to access licensed spectrum, which is temporarily not occupied by the primary users (PUs). The widely used scheme of spectrum sensing is cooperative sensing, in which an SU shares its sensing results with other SUs to improve the overall sensing performance, while maximizing its throughput. For a single SU, if its sensing results are shared early, it would have more time for data transmission, which improves the throughput. However, when multiple SUs send their sensing results early, they are more likely to send out their sensing results simultaneously over the same signaling channel. Under these conditions, conflicts would likely happen. Then, both the sensing performance and throughput would be affected. Therefore, it is important to take when-to-share into account. We model the spectrum sensing as an evolutionary game. Different from previous works, the strategy set for each player in our game model contains not only whether to share its sensing results, but also when to share. The payoff for each player is defined based on the throughput, which considers the influence of the time spent both on sensing and sharing. We prove the existence of the evolutionarily stable strategy (ESS). In addition, we propose a practical algorithm for each secondary user to converge to the ESS. We conduct experiments on our testbed consisting of 4 USRP N200s. The experimental results verify for our model, including the convergence to the ESS.http://eudl.eu/doi/10.4108/mca.1.4.e1Cognitive radio networks (CRNs)spectrum sensinggame theoryUSRP testbed |
spellingShingle | Ying Dai Jie Wu Cooperation Scheme For Distributed Spectrum Sensing In Cognitive Radio Networks EAI Endorsed Transactions on Mobile Communications and Applications Cognitive radio networks (CRNs) spectrum sensing game theory USRP testbed |
title | Cooperation Scheme For Distributed Spectrum Sensing In Cognitive Radio Networks |
title_full | Cooperation Scheme For Distributed Spectrum Sensing In Cognitive Radio Networks |
title_fullStr | Cooperation Scheme For Distributed Spectrum Sensing In Cognitive Radio Networks |
title_full_unstemmed | Cooperation Scheme For Distributed Spectrum Sensing In Cognitive Radio Networks |
title_short | Cooperation Scheme For Distributed Spectrum Sensing In Cognitive Radio Networks |
title_sort | cooperation scheme for distributed spectrum sensing in cognitive radio networks |
topic | Cognitive radio networks (CRNs) spectrum sensing game theory USRP testbed |
url | http://eudl.eu/doi/10.4108/mca.1.4.e1 |
work_keys_str_mv | AT yingdai cooperationschemefordistributedspectrumsensingincognitiveradionetworks AT jiewu cooperationschemefordistributedspectrumsensingincognitiveradionetworks |