Pub Date : 2011-06-01DOI: 10.4108/ICST.CROWNCOM.2011.245884
Ioannis Glaropoulos, V. Fodor, L. Pescosolido, C. Petrioli
In this paper we design a cognitive access scheme for WSNs that coexist with WLANs, considering the problem of blind and hidden WLAN terminals. The cognitive access scheme relies on a-priory known WLAN idle time distribution functions and repeated channel measurements to optimize the size of the transmitted data unit and the transmission distance, such that the normalized transmission energy is minimized. We compare the proposed scheme with simple carrier sensing and random access solutions and show that the energy gain is significant under typical WLAN utilization values.
{"title":"Cognitive WSN transmission control for energy efficiency under WLAN coexistence","authors":"Ioannis Glaropoulos, V. Fodor, L. Pescosolido, C. Petrioli","doi":"10.4108/ICST.CROWNCOM.2011.245884","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2011.245884","url":null,"abstract":"In this paper we design a cognitive access scheme for WSNs that coexist with WLANs, considering the problem of blind and hidden WLAN terminals. The cognitive access scheme relies on a-priory known WLAN idle time distribution functions and repeated channel measurements to optimize the size of the transmitted data unit and the transmission distance, such that the normalized transmission energy is minimized. We compare the proposed scheme with simple carrier sensing and random access solutions and show that the energy gain is significant under typical WLAN utilization values.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123628915","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 : 2011-06-01DOI: 10.4108/ICST.CROWNCOM.2011.245838
I-Te Lin, I. Sasase
We propose a multihop cooperative routing (MCR) algorithm that extends the lengths of the x axis projections of the hop distances and finds the multihop route that minimizes the number of hops in spectrum sharing networks. The cognitive relay and the cognitive receiver of each hop except the last one are selected by the following procedures. First, the cognitive node that is nearest away from the cognitive sender is selected as the cognitive relay, and let the cognitive destination (CD) be the cognitive receiver. Then, if the participation of the selected cognitive relay can not satisfy the QoS requirement of the cognitive transmission, among the cognitive receiver candidates that satisfy the QoS requirement of the cognitive transmission, the one whose x coordinate has the largest difference from that of the cognitive relay is selected as the cognitive receiver. At the last hop, if the cognitive relay is available, the cooperative transmission is performed. Otherwise, the direct transmission is performed. Simulation results show that the MCR reduces the average number of hops compared to the FNR and outperforms the FNR in terms of the average end-to-end reliability, the average end-to-end throughput, and the average required transmission power.
{"title":"A multihop cooperative routing algorithm for minimizing the number of hops in spectrum sharing networks","authors":"I-Te Lin, I. Sasase","doi":"10.4108/ICST.CROWNCOM.2011.245838","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2011.245838","url":null,"abstract":"We propose a multihop cooperative routing (MCR) algorithm that extends the lengths of the x axis projections of the hop distances and finds the multihop route that minimizes the number of hops in spectrum sharing networks. The cognitive relay and the cognitive receiver of each hop except the last one are selected by the following procedures. First, the cognitive node that is nearest away from the cognitive sender is selected as the cognitive relay, and let the cognitive destination (CD) be the cognitive receiver. Then, if the participation of the selected cognitive relay can not satisfy the QoS requirement of the cognitive transmission, among the cognitive receiver candidates that satisfy the QoS requirement of the cognitive transmission, the one whose x coordinate has the largest difference from that of the cognitive relay is selected as the cognitive receiver. At the last hop, if the cognitive relay is available, the cooperative transmission is performed. Otherwise, the direct transmission is performed. Simulation results show that the MCR reduces the average number of hops compared to the FNR and outperforms the FNR in terms of the average end-to-end reliability, the average end-to-end throughput, and the average required transmission power.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122745245","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 : 2011-06-01DOI: 10.4108/ICST.CROWNCOM.2011.245751
Y. Nijsure, Yifan Chen, C. Yuen, Y. Chew
A novel approach to spectrum and power allocation is proposed for joint cognitive communication-radar networks, which aim at integrating cognitive radio (CR-o) and cognitive radar (CR-r) paradigms to achieve intelligent utilization of spectrum resources in wireless networks. This approach exploits the location information offered by CR-r combined with spectrum sensing capability of CR-o to aid spectrum and power allocation by minimizing harmful interference among neighboring devices. Such systems require both coexistence and sharing of perception of radio environment and radar scene. To offer better spectrum resource utilization, entropy of the received signal is employed in order to detect spectrum holes over the network topology. This entropy-based technique also demonstrates superior performance as compared to the conventional method based on energy detection. Simulation results indicate both throughput improvement and interference reduction among neighboring devices.
{"title":"Location-aware spectrum and power allocation in joint cognitive communication-radar networks","authors":"Y. Nijsure, Yifan Chen, C. Yuen, Y. Chew","doi":"10.4108/ICST.CROWNCOM.2011.245751","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2011.245751","url":null,"abstract":"A novel approach to spectrum and power allocation is proposed for joint cognitive communication-radar networks, which aim at integrating cognitive radio (CR-o) and cognitive radar (CR-r) paradigms to achieve intelligent utilization of spectrum resources in wireless networks. This approach exploits the location information offered by CR-r combined with spectrum sensing capability of CR-o to aid spectrum and power allocation by minimizing harmful interference among neighboring devices. Such systems require both coexistence and sharing of perception of radio environment and radar scene. To offer better spectrum resource utilization, entropy of the received signal is employed in order to detect spectrum holes over the network topology. This entropy-based technique also demonstrates superior performance as compared to the conventional method based on energy detection. Simulation results indicate both throughput improvement and interference reduction among neighboring devices.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130742105","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 : 2011-06-01DOI: 10.4108/ICST.CROWNCOM.2011.245909
F. Bouali, O. Sallent, J. Pérez-Romero, R. Agustí
In order to increase spectrum utilization efficiency, CRs (Cognitive Radios) have been introduced to reuse white spaces left unused by legacy services under the strict constraint of not interfering them. In order to fulfill this constraint while optimising spectrum utilisation, it is important to get knowledge about primary-user activity in order to devise proper strategies for secondary-user operation. In this context, this paper proposes to strengthen Radio Environment Maps (REM) with statistical patterns of primary systems that capture among others temporal dependence structures between activity (ON) and inactivity (OFF) periods. Convergence times for the different statistics are analysed. Then, a set of novel spectrum selection criteria exploiting these statistics are proposed and assessed to benchmark the usefulness of primary statistical patterns retained in the REM. Results show that significant performance gains can be achieved in terms of a reduction in the number of required spectrum hand-overs.
{"title":"Strengthening Radio Environment Maps with primary-user statistical patterns for enhancing cognitive radio operation","authors":"F. Bouali, O. Sallent, J. Pérez-Romero, R. Agustí","doi":"10.4108/ICST.CROWNCOM.2011.245909","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2011.245909","url":null,"abstract":"In order to increase spectrum utilization efficiency, CRs (Cognitive Radios) have been introduced to reuse white spaces left unused by legacy services under the strict constraint of not interfering them. In order to fulfill this constraint while optimising spectrum utilisation, it is important to get knowledge about primary-user activity in order to devise proper strategies for secondary-user operation. In this context, this paper proposes to strengthen Radio Environment Maps (REM) with statistical patterns of primary systems that capture among others temporal dependence structures between activity (ON) and inactivity (OFF) periods. Convergence times for the different statistics are analysed. Then, a set of novel spectrum selection criteria exploiting these statistics are proposed and assessed to benchmark the usefulness of primary statistical patterns retained in the REM. Results show that significant performance gains can be achieved in terms of a reduction in the number of required spectrum hand-overs.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131261607","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 : 2011-06-01DOI: 10.4108/ICST.CROWNCOM.2011.245886
Jing Wang, Peili Cai, Ping Zhang, Guixia Kang
In this paper we consider a cognitive radio (CR) communication system based on spectrum sharing schemes, where we have a secondary user (SU) link with multiple transmitting antennas and a single receiving antenna, coexisting with a primary user (PU) link with a single receiving antenna. At the SU transmitter (SU-Tx), the channel state information (CSI) of the SU link is assumed to be perfectly known; while the interference channel from the SU-Tx to the PU receiver (PU-Rx) is not perfectly known due to less cooperation between the SU and the PU. Considering a SU transmit power constraint, our design objective is to determine the transmit covariance matrix that maximizes the SU rate, while we protect the PU by enforcing both a PU average interference constraint and a PU outage probability constraint. This problem is formulated as a non-convex optimization problem with a non-explicit probabilistic constraint, which is then approximated as a mixed binary integer programming (MBIP) problem and solved with the Branch and Bound (BB) algorithm. The complexity of the BB algorithm is analyzed and numerical results are presented to show the performance of the CR system under consideration with our optimal solution.
{"title":"Spectrum sharing with interference coordination under outage probability constraint","authors":"Jing Wang, Peili Cai, Ping Zhang, Guixia Kang","doi":"10.4108/ICST.CROWNCOM.2011.245886","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2011.245886","url":null,"abstract":"In this paper we consider a cognitive radio (CR) communication system based on spectrum sharing schemes, where we have a secondary user (SU) link with multiple transmitting antennas and a single receiving antenna, coexisting with a primary user (PU) link with a single receiving antenna. At the SU transmitter (SU-Tx), the channel state information (CSI) of the SU link is assumed to be perfectly known; while the interference channel from the SU-Tx to the PU receiver (PU-Rx) is not perfectly known due to less cooperation between the SU and the PU. Considering a SU transmit power constraint, our design objective is to determine the transmit covariance matrix that maximizes the SU rate, while we protect the PU by enforcing both a PU average interference constraint and a PU outage probability constraint. This problem is formulated as a non-convex optimization problem with a non-explicit probabilistic constraint, which is then approximated as a mixed binary integer programming (MBIP) problem and solved with the Branch and Bound (BB) algorithm. The complexity of the BB algorithm is analyzed and numerical results are presented to show the performance of the CR system under consideration with our optimal solution.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114840715","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 : 2011-06-01DOI: 10.4108/ICST.CROWNCOM.2011.245879
Islam A. K. M. Muzahidul, S. Abdullah, K. Wada, Jiro Uchida, Wei Chen
This paper presents an efficient routing protocol on a Dynamic Cluster-based Wireless Sensor Network (WSN). The cluster-based architecture presented here is constructed dynamically. Unlike some previous routing protocol that finds the route on cluster-based architecture which is a spanning tree of graph G, our proposed protocol finds route on G. The cluster-based architecture is dynamic, thus it is self-constructible and reconfigurable and is facilitated by two topology management operations: node-move-in and node-move-out. For these two operations we also propose two algorithms: Node-Move-In and Node-Move-Out. We show that to establish a route on graph G using the architecture, it requires O(p) rounds, where p is the number of clusters in the network. In a scenario where the number of sensor nodes n is enormous, p is much less than n. Finally, our simulation results describe that the proposed routing protocol finds a better route with less length.
{"title":"An efficient routing protocol on a Dynamic Cluster-based Sensor Network","authors":"Islam A. K. M. Muzahidul, S. Abdullah, K. Wada, Jiro Uchida, Wei Chen","doi":"10.4108/ICST.CROWNCOM.2011.245879","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2011.245879","url":null,"abstract":"This paper presents an efficient routing protocol on a Dynamic Cluster-based Wireless Sensor Network (WSN). The cluster-based architecture presented here is constructed dynamically. Unlike some previous routing protocol that finds the route on cluster-based architecture which is a spanning tree of graph G, our proposed protocol finds route on G. The cluster-based architecture is dynamic, thus it is self-constructible and reconfigurable and is facilitated by two topology management operations: node-move-in and node-move-out. For these two operations we also propose two algorithms: Node-Move-In and Node-Move-Out. We show that to establish a route on graph G using the architecture, it requires O(p) rounds, where p is the number of clusters in the network. In a scenario where the number of sensor nodes n is enormous, p is much less than n. Finally, our simulation results describe that the proposed routing protocol finds a better route with less length.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114606655","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 : 2011-06-01DOI: 10.4108/ICST.CROWNCOM.2011.245877
Sami Kallioinen, Mikko Vääräkangas, P. Hui, J. Ollikainen, I. Teikari, A. Pärssinen, V. Turunen, M. Kosunen, J. Ryynänen
Localized spectrum sensing is an alternate for database centric approaches to solve secondary use of spectrum in cognitive radios. This can be carried out by using collaborative spectrum sensing where larger amount of small devices is utilized for local spectrum sensing. This paper describes an mobile device scale implementation of multi-mode, multi-band spectrum sensor for cognitive radio. Cyclostationary feature detector algorithm is utilized to detect digital television (DVB-T/H) on UHF band and IEEE802.11a/g on 2.4/5 GHz (ISM/WLAN) bands. A miniaturized spectrum sensing device encounters physical challenges; like limited size and battery capacity, but provides opportunities to establish a dense network and fast response to dynamic chances in signal conditions.
{"title":"Multi-mode, multi-band spectrum sensor for cognitive radios embedded to a mobile phone","authors":"Sami Kallioinen, Mikko Vääräkangas, P. Hui, J. Ollikainen, I. Teikari, A. Pärssinen, V. Turunen, M. Kosunen, J. Ryynänen","doi":"10.4108/ICST.CROWNCOM.2011.245877","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2011.245877","url":null,"abstract":"Localized spectrum sensing is an alternate for database centric approaches to solve secondary use of spectrum in cognitive radios. This can be carried out by using collaborative spectrum sensing where larger amount of small devices is utilized for local spectrum sensing. This paper describes an mobile device scale implementation of multi-mode, multi-band spectrum sensor for cognitive radio. Cyclostationary feature detector algorithm is utilized to detect digital television (DVB-T/H) on UHF band and IEEE802.11a/g on 2.4/5 GHz (ISM/WLAN) bands. A miniaturized spectrum sensing device encounters physical challenges; like limited size and battery capacity, but provides opportunities to establish a dense network and fast response to dynamic chances in signal conditions.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128521998","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 : 2011-06-01DOI: 10.4108/ICST.CROWNCOM.2011.246134
N. Alonistioti, E. Schulz, G. Koudouridis, S. Delaere, J. Declerk, M. Stamatelatos, M. Emmelmann, I. Chochliouros, M. Muck
The CONSERN project (COoperative aNd Self growing Energy awaRe Networks) develops the novel Self-Growing concept. It is part of the European Commission's FP7 research initiative focusing on the following two major research directions: i) Solutions for optimised energy and power consumption in a small scale, purpose-driven network through balancing autonomic and cooperative approaches and ii) mechanisms for the self-evolvement of the network towards a large-scale, multi-purpose network. This paper will detail mechanisms developed within CONSERN that allow an on-going integration of existing networks in an ever-growing, complex environment, applying continuous self-optimization mechanisms and guaranteeing a minimized level of power-consumption, resource usage efficiency.
{"title":"The self-growing concept — A novel framework developed by the FP7 CONSERN project","authors":"N. Alonistioti, E. Schulz, G. Koudouridis, S. Delaere, J. Declerk, M. Stamatelatos, M. Emmelmann, I. Chochliouros, M. Muck","doi":"10.4108/ICST.CROWNCOM.2011.246134","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2011.246134","url":null,"abstract":"The CONSERN project (COoperative aNd Self growing Energy awaRe Networks) develops the novel Self-Growing concept. It is part of the European Commission's FP7 research initiative focusing on the following two major research directions: i) Solutions for optimised energy and power consumption in a small scale, purpose-driven network through balancing autonomic and cooperative approaches and ii) mechanisms for the self-evolvement of the network towards a large-scale, multi-purpose network. This paper will detail mechanisms developed within CONSERN that allow an on-going integration of existing networks in an ever-growing, complex environment, applying continuous self-optimization mechanisms and guaranteeing a minimized level of power-consumption, resource usage efficiency.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133198485","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 : 2011-06-01DOI: 10.4108/ICST.CROWNCOM.2011.245807
Enxin Yao, Luxi Lu, Wei Jiang
Spectrum auctions can motivate the legacy (primary) spectrum owners to lease their idle spectrum to other secondary spectrum users and eventually improve the spectrum utilization. Compared with traditional auctions, a significant difference of spectrum auctions is the spatial reusability, which means several buyers can use the same channel if they are far away from each other such that they will not interfere with each other. The challenge is how to exploit spatial reusability to improve spectrum utilization while keeping the auctions economic-robust (truthful in particular). In this paper, we propose TDSA, an efficient truthful double spectrum auction design to solve this problem, which has a novel virtual group bidding mechanism to improve spectrum utilization as well as a unique pricing strategy to guarantee truthfulness. We prove that our proposal is truthful. Experimental results show that our proposal can efficiently exploit spatial reusability of spectrum to achieve high spectrum utilization in most cases.
{"title":"An efficient truthful double spectrum auction design for dynamic spectrum access","authors":"Enxin Yao, Luxi Lu, Wei Jiang","doi":"10.4108/ICST.CROWNCOM.2011.245807","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2011.245807","url":null,"abstract":"Spectrum auctions can motivate the legacy (primary) spectrum owners to lease their idle spectrum to other secondary spectrum users and eventually improve the spectrum utilization. Compared with traditional auctions, a significant difference of spectrum auctions is the spatial reusability, which means several buyers can use the same channel if they are far away from each other such that they will not interfere with each other. The challenge is how to exploit spatial reusability to improve spectrum utilization while keeping the auctions economic-robust (truthful in particular). In this paper, we propose TDSA, an efficient truthful double spectrum auction design to solve this problem, which has a novel virtual group bidding mechanism to improve spectrum utilization as well as a unique pricing strategy to guarantee truthfulness. We prove that our proposal is truthful. Experimental results show that our proposal can efficiently exploit spatial reusability of spectrum to achieve high spectrum utilization in most cases.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121939198","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 : 2011-06-01DOI: 10.4108/ICST.CROWNCOM.2011.245866
Chunyi Song, Mohammad Azizur Rahman, H. Harada
The regulations for operation in the TV white space (TVWS) have been developed and released in USA and UK It is believed that the ongoing TVWS related standardization projects, such as IEEE P802.19.1, IEEE P802.11af and IEEE P802.22, will encourage the regulation development in more countries and regions. Current regulations commonly require the TV band device (TVBD) or the sensing only TVBD to be capable of detecting incumbent TV signals of very low power level within a short time. To fulfill the strict requirements on both of sensitivity and sensing time while keeping the hardware implementation cost below a desired level, we propose two new sensing methods for DTV signals of DVB-T standard: the optimal one requires time synchronization and is therefore called The Proposed_Syn while the sub-optimal one requires no time synchronization and is called The Proposed_Asyn. Both computer simulation results and hardware testing results are shown in this paper. Simulation results show that for achieving a goal of high detection probability (≥90%) and low false alarm probability (≤1%) at a very low SNR (=−20dB) in AWGN channel, in comparison with conventional sensing methods, The Proposed_Syn reduces sensing time by 50% and both proposed methods can significantly reduce hardware implementation cost by potentially reducing multiplexer number more than 99%. Hardware sensing prototype testing results have further verified the improved performance by using the proposed sensing methods.
{"title":"New robust sensing methods for DVB-T signals","authors":"Chunyi Song, Mohammad Azizur Rahman, H. Harada","doi":"10.4108/ICST.CROWNCOM.2011.245866","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2011.245866","url":null,"abstract":"The regulations for operation in the TV white space (TVWS) have been developed and released in USA and UK It is believed that the ongoing TVWS related standardization projects, such as IEEE P802.19.1, IEEE P802.11af and IEEE P802.22, will encourage the regulation development in more countries and regions. Current regulations commonly require the TV band device (TVBD) or the sensing only TVBD to be capable of detecting incumbent TV signals of very low power level within a short time. To fulfill the strict requirements on both of sensitivity and sensing time while keeping the hardware implementation cost below a desired level, we propose two new sensing methods for DTV signals of DVB-T standard: the optimal one requires time synchronization and is therefore called The Proposed_Syn while the sub-optimal one requires no time synchronization and is called The Proposed_Asyn. Both computer simulation results and hardware testing results are shown in this paper. Simulation results show that for achieving a goal of high detection probability (≥90%) and low false alarm probability (≤1%) at a very low SNR (=−20dB) in AWGN channel, in comparison with conventional sensing methods, The Proposed_Syn reduces sensing time by 50% and both proposed methods can significantly reduce hardware implementation cost by potentially reducing multiplexer number more than 99%. Hardware sensing prototype testing results have further verified the improved performance by using the proposed sensing methods.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124676936","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
扫码关注我们
求助内容：
应助结果提醒方式：