{"title":"A versatile multichannel filter bank with multiple channel bandwidths","authors":"F. Harris, R. McGwier, Benjamin Egg","doi":"10.4108/ICST.CROWNCOM2010.9238","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM2010.9238","url":null,"abstract":"The FFT is an important core to which we couple an M-path partitioned filter and commutator to build high performance spectrum analyzers and channelized transmitters and receivers. With slight modifications of the system the channelizer and spectrum analyzer can perform secondary processing tasks such as arbitrary sample rate changes. Output sample rates can be adjusted to be a multiple of channel spacing or a multiple of the channel symbol rate. With minor additional processing the channelizer can also coherently combine signals from adjacent frequency bands to synthesize arbitrary bandwidth super channels from standard prototype channels.","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127504737","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}
{"title":"Dynamic primary-secondary spectrum sharing with cellular systems","authors":"Rathapon Saruthirathanaworakun, J. Peha","doi":"10.4108/ICST.CROWNCOM2010.9256","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM2010.9256","url":null,"abstract":"This paper considers primary-secondary spectrum sharing when the primary is a cellular system. Sharing is allowed if primary communications can withstand additional interference, rather than if there are no primary communications. We consider cases when primary and secondary systems cooperate (cooperative sharing) and when they do not (coexistent sharing). For coexistent sharing, we have devised novel mechanisms that allow secondaries to determine whether they can transmit and at what power without causing harmful interference to the primary by querying a sensor network rather than communicating with the primary system. A sensor network observes a primary's downstream communications to estimate upstream communications, and thus when additional interference would be tolerable. We show that even in highly utilized spectrum like a cellular band, a significant amount of communications among secondaries is possible. Moreover, if primary power consumption is a consideration, coexistent sharing is roughly as effective as cooperative sharing.","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127945778","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}
{"title":"Analysis and implementation of reinforcement learning on a GNU Radio cognitive radio platform","authors":"Yu Ren, P. Dmochowski, P. Komisarczuk","doi":"10.4108/ICST.CROWNCOM2010.9170","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM2010.9170","url":null,"abstract":"We present a physical cognitive radio system implementation under the GNU Radio platform with the aim of evaluating a reinforcement learning spectrum management scheme. In our experiments we examine the packet transmission success rate of the cognitive user for a variety of channel utilisation parameters. We derive analytical expressions using Markov chain analysis for the learning convergence time and secondary user packet transmission success rate in the general case of large-scale networks. Our results show that the reinforcement learning scheme significantly improves system performance.","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129671575","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}
{"title":"A Local Cognitive Pilot Channel (LCPC) for neighbourhood discovery, relaying and cluster based local cognitive information management","authors":"M. Muck, A. Hayar","doi":"10.4108/ICST.CROWNCOM2010.9245","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM2010.9245","url":null,"abstract":"This paper proposes a novel conceptual wireless communication framework in which Mobile Devices (MDs) are cooperating within geographically localized clusters. A Local Cognitive Pilot Channel (LCPC) is introduced for exchanging context information between such neighbouring MDs and for performing neighbourhood detection; the cluster size is hereby gradually adapted by incremental change of transmission power levels. The neighbourhood detection guarantees that the MDs are aware about the presence of neighbouring peers, followed by a corresponding exchange of context information, distribution of sensing tasks and negotiation of MDs serving as relay nodes; the distributed detection approach furthermore ensures that realtime constraints, as they occur in the presence of mobile MDs for example, are met. It will be shown that such a wireless framework can be deployed using a minimum of infrastructure equipment and is thus in particular useful for an early-phase deployment of a novel technology and/or for cost-reduction due to the minimization of the investment in network-equipment (CAPEX / OPEX reduction).","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124052736","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}
{"title":"Binary is good: A binary inference framework for primary user separation in cognitive radio networks","authors":"Huy Nguyen, Rong L. Zheng, Zhu Han","doi":"10.4108/ICST.CROWNCOM2010.9248","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM2010.9248","url":null,"abstract":"Primary users (PU) separation concerns with the issues of distinguishing and characterizing primary users in cognitive radio (CR) networks. We argue the need for PU separation in the context of collaborative spectrum sensing and monitor selection. In this paper, we model the observations of monitors as boolean OR mixtures of underlying binary latency sources for PUs, and devise a novel binary inference algorithm for PU separation. Simulation results show that without prior knowledge regarding PUs activities, the algorithm achieves high inference accuracy. An interesting implication of the proposed algorithm is the ability to represent n independent binary sources via (correlated) binary vectors of logarithmic length.","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126250532","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}
J. Barhen, Charlotte Kotas, T. Humble, P. Mitra, N. Imam, M. Buckner, M. R. Moore
{"title":"High performance FFT on multicore processors","authors":"J. Barhen, Charlotte Kotas, T. Humble, P. Mitra, N. Imam, M. Buckner, M. R. Moore","doi":"10.4108/ICST.CROWNCOM2010.9283","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM2010.9283","url":null,"abstract":"Importance of achieving high performance Fourier transforms for Cognitive Radio applications can not be over-emphasized. This includes signal detection in the presence of noise power uncertainty, multi-resolution spectrum sensing, minimization of subcarriers' side lobes in OFDM modulators, multi-stream processing, or spectrum loading, for example. With the emergence of advanced multicore processors, there is a remarkable opportunity to develop novel, massively parallel implementations of the FFT. This paper reviews recent advances in the area, and presents results for three classes of devices: the IBM Cell multi-SIMD processor, the Nvidia Tesla SIMT processor, and the EnLight digital optical core device.","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"1104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133843167","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}
M. Tercero, P. Gonzalez-Sanchez, Ömer Ileri, J. Zander
{"title":"Distributed spectrum access with energy constraint for heterogeneous channels","authors":"M. Tercero, P. Gonzalez-Sanchez, Ömer Ileri, J. Zander","doi":"10.4108/ICST.CROWNCOM2010.9242","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM2010.9242","url":null,"abstract":"The demand for wireless communications services has increased the amount of spectrum resources required, promoting research interest in dynamic spectrum allocation schemes. There exist many promising solutions to allocate spectrum on a dynamic basis in order to get an efficient spectrum usage. One particular form is auction mechanism, tailored for allocating transmission rights on a short term basis to provide efficient allocation of scarce resources. However, most existing approaches are focused on homogeneous settings where all channels are treated as if they have the same propagation characteristics. In this work we consider two distributed auction schemes; sequential and concurrent, based on sequential ascending and combinatorial bidding, respectively, taking into account the propagation conditions of the channels (heterogeneous settings). The performance of these schemes is compared to two reference cases: (i) distributed homogeneous channels allocation (channel-agnostic case), and (ii) the centralized allocation scheme. Experimental results suggest that auction mechanisms which take into account the channel characteristics improve spectrum utilization under energy constraint. For wireless cellular networks with high unit energy cost (low coverage) concurrent access gives a better utilization of the spectrum and energy resources with higher service providers utility.","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114869726","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}
{"title":"Multiple description source coding for cognitive radio systems","authors":"Husheng Li","doi":"10.4108/ICST.CROWNCOM2010.9108","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM2010.9108","url":null,"abstract":"Multiple description coding (MDC) is applied for delay-sensitive data traffic to alleviate interruptions caused by primary users in cognitive radio systems. For Gaussian source, a simplified algorithm for the exhaustive search of optimal distortions and rates is proposed based on the achievable region of coding rates and delay requirement. For practical realtime image coding, source splitting is applied to generate multiple descriptions. When there is a single channel, two successive descriptions are composed of large and small coefficients in discrete cosine transform (DCT) domain, respectively. When there are two channels, even and odd coefficients in DCT domain are used to construct two parallel descriptions. Numerical results show that MDC can effectively combat the interruptions caused by primary users in cognitive radio systems.","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115355416","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}
{"title":"Beamforming in underlay cognitive radio: Null-shaping constraints and greedy user selection","authors":"Eduard Axel Jorswieck, R. Mochaourab","doi":"10.4108/ICST.CROWNCOM2010.9206","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM2010.9206","url":null,"abstract":"In a multiuser cognitive radio setting, multiple secondary systems coexist with multiple primary systems. We assume the secondary systems consist of transmitter-receiver pairs, and each transmitter is equipped with multiple antennas while all receivers use a single antenna. In this setting, the secondary transmitters are to operate under the constraints of producing no interference at the primary users. Such constraints on the secondary systems are referred to as null-shaping constraints. Three results are derived in this work. First, the Pareto optimal operation points for the secondary systems under null-shaping constraints are characterized by real-valued parametrization of the transmission strategies. Second, we show that all points on the Pareto boundary of the secondary systems achievable rate region without interference constraints can be achieved as the outcome of a noncooperative game by imposing certain virtual null-shaping constraints. Third, motivated by the surprising result that all Pareto efficient points can be achieved as a Nash equilibrium, we consider the problem of selecting a subset of the noncooperative secondary users for operation under the objective of maximizing their achievable sum rate. A low complexity suboptimal greedy secondary user selection algorithm is proposed and its performance is illustrated by simulations.","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115538374","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}
{"title":"On the capacity of Slotted Aloha based multi-hop Virtual MIMO systems","authors":"C. Buratti, A. Zanella, R. Verdone","doi":"10.4108/ICST.CROWNCOM2010.9205","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM2010.9205","url":null,"abstract":"The performance of multi-hop Virtual Multiple-Input-Multiple-Output (V-MIMO) systems, when Slotted Aloha is used to select the radio resource at each hop, is investigated. Source, destination and relaying nodes, cooperate with neighboring devices (distributed according to a Poisson Point Process) to exploit spatial diversity by means of the concept of Virtual Antenna Array (VAA). Performance is evaluated in terms of outage probability, defined as the probability that the capacity between source and destination is smaller than a given threshold. It is computed as a function of the density of cooperating nodes, and the number of relaying VAAs. It is shown that depending on the level of required capacity, the optimum number of slots per frame in the slotted structure may differ. The performance degradation with Slotted Aloha with respect to a deterministic centralised re-use of radio resources, is assessed.","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134367467","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}