Wideband spectrum sensing in cognitive radio networks remains an open challenge due to wideband spectrum acquisition implementation. Compressed spectrum sensing provides a powerful approach to acquire wideband signals. We purpose a probabilistic Space-time Bayesian Compressed Spectrum Sensing (ST-BCSS) to combat the noise in wideband compressed spectrum sensing. We present an informative hierarchical prior probabilistic model to recover the compressed spectrum by exploiting the temporal and spatial prior information. These priori information endows the robustness of spectrum sensing subject to noise and low sampling rate. We present a probabilistic framework to address how to represent, convey and fuse multi-prior information to improve the local compressed spectrum reconstruction. Numerical simulation results demonstrate that the ST-BCSS algorithm improves the performance of compressed spectrum sensing under low sampling rate and low Signal Noise Ratio (SNR), compared with the traditional Basis Pursuit and Orthogonal Matching Pursuit algorithms. A correlation based algorithm for the detection of reconstruction failure due to non-sparse spectrum is also proposed and demonstrated using numerical simulations.
{"title":"Space-Time Bayesian Compressed Spectrum Sensing for Wideband Cognitive Radio Networks","authors":"Zhenghao Zhang, Husheng Li, Depeng Yang, Changxing Pei","doi":"10.1109/DYSPAN.2010.5457841","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457841","url":null,"abstract":"Wideband spectrum sensing in cognitive radio networks remains an open challenge due to wideband spectrum acquisition implementation. Compressed spectrum sensing provides a powerful approach to acquire wideband signals. We purpose a probabilistic Space-time Bayesian Compressed Spectrum Sensing (ST-BCSS) to combat the noise in wideband compressed spectrum sensing. We present an informative hierarchical prior probabilistic model to recover the compressed spectrum by exploiting the temporal and spatial prior information. These priori information endows the robustness of spectrum sensing subject to noise and low sampling rate. We present a probabilistic framework to address how to represent, convey and fuse multi-prior information to improve the local compressed spectrum reconstruction. Numerical simulation results demonstrate that the ST-BCSS algorithm improves the performance of compressed spectrum sensing under low sampling rate and low Signal Noise Ratio (SNR), compared with the traditional Basis Pursuit and Orthogonal Matching Pursuit algorithms. A correlation based algorithm for the detection of reconstruction failure due to non-sparse spectrum is also proposed and demonstrated using numerical simulations.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133170098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457899
D. Kalathil, Rahul Jain
Development of dynamic spectrum access and allo- cation techniques recently [6] have made feasible the vision of cognitive radio systems. However, a fundamental question arises: Why would licensed primary users of a spectrum band allow secondary users to share the band and degrade performance for them? This incentive issue has been sought to be addressed by designing incentive-compatible auction mechanisms [4]. This, however, does not solve the problem. It is not clear who acts as the auctioneer. If the primary himself does, why would the secondary trust the primary to not manipulate the auction. We propose that a more appropriate mechanism to solve this incentive problem is a contractual mechanism. In this paper, we consider a simple setting: A single primary transmitter-receiver pair and a single secondary transmitter-receiver pair with a Gaussian interference channel between them. We consider the setting of complete information when channel attenuation coefficients and noise levels at the receivers are common knowledge. We consider that receivers cooperate to do successive-interference cancellation. Unlike the results of [7] for unlicensed bands, we show that it is possible to achieve socially optimal rate allocations with contracts in licensed bands.
{"title":"Spectrum Sharing through Contracts","authors":"D. Kalathil, Rahul Jain","doi":"10.1109/DYSPAN.2010.5457899","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457899","url":null,"abstract":"Development of dynamic spectrum access and allo- cation techniques recently [6] have made feasible the vision of cognitive radio systems. However, a fundamental question arises: Why would licensed primary users of a spectrum band allow secondary users to share the band and degrade performance for them? This incentive issue has been sought to be addressed by designing incentive-compatible auction mechanisms [4]. This, however, does not solve the problem. It is not clear who acts as the auctioneer. If the primary himself does, why would the secondary trust the primary to not manipulate the auction. We propose that a more appropriate mechanism to solve this incentive problem is a contractual mechanism. In this paper, we consider a simple setting: A single primary transmitter-receiver pair and a single secondary transmitter-receiver pair with a Gaussian interference channel between them. We consider the setting of complete information when channel attenuation coefficients and noise levels at the receivers are common knowledge. We consider that receivers cooperate to do successive-interference cancellation. Unlike the results of [7] for unlicensed bands, we show that it is possible to achieve socially optimal rate allocations with contracts in licensed bands.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124948934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457883
Youwen Yi, Jin Zhang, Qian Zhang, Tao Jiang, Jietao Zhang
In this paper, we focus on the dynamic spectrum access of two infrastructure-based cognitive radio networks, primary network and secondary network, which are collocated with each other. To improve network performance of two networks, we propose a cooperative communication-aware spectrum leasing framework, in which, primary network leverages secondary users as cooperative relays, and decides the optimal strategy on the relay selection and the price for spectrum leasing. Based on primary network's strategy, secondary network determines the length of spectrum access time it purchases from the primary network. Finally, each network allocates the total spectrum access time of the network among its end users. The above sequential decision procedure is formulated as a Stackelberg game, with primary network acting as the leader and secondary network as the follower, and a unique Nash Equilibrium (NE) point is achieved through backward induction analysis. At this NE point, both networks maximize their utilities in terms of transmission rate and revenue/payment. Meanwhile, the optimal relay selection and spectrum resource allocation among all the users are also derived based on the Nash Equilibrium. Simulation results show that both primary and secondary networks achieve higher utility by exploiting cooperative transmission under our proposed framework, which gives both networks incentive for cooperation.
{"title":"Cooperative Communication-Aware Spectrum Leasing in Cognitive Radio Networks","authors":"Youwen Yi, Jin Zhang, Qian Zhang, Tao Jiang, Jietao Zhang","doi":"10.1109/DYSPAN.2010.5457883","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457883","url":null,"abstract":"In this paper, we focus on the dynamic spectrum access of two infrastructure-based cognitive radio networks, primary network and secondary network, which are collocated with each other. To improve network performance of two networks, we propose a cooperative communication-aware spectrum leasing framework, in which, primary network leverages secondary users as cooperative relays, and decides the optimal strategy on the relay selection and the price for spectrum leasing. Based on primary network's strategy, secondary network determines the length of spectrum access time it purchases from the primary network. Finally, each network allocates the total spectrum access time of the network among its end users. The above sequential decision procedure is formulated as a Stackelberg game, with primary network acting as the leader and secondary network as the follower, and a unique Nash Equilibrium (NE) point is achieved through backward induction analysis. At this NE point, both networks maximize their utilities in terms of transmission rate and revenue/payment. Meanwhile, the optimal relay selection and spectrum resource allocation among all the users are also derived based on the Nash Equilibrium. Simulation results show that both primary and secondary networks achieve higher utility by exploiting cooperative transmission under our proposed framework, which gives both networks incentive for cooperation.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121606946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457906
Ryan W. Thomas, R. S. Komali, B. Borghetti, P. Mahonen
Dynamic spectrum access has proposed tiering radios into two groups: Primary Users (PUs) and Secondary Users (SUs). PUs are assumed to have reserved spectrum available to them, while SUs (operating in overlay mode) must share whatever spectrum is available. The threat of emulation attacks, in which users pretend to be of a type they are not (either PU or SU) in order to gain unauthorized access to spectrum, has the potential to severely degrade the expected performance of the system. We analyze this problem within a Bayesian game framework, in which users are unsure of the legitimacy of the claimed type of other users. We show that depending on radios' beliefs about the fraction of PUs in the system, a policy maker can control the occurrence of emulation attacks by adjusting the gains and costs associated with performing or checking for for emulation attacks.
{"title":"A Bayesian Game Analysis of Emulation Attacks in Dynamic Spectrum Access Networks","authors":"Ryan W. Thomas, R. S. Komali, B. Borghetti, P. Mahonen","doi":"10.1109/DYSPAN.2010.5457906","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457906","url":null,"abstract":"Dynamic spectrum access has proposed tiering radios into two groups: Primary Users (PUs) and Secondary Users (SUs). PUs are assumed to have reserved spectrum available to them, while SUs (operating in overlay mode) must share whatever spectrum is available. The threat of emulation attacks, in which users pretend to be of a type they are not (either PU or SU) in order to gain unauthorized access to spectrum, has the potential to severely degrade the expected performance of the system. We analyze this problem within a Bayesian game framework, in which users are unsure of the legitimacy of the claimed type of other users. We show that depending on radios' beliefs about the fraction of PUs in the system, a policy maker can control the occurrence of emulation attacks by adjusting the gains and costs associated with performing or checking for for emulation attacks.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125484960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457916
B. Freyens, M. Loney, M. Poole
Australia assigns and allocates spectrum using three broad types of regulatory approaches; command and control, property rights and open access. Each approach entails numerous pros and cons, buttressed by uncertainties over future consumer demand, interference management, barriers to entry, and technological evolution. The development and commercialisation of dynamic spectrum access technologies (DSA) requires new regulatory approaches. This article discusses an array of intermediary, dynamically efficient spectrum management approaches, which may make better use of DSA opportunities. The article then discusses the practical hurdles and legal challenges posed by their adoption and regulation in an Australian context.
{"title":"Wireless Regulations and Dynamic Spectrum Access in Australia","authors":"B. Freyens, M. Loney, M. Poole","doi":"10.1109/DYSPAN.2010.5457916","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457916","url":null,"abstract":"Australia assigns and allocates spectrum using three broad types of regulatory approaches; command and control, property rights and open access. Each approach entails numerous pros and cons, buttressed by uncertainties over future consumer demand, interference management, barriers to entry, and technological evolution. The development and commercialisation of dynamic spectrum access technologies (DSA) requires new regulatory approaches. This article discusses an array of intermediary, dynamically efficient spectrum management approaches, which may make better use of DSA opportunities. The article then discusses the practical hurdles and legal challenges posed by their adoption and regulation in an Australian context.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120860314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457898
Husheng Li, Zhu Han
Collaborative spectrum sensing, which collects local observations or decisions from multiple secondary users to make a decision by a fusion center, is an effective approach to alleviate the unreliability of single-user spectrum sensing. However, it is subject to the attack of malicious secondary user(s), which may send false reports. Therefore, it is necessary to detect potential attacker(s) and make attack-proof decisions for spectrum sensing. Most existing attacker detection schemes are based on the knowledge of the attacker's strategy and thus apply the Baeysian detection of attackers. However, in practical cognitive radio systems, the data fusion center typically does not know the attacker's strategy. To alleviate the problem of the unknown strategy of attacker(s), an abnormality detection approach, based on the abnormality detection in data mining, is proposed. The performance of the attacker detection in the single-attacker scenario is analyzed explicitly. For the case that the attacker does not know the reports of honest secondary users (called independent attack), it is numerically shown that attacker can always be detected as the number of spectrum sensing rounds tends to infinity. For the case that the attacker knows all the reports of other secondary users, based on which the attacker sends its report (called dependent attack), an approach for the attacker to perfectly avoid being detected is found, provided that the attacker has perfect information about the miss detection and false alarm probabilities. This motivates cognitive radio systems to protect the reports of secondary users. The performance of attacker detection in the general case of multiple attackers is demonstrated using numerical simulations.
{"title":"Catching Attacker(s) for Collaborative Spectrum Sensing in Cognitive Radio Systems: An Abnormality Detection Approach","authors":"Husheng Li, Zhu Han","doi":"10.1109/DYSPAN.2010.5457898","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457898","url":null,"abstract":"Collaborative spectrum sensing, which collects local observations or decisions from multiple secondary users to make a decision by a fusion center, is an effective approach to alleviate the unreliability of single-user spectrum sensing. However, it is subject to the attack of malicious secondary user(s), which may send false reports. Therefore, it is necessary to detect potential attacker(s) and make attack-proof decisions for spectrum sensing. Most existing attacker detection schemes are based on the knowledge of the attacker's strategy and thus apply the Baeysian detection of attackers. However, in practical cognitive radio systems, the data fusion center typically does not know the attacker's strategy. To alleviate the problem of the unknown strategy of attacker(s), an abnormality detection approach, based on the abnormality detection in data mining, is proposed. The performance of the attacker detection in the single-attacker scenario is analyzed explicitly. For the case that the attacker does not know the reports of honest secondary users (called independent attack), it is numerically shown that attacker can always be detected as the number of spectrum sensing rounds tends to infinity. For the case that the attacker knows all the reports of other secondary users, based on which the attacker sends its report (called dependent attack), an approach for the attacker to perfectly avoid being detected is found, provided that the attacker has perfect information about the miss detection and false alarm probabilities. This motivates cognitive radio systems to protect the reports of secondary users. The performance of attacker detection in the general case of multiple attackers is demonstrated using numerical simulations.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128523794","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457880
P. Marshall
Much of the consideration of Dynamic Spectrum Access (DSA) has been focused on its ability to provide secondary spectrum sharing without any impact on primary users of the spectrum. This paper argues that significantly more spectrum sharing is possible, if a regime is established where-in some level of interference is permitted, and all users of the spectrum have the ability to utilize DSA in order to relocate in the event of unacceptable interference. It is shown that this regime offers higher reliability for both primary and secondary users, significantly increases the density of spectrum usage, and provides the ability to statistically distribute the effects of interference to ensure that no single user is subjected to highly correlated effects. While features resembling DSA are being included in some emerging system designs, its transition to a general and heterogeneous environment has not yet occurred.
{"title":"Dynamic Spectrum Access as a Mechanism for Transition to Interference Tolerant Systems","authors":"P. Marshall","doi":"10.1109/DYSPAN.2010.5457880","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457880","url":null,"abstract":"Much of the consideration of Dynamic Spectrum Access (DSA) has been focused on its ability to provide secondary spectrum sharing without any impact on primary users of the spectrum. This paper argues that significantly more spectrum sharing is possible, if a regime is established where-in some level of interference is permitted, and all users of the spectrum have the ability to utilize DSA in order to relocate in the event of unacceptable interference. It is shown that this regime offers higher reliability for both primary and secondary users, significantly increases the density of spectrum usage, and provides the ability to statistically distribute the effects of interference to ensure that no single user is subjected to highly correlated effects. While features resembling DSA are being included in some emerging system designs, its transition to a general and heterogeneous environment has not yet occurred.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125832835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457862
H. Almasaeid, A. Kamal
Empowered by the cognitive radio technology and motivated by the sporadic channel utilization, both spatially and temporally, dynamic spectrum access networks, also referred to as cognitive radio networks, have emerged as a solution to improve spectrum utilization and provide more flexibility to wireless communication. In this paper, we study the channel allocation problem in wireless cognitive mesh networks. For the allocation to be feasible, served mesh clients must establish connectivity with a backbone network in both the upstream and the downstream directions, and must have the SINR (signal-to-interference and noise-ratio) of the uplink and the downlink with their parent mesh routers within a predetermined threshold. We propose a receiver-based channel allocation strategy and show that this strategy outperforms other strategies in terms of the number of mesh clients served, and the fact that no common control channel is needed for coordinating the communication process. Furthermore, we formulate the receiver-based channel allocation problem in wireless cognitive mesh network as a mixed integer linear program (MILP) and propose a heuristic solution.
{"title":"Receiver-Based Channel Allocation for Wireless Cognitive Radio Mesh Networks","authors":"H. Almasaeid, A. Kamal","doi":"10.1109/DYSPAN.2010.5457862","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457862","url":null,"abstract":"Empowered by the cognitive radio technology and motivated by the sporadic channel utilization, both spatially and temporally, dynamic spectrum access networks, also referred to as cognitive radio networks, have emerged as a solution to improve spectrum utilization and provide more flexibility to wireless communication. In this paper, we study the channel allocation problem in wireless cognitive mesh networks. For the allocation to be feasible, served mesh clients must establish connectivity with a backbone network in both the upstream and the downstream directions, and must have the SINR (signal-to-interference and noise-ratio) of the uplink and the downlink with their parent mesh routers within a predetermined threshold. We propose a receiver-based channel allocation strategy and show that this strategy outperforms other strategies in terms of the number of mesh clients served, and the fact that no common control channel is needed for coordinating the communication process. Furthermore, we formulate the receiver-based channel allocation problem in wireless cognitive mesh network as a mixed integer linear program (MILP) and propose a heuristic solution.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114698049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457911
K. Woyach, Padmini Pyapali, A. Sahai
The current approach to regulate spectrum sensing seems light-handed (just specify the target sensitivity), but has very heavy-handed consequences. The problem is that sensitivity is an intermediate metric that is convenient for certification, but is not reflecting the true externalities imposed by inadequate sensing. This mismatch causes overhead: usually an overinvestment in sensing at the single-radio level and the inability to exploit synergies across multiple radios because the benefit does not show up in the certification metric of sensitivity. Light-handed approaches have the benefit of allowing such flexibility but come with their own overheads. This paper explores this question in some detail to see if criminal-law inspired light-handed approaches can work without imposing more overhead than it is worth.
{"title":"Can We Incentivize Sensing in a Light-Handed Way?","authors":"K. Woyach, Padmini Pyapali, A. Sahai","doi":"10.1109/DYSPAN.2010.5457911","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457911","url":null,"abstract":"The current approach to regulate spectrum sensing seems light-handed (just specify the target sensitivity), but has very heavy-handed consequences. The problem is that sensitivity is an intermediate metric that is convenient for certification, but is not reflecting the true externalities imposed by inadequate sensing. This mismatch causes overhead: usually an overinvestment in sensing at the single-radio level and the inability to exploit synergies across multiple radios because the benefit does not show up in the certification metric of sensitivity. Light-handed approaches have the benefit of allowing such flexibility but come with their own overheads. This paper explores this question in some detail to see if criminal-law inspired light-handed approaches can work without imposing more overhead than it is worth.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131116218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457879
Alexander W. Min, K. Shin
In cognitive radio networks (CRNs), the design of an optimal spectrum sensing scheme is an important problem that has recently been drawing consideration attention. Various sensing-related performance tradeoffs have been studied as an efficient means to maximize the secondary network performance. Despite its importance, however, the sensing-access tradeoff--between sensing overhead and the MAC-layer contention among secondary users in accessing the thus-discovered spectrum opportunities--has not yet been accounted for. In this paper, we show that the secondary network throughput can be improved significantly by incorporating the sensing-access tradeoff in the design of spectrum sensing. We first introduce a new concept of (alpha,beta)-contention spectrum sharing and analyze the sensing requirement to meet a certain channel contention constraint by using the improper list-coloring in graph theory. Specifically, we derive the relationship among the sensing requirements, the secondary network density, and the transmission power of secondary users. To maximize the network throughput, we propose a distributed spectrum-sharing algorithm, called SmartShare, which exploits channel contention and heterogeneous channel conditions to maximize the secondary network throughput. We also describe how to realize SmartShare in an 802.11 MAC protocol for its practical use and evaluation. Our simulation-based evaluation shows that, sensing an optimal number of channels for given network density can improve the achievable throughput of SmartShare by up to 60% over a single-channel sensing strategy.
{"title":"On Sensing-Access Tradeoff in Cognitive Radio Networks","authors":"Alexander W. Min, K. Shin","doi":"10.1109/DYSPAN.2010.5457879","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457879","url":null,"abstract":"In cognitive radio networks (CRNs), the design of an optimal spectrum sensing scheme is an important problem that has recently been drawing consideration attention. Various sensing-related performance tradeoffs have been studied as an efficient means to maximize the secondary network performance. Despite its importance, however, the sensing-access tradeoff--between sensing overhead and the MAC-layer contention among secondary users in accessing the thus-discovered spectrum opportunities--has not yet been accounted for. In this paper, we show that the secondary network throughput can be improved significantly by incorporating the sensing-access tradeoff in the design of spectrum sensing. We first introduce a new concept of (alpha,beta)-contention spectrum sharing and analyze the sensing requirement to meet a certain channel contention constraint by using the improper list-coloring in graph theory. Specifically, we derive the relationship among the sensing requirements, the secondary network density, and the transmission power of secondary users. To maximize the network throughput, we propose a distributed spectrum-sharing algorithm, called SmartShare, which exploits channel contention and heterogeneous channel conditions to maximize the secondary network throughput. We also describe how to realize SmartShare in an 802.11 MAC protocol for its practical use and evaluation. Our simulation-based evaluation shows that, sensing an optimal number of channels for given network density can improve the achievable throughput of SmartShare by up to 60% over a single-channel sensing strategy.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130295407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：