Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457843
D. Teo, Kun Zhong, B. Ng
In this paper, we propose a novel threshold selection scheme for OR-rule based spectrum sensing with energy detection. Unlike previous works on OR-rule cooperative sensing where a common threshold is used for all secondary users (SU) under the assumption that they have identical average SNR and noise power, the new threshold selection scheme is studied under the more general framework of possibly different average SNR and different noise power level at each SU. This iterative threshold selection scheme significantly outperforms the common-threshold approach in terms of the total probability of erroneous decisions, when the noise power at each SU differs by even just a few dBs (which is most likely the case for any practical radio system). On the other hand, even when all the SUs have identical average noise power and SNR, the new scheme is able to deliver similar performance compared to schemes using a common detection threshold. This iterative scheme is also shown to have fairly low implementation complexity.
{"title":"An Iterative Threshold Selection Algorithm for Cooperative Sensing in a Cognitive Radio Network","authors":"D. Teo, Kun Zhong, B. Ng","doi":"10.1109/DYSPAN.2010.5457843","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457843","url":null,"abstract":"In this paper, we propose a novel threshold selection scheme for OR-rule based spectrum sensing with energy detection. Unlike previous works on OR-rule cooperative sensing where a common threshold is used for all secondary users (SU) under the assumption that they have identical average SNR and noise power, the new threshold selection scheme is studied under the more general framework of possibly different average SNR and different noise power level at each SU. This iterative threshold selection scheme significantly outperforms the common-threshold approach in terms of the total probability of erroneous decisions, when the noise power at each SU differs by even just a few dBs (which is most likely the case for any practical radio system). On the other hand, even when all the SUs have identical average noise power and SNR, the new scheme is able to deliver similar performance compared to schemes using a common detection threshold. This iterative scheme is also shown to have fairly low implementation complexity.","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":"122807470","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.5457877
Jihoon Park, P. Pawełczak, D. Cabric
We present an analytical framework to assess the effectiveness of different combinations of medium access control (MAC) protocols for multichannel opportunistic spectrum access (OSA) ad hoc networks. As a performance metric we focus on average link layer throughput, and investigate dedicated control channel (DCC) and hopping control channel (HCC) MAC protocol abstractions. For DCC and HCC protocol classes we analyze two distinct strategies of managing active secondary user (SU) connection on the event of primary user (PU) arrival: to buffer the connection until PU leaves, or to switch the existing SU connection to a vacant channel. We come to an interesting conclusion: while, intuitively, OSA MAC protocols that support both SU connection buffering and SU connection switching should obtain the highest throughput, due to the channel switching overhead SU connection buffering alone performs better than the rest of the protocol combinations considered.
{"title":"To Buffer or to Switch: Design of Multichannel MAC for OSA Ad Hoc Networks","authors":"Jihoon Park, P. Pawełczak, D. Cabric","doi":"10.1109/DYSPAN.2010.5457877","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457877","url":null,"abstract":"We present an analytical framework to assess the effectiveness of different combinations of medium access control (MAC) protocols for multichannel opportunistic spectrum access (OSA) ad hoc networks. As a performance metric we focus on average link layer throughput, and investigate dedicated control channel (DCC) and hopping control channel (HCC) MAC protocol abstractions. For DCC and HCC protocol classes we analyze two distinct strategies of managing active secondary user (SU) connection on the event of primary user (PU) arrival: to buffer the connection until PU leaves, or to switch the existing SU connection to a vacant channel. We come to an interesting conclusion: while, intuitively, OSA MAC protocols that support both SU connection buffering and SU connection switching should obtain the highest throughput, due to the channel switching overhead SU connection buffering alone performs better than the rest of the protocol combinations considered.","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":"116736379","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.5457922
V. Atanasovski, D. Denkovski, T. Farnham, L. Gavrilovska, A. Gefflaut, V. Kolář, P. Mahonen, E. Meshkova, B. Motz, J. Nasreddine, V. Pavlovska, M. Petrova, S. Quadri, K. Rerkrai, M. Sooriyabandara, A. Steinmetzler, Z. Wang
Cognitive Radios have emerged as one the most promising methods to increase wireless system efficiency through dynamic spectrum access combined with other cross-layer optimization methods. Most of the research prototypes and demonstrations have so far focused on either general platforms or scenarios that are predominantly taken from military or emergency communications domain. In this demonstration we show the prototype environment that is build around realistic home networking scenarios. The demonstration has two purposes. First, it demonstrates how a set of different implemented and integrated components can achieve local area optimization both in frequency allocation and other domains. Second, it shows the viability and attractiveness of cognitive radio methods for future commercial home networking devices. The demonstration showcases dynamic spectrum allocation and policy based behavioral changes in a home environment, where several multimedia stream and data communication connections are competing against each other.
{"title":"Cognitive Radio for Home Networking","authors":"V. Atanasovski, D. Denkovski, T. Farnham, L. Gavrilovska, A. Gefflaut, V. Kolář, P. Mahonen, E. Meshkova, B. Motz, J. Nasreddine, V. Pavlovska, M. Petrova, S. Quadri, K. Rerkrai, M. Sooriyabandara, A. Steinmetzler, Z. Wang","doi":"10.1109/DYSPAN.2010.5457922","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457922","url":null,"abstract":"Cognitive Radios have emerged as one the most promising methods to increase wireless system efficiency through dynamic spectrum access combined with other cross-layer optimization methods. Most of the research prototypes and demonstrations have so far focused on either general platforms or scenarios that are predominantly taken from military or emergency communications domain. In this demonstration we show the prototype environment that is build around realistic home networking scenarios. The demonstration has two purposes. First, it demonstrates how a set of different implemented and integrated components can achieve local area optimization both in frequency allocation and other domains. Second, it shows the viability and attractiveness of cognitive radio methods for future commercial home networking devices. The demonstration showcases dynamic spectrum allocation and policy based behavioral changes in a home environment, where several multimedia stream and data communication connections are competing against each other.","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":"116818854","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.5457830
A. Gad, F. Digham
NA
{"title":"DSA: The Path Forward","authors":"A. Gad, F. Digham","doi":"10.1109/DYSPAN.2010.5457830","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457830","url":null,"abstract":"NA","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":"124178468","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.5457889
L. Cao, Lei Yang, Haitao Zheng
Designed to adapt spectrum usage on-the-fly, frequency-agile radios can drastically improve performance of wireless networks. Such flexibility, however, comes with a cost of increased hardware complexity. This motivates us to understand when and why having higher degree of frequency-agility helps and how much improvement it can lead to. In this paper, we approach this question by comparing two types of agile radios in the context of dynamic spectrum sharing in any given spectrum chunk. We consider 1-agile radios that use a single frequency channel but can adjust the channel's width and central frequency, and k-agile radios that can combine up to k non-contiguously aligned frequency segments into one transmission. We show that, due to inherent demand dynamics and conflict heterogeneity, networks using 1-agile radios often face the problem of spectrum fragmentation. But k-agile radios can effectively suppress this problem directly at the physical layer. Using theoretical analysis and simulation experiments, we quantify the advantage of k- agile radios over 1-agile radios in their network spectrum usage. For a fair comparison, we abstract the impact of demand and topology configurations by evaluating the worst case and average case performance. Our results show that in worst cases, the improvement of using fully-agile radios is arbitrarily large, although the improvement of using k-agile radios is upper bounded by k. In average cases, the improvement reduces to 10-40% under typical network configurations. Interestingly, in the context of dynamic spectrum sharing, 2-agile radios realize the majority of the improvement brought by fully-agile radios.
{"title":"The Impact of Frequency-Agility on Dynamic Spectrum Sharing","authors":"L. Cao, Lei Yang, Haitao Zheng","doi":"10.1109/DYSPAN.2010.5457889","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457889","url":null,"abstract":"Designed to adapt spectrum usage on-the-fly, frequency-agile radios can drastically improve performance of wireless networks. Such flexibility, however, comes with a cost of increased hardware complexity. This motivates us to understand when and why having higher degree of frequency-agility helps and how much improvement it can lead to. In this paper, we approach this question by comparing two types of agile radios in the context of dynamic spectrum sharing in any given spectrum chunk. We consider 1-agile radios that use a single frequency channel but can adjust the channel's width and central frequency, and k-agile radios that can combine up to k non-contiguously aligned frequency segments into one transmission. We show that, due to inherent demand dynamics and conflict heterogeneity, networks using 1-agile radios often face the problem of spectrum fragmentation. But k-agile radios can effectively suppress this problem directly at the physical layer. Using theoretical analysis and simulation experiments, we quantify the advantage of k- agile radios over 1-agile radios in their network spectrum usage. For a fair comparison, we abstract the impact of demand and topology configurations by evaluating the worst case and average case performance. Our results show that in worst cases, the improvement of using fully-agile radios is arbitrarily large, although the improvement of using k-agile radios is upper bounded by k. In average cases, the improvement reduces to 10-40% under typical network configurations. Interestingly, in the context of dynamic spectrum sharing, 2-agile radios realize the majority of the improvement brought by fully-agile radios.","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":"121220795","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.5457865
Jari Nieminen, R. Jantti, Lijun Qian
In this paper we study energy detection for primary user signals in the case of distributed Cognitive Radio (CR) networks. We concentrate on the effects of interference caused by other CR users due to timing misalignments and propose a novel mathematical model for calculating the effects of interfering nodes on energy detection and derive closed-form solutions for the probabilities of detection and false alarm. We verify our model by simulations and show that the impact of interference is severe in the presence of timing errors in distributed CR networks. To the best of authors' knowledge, the problem of inaccurate timing has not been investigated before. However, as we show in this paper, without interference cancellation or precise synchronization, timing errors will degrade sensing performance heavily in decentralized secondary networks and the throughput of CR networks will be significantly lower as well. The results obtained in this work can be used to guide the design and performance analysis of energy-based detection in distributed CR networks when accurate time synchronization is not available.
{"title":"Primary User Detection in Distributed Cognitive Radio Networks under Timing Inaccuracy","authors":"Jari Nieminen, R. Jantti, Lijun Qian","doi":"10.1109/DYSPAN.2010.5457865","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457865","url":null,"abstract":"In this paper we study energy detection for primary user signals in the case of distributed Cognitive Radio (CR) networks. We concentrate on the effects of interference caused by other CR users due to timing misalignments and propose a novel mathematical model for calculating the effects of interfering nodes on energy detection and derive closed-form solutions for the probabilities of detection and false alarm. We verify our model by simulations and show that the impact of interference is severe in the presence of timing errors in distributed CR networks. To the best of authors' knowledge, the problem of inaccurate timing has not been investigated before. However, as we show in this paper, without interference cancellation or precise synchronization, timing errors will degrade sensing performance heavily in decentralized secondary networks and the throughput of CR networks will be significantly lower as well. The results obtained in this work can be used to guide the design and performance analysis of energy-based detection in distributed CR networks when accurate time synchronization is not available.","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":"130006668","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.5457837
M. Sooriyabandara, T. Farnham
In this paper, we consider the problem that despite considerable Cognitive Radio (CR) research over the last decade and standardization efforts in DySPAN related topics in recent times, thus far, the commercial realisation of autonomous and intelligent networks has not been fulfilled. This is partly because of the complexity of deploying learning algorithms and protocol solutions that satisfy the conflicting stakeholder interests that have implications on existing business models and practices. In this paper we consider the proposition that the success of wider commercial deployment of CR network solutions will benefit significantly by the availability of an open and standard API mechanism that enable stakeholder interoperability, leading to new and innovative business models. The Cognitive Resource Management (CRM) architecture, which has recently been defined by the EU ARAGORN research project, is used as the basis for this approach. A brief analysis of telecom business models is used to understand the relative merits. We conclude that a standard set of generic interfaces can enables seamless cooperation across stakeholder and protocols boundaries to facilitate an evolutionary path for telecom business models through emergence of CR devices of different capabilities providing a great opportunity for product differentiation and optimization.
{"title":"Reconciling Technical Ambitions and Business Realities of Cognitive Radio: Standardising Generic Interfaces for Cognitive Radio Reconfiguration","authors":"M. Sooriyabandara, T. Farnham","doi":"10.1109/DYSPAN.2010.5457837","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457837","url":null,"abstract":"In this paper, we consider the problem that despite considerable Cognitive Radio (CR) research over the last decade and standardization efforts in DySPAN related topics in recent times, thus far, the commercial realisation of autonomous and intelligent networks has not been fulfilled. This is partly because of the complexity of deploying learning algorithms and protocol solutions that satisfy the conflicting stakeholder interests that have implications on existing business models and practices. In this paper we consider the proposition that the success of wider commercial deployment of CR network solutions will benefit significantly by the availability of an open and standard API mechanism that enable stakeholder interoperability, leading to new and innovative business models. The Cognitive Resource Management (CRM) architecture, which has recently been defined by the EU ARAGORN research project, is used as the basis for this approach. A brief analysis of telecom business models is used to understand the relative merits. We conclude that a standard set of generic interfaces can enables seamless cooperation across stakeholder and protocols boundaries to facilitate an evolutionary path for telecom business models through emergence of CR devices of different capabilities providing a great opportunity for product differentiation and optimization.","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":"134390747","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.5457863
J. Nasreddine, J. Riihijarvi, P. Mahonen
In this paper we propose a heuristic algorithm that exploits additional information that can be in general known by a secondary network willing to opportunistically access the spectrum allocated to a primary network. The algorithm aims at finding the maximum allowed transmission power with which a secondary node can transmit while respecting primary constraints. It is designed to be used in the presence of multiple primary transmitters with known positions but without information about their activity patterns. The estimation of the allowed transmission power is derived using a semi-analytical model characterizing interference probability. The latter is defined as the probability that the interference generated by the secondary node to any of the users in a primary cell exceeds a fixed threshold. The main idea is to autonomously determine a detection threshold based on the relative position of the secondary node towards base stations. Simulation results in a simple scenario are analyzed in order to explain the behavior of the algorithm. In addition, more results are introduced to evaluate the performance of the algorithm in more realistic scenarios.
{"title":"Location-Based Adaptive Detection Threshold for Dynamic Spectrum Access","authors":"J. Nasreddine, J. Riihijarvi, P. Mahonen","doi":"10.1109/DYSPAN.2010.5457863","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457863","url":null,"abstract":"In this paper we propose a heuristic algorithm that exploits additional information that can be in general known by a secondary network willing to opportunistically access the spectrum allocated to a primary network. The algorithm aims at finding the maximum allowed transmission power with which a secondary node can transmit while respecting primary constraints. It is designed to be used in the presence of multiple primary transmitters with known positions but without information about their activity patterns. The estimation of the allowed transmission power is derived using a semi-analytical model characterizing interference probability. The latter is defined as the probability that the interference generated by the secondary node to any of the users in a primary cell exceeds a fixed threshold. The main idea is to autonomously determine a detection threshold based on the relative position of the secondary node towards base stations. Simulation results in a simple scenario are analyzed in order to explain the behavior of the algorithm. In addition, more results are introduced to evaluate the performance of the algorithm in more realistic scenarios.","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":"128941086","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.5457835
L. Doyle, P. Sutton, K. Nolan, Jörg Lotze, Baris Ozgul, T. Rondeau, Suhaib A. Fahmy, Hicham Lahlou, L. Dasilva
Abstract-The focus of this paper is an experimentation platform known as Iris that has a runtime reconfigurable software radio at its core. We have employed this platform to enable a wide variety of tests and experimentation in the fields of dynamic spectrum access and cognitive radio. The paper charts the progress of the Iris system since its inception as well as details of some of the experiments and trials conducted using this platform. We also discuss the challenges involved in the development and deployment of a software radio platform that supports runtime reconfigurability and provide recommendations for future improvements.
{"title":"Experiences from the Iris Testbed in Dynamic Spectrum Access and Cognitive Radio Experimentation","authors":"L. Doyle, P. Sutton, K. Nolan, Jörg Lotze, Baris Ozgul, T. Rondeau, Suhaib A. Fahmy, Hicham Lahlou, L. Dasilva","doi":"10.1109/DYSPAN.2010.5457835","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457835","url":null,"abstract":"Abstract-The focus of this paper is an experimentation platform known as Iris that has a runtime reconfigurable software radio at its core. We have employed this platform to enable a wide variety of tests and experimentation in the fields of dynamic spectrum access and cognitive radio. The paper charts the progress of the Iris system since its inception as well as details of some of the experiments and trials conducted using this platform. We also discuss the challenges involved in the development and deployment of a software radio platform that supports runtime reconfigurability and provide recommendations for future improvements.","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":"133384858","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.5457902
M. Nekovee
Cognitive radio is being intensively researched as the enabling technology for secondary access to the so-called TV White Spaces (TVWS), large portions of spectrum in theUHF/VHF bands which become available on a geographical basis after digital switchover. Both in the US, and more recently, in the UK the regulators have given conditional endorsement to this new mode of access. This paper reviews the state-of-the-art in technology, regulation and standardization of cognitive access to TVWS. It examines the spectrum opportunity and commercial use cases associated with this form of secondary access.
{"title":"Cognitive Radio Access to TV White Spaces: Spectrum Opportunities, Commercial Applications and Remaining Technology Challenges","authors":"M. Nekovee","doi":"10.1109/DYSPAN.2010.5457902","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457902","url":null,"abstract":"Cognitive radio is being intensively researched as the enabling technology for secondary access to the so-called TV White Spaces (TVWS), large portions of spectrum in theUHF/VHF bands which become available on a geographical basis after digital switchover. Both in the US, and more recently, in the UK the regulators have given conditional endorsement to this new mode of access. This paper reviews the state-of-the-art in technology, regulation and standardization of cognitive access to TVWS. It examines the spectrum opportunity and commercial use cases associated with this form of secondary access.","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":"133327630","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
扫码关注我们
求助内容：
应助结果提醒方式：