Pub Date : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036910
Ye Wang, Xiaodong Lin
With the emergence of secondary spectrum markets, it is envisioned that multiple Primary Networks (PRNs) with non-overlapping spectrum pools will be incorporated into Cognitive Radio Networks (CRNs). As a result, CRNs will have a greatly enhanced choice of accessible spectrum resources available to them, which, in turn, brings a significant increase in the diversity of available PRNs; this can greatly increase reliability and stability in the system performance experienced by secondary users (SUs) on the network. However, due to the nature of dynamic network environments, it is hard to meet the requirements of sensing task when the sensing resources, such as the number of participating SUs and A/D sampling capability, are limited. In this paper, we address this issue by studying the problem of cooperative sensing scheduling of CRNs for a dynamic multi-PRN environment. By jointly considering the dynamics of spectrum usage, and the channel conditions of SUs, cooperative spectrum sensing scheduling is formulated as two optimization problems, from the perspectives of primary users (PUs) and SUs, respectively. To solve these problems, two straightforward scheduling schemes are discussed: Random Scheduling and SNR-based Greedy Scheduling. To further improve the sensing performance, a cross entropy (CE) method-based sensing scheduling scheme is proposed. At last, simulation results validate the effectiveness of the proposed CE-based sensing scheduling scheme.
{"title":"Cooperative sensing scheduling in Cognitive Radio Networks with multiple Primary Networks","authors":"Ye Wang, Xiaodong Lin","doi":"10.1109/GLOCOM.2014.7036910","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036910","url":null,"abstract":"With the emergence of secondary spectrum markets, it is envisioned that multiple Primary Networks (PRNs) with non-overlapping spectrum pools will be incorporated into Cognitive Radio Networks (CRNs). As a result, CRNs will have a greatly enhanced choice of accessible spectrum resources available to them, which, in turn, brings a significant increase in the diversity of available PRNs; this can greatly increase reliability and stability in the system performance experienced by secondary users (SUs) on the network. However, due to the nature of dynamic network environments, it is hard to meet the requirements of sensing task when the sensing resources, such as the number of participating SUs and A/D sampling capability, are limited. In this paper, we address this issue by studying the problem of cooperative sensing scheduling of CRNs for a dynamic multi-PRN environment. By jointly considering the dynamics of spectrum usage, and the channel conditions of SUs, cooperative spectrum sensing scheduling is formulated as two optimization problems, from the perspectives of primary users (PUs) and SUs, respectively. To solve these problems, two straightforward scheduling schemes are discussed: Random Scheduling and SNR-based Greedy Scheduling. To further improve the sensing performance, a cross entropy (CE) method-based sensing scheduling scheme is proposed. At last, simulation results validate the effectiveness of the proposed CE-based sensing scheduling scheme.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"16 1","pages":"822-827"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73120839","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037575
Yan Xin, Young-Han Nam, Y. Li, Jianzhong Zhang
Full-dimension multiple-input multiple-output (FD-MIMO) systems, in which base stations are equipped with a large number of antennas in a two-dimensional panel, has received considerable attention from academia researchers and industry practitioners. Compared with legacy cellular communication systems, FD-MIMO systems can achieve significantly higher spectral efficiency with high order multi-user MIMO (MU-MIMO) transmissions. However, as high-order MU-MIMO also incurs high precoding and scheduling complexity, it is critical to reduce complexity of these operations in order to realize throughput potential of FD-MIMO systems in practice. In this paper, we propose a reduced complexity algorithm to realize the high performance precoding technique, signal-to-leakage plus noise ratio (SLNR) precoding, and propose an efficient scheduling algorithm to enable high-order MU-MIMO transmissions in FD-MIMO systems. We further demonstrate the effectiveness of the proposed algorithms by using system level simulations.
{"title":"Reduced complexity precoding and scheduling algorithms for full-dimension MIMO systems","authors":"Yan Xin, Young-Han Nam, Y. Li, Jianzhong Zhang","doi":"10.1109/GLOCOM.2014.7037575","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037575","url":null,"abstract":"Full-dimension multiple-input multiple-output (FD-MIMO) systems, in which base stations are equipped with a large number of antennas in a two-dimensional panel, has received considerable attention from academia researchers and industry practitioners. Compared with legacy cellular communication systems, FD-MIMO systems can achieve significantly higher spectral efficiency with high order multi-user MIMO (MU-MIMO) transmissions. However, as high-order MU-MIMO also incurs high precoding and scheduling complexity, it is critical to reduce complexity of these operations in order to realize throughput potential of FD-MIMO systems in practice. In this paper, we propose a reduced complexity algorithm to realize the high performance precoding technique, signal-to-leakage plus noise ratio (SLNR) precoding, and propose an efficient scheduling algorithm to enable high-order MU-MIMO transmissions in FD-MIMO systems. We further demonstrate the effectiveness of the proposed algorithms by using system level simulations.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"152 1","pages":"4858-4863"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72693683","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037574
Shih-Fan Chou, Te-Chuan Chiu, Ya-Ju Yu, Ai-Chun Pang
With the rapid growth of mobile broadband traffic, adopting small cell is a promising trend for operators to improve network capacity with low cost. However, static small cells cannot be flexibly placed to fulfill time/space-varying traffic. The static small cells might stay in idle or under-utilized mode during some time periods, which wastes resources. Therefore, this paper utilizes the mobile small cell concept and studies the deployment problem for mobile small cells. The objective is to maximize the service time provided by mobile small cells for all users. If a finite number of mobile small cells can serve more users for more time, the mobile small cell deployment will have more gains. Specifically, we show an interesting trade-off in the service time maximization. Then, we prove our target problem is NP-hard and propose an efficient mobile small cell deployment algorithm to deal with the trade-off to maximize the total service time. We construct a series of simulations with realistic parameter settings to evaluate the performance of our proposed algorithm. Compared with a static small cell deployment algorithm and a random mobile small cell deployment algorithm, the simulation results show that our proposed scheme can significantly increase the total service time provided for all users.
{"title":"Mobile small cell deployment for next generation cellular networks","authors":"Shih-Fan Chou, Te-Chuan Chiu, Ya-Ju Yu, Ai-Chun Pang","doi":"10.1109/GLOCOM.2014.7037574","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037574","url":null,"abstract":"With the rapid growth of mobile broadband traffic, adopting small cell is a promising trend for operators to improve network capacity with low cost. However, static small cells cannot be flexibly placed to fulfill time/space-varying traffic. The static small cells might stay in idle or under-utilized mode during some time periods, which wastes resources. Therefore, this paper utilizes the mobile small cell concept and studies the deployment problem for mobile small cells. The objective is to maximize the service time provided by mobile small cells for all users. If a finite number of mobile small cells can serve more users for more time, the mobile small cell deployment will have more gains. Specifically, we show an interesting trade-off in the service time maximization. Then, we prove our target problem is NP-hard and propose an efficient mobile small cell deployment algorithm to deal with the trade-off to maximize the total service time. We construct a series of simulations with realistic parameter settings to evaluate the performance of our proposed algorithm. Compared with a static small cell deployment algorithm and a random mobile small cell deployment algorithm, the simulation results show that our proposed scheme can significantly increase the total service time provided for all users.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"26 1","pages":"4852-4857"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72775989","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036873
Zhigang Zhou, Hongli Zhang, Qiang Zhang, Yang Xu, Panpan Li
Storage as a service has become an important paradigm in cloud computing for its great flexibility and economic savings. Since data owners no longer physically possess the storage of their data, it also brings many new challenges for data security and management. Several techniques have been investigated, including encryption, as well as fine-grained access control for enabling such services. However, these techniques just expresses the "Yes or No" problem, that is, whether the user has permissions to access the corresponding data. In this paper, we investigate the issue of how to provide different granular information views for different users. Our mechanism first constructs the relationship between the keywords and data files based on a Galois connection. And then we exploit data retrieval indexes with variable threshold, where granular data retrieval service can be supported by adjusting the threshold for different users. Moreover, to prevent privacy disclosure, we propose a differentially privacy release scheme based on the proposed index technique. We prove the privacy-preserving guarantee of the proposed mechanism, and the extensive experiments further demonstrate the validity of the proposed mechanism.
{"title":"Privacy-preserving granular data retrieval indexes for outsourced cloud data","authors":"Zhigang Zhou, Hongli Zhang, Qiang Zhang, Yang Xu, Panpan Li","doi":"10.1109/GLOCOM.2014.7036873","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036873","url":null,"abstract":"Storage as a service has become an important paradigm in cloud computing for its great flexibility and economic savings. Since data owners no longer physically possess the storage of their data, it also brings many new challenges for data security and management. Several techniques have been investigated, including encryption, as well as fine-grained access control for enabling such services. However, these techniques just expresses the \"Yes or No\" problem, that is, whether the user has permissions to access the corresponding data. In this paper, we investigate the issue of how to provide different granular information views for different users. Our mechanism first constructs the relationship between the keywords and data files based on a Galois connection. And then we exploit data retrieval indexes with variable threshold, where granular data retrieval service can be supported by adjusting the threshold for different users. Moreover, to prevent privacy disclosure, we propose a differentially privacy release scheme based on the proposed index technique. We prove the privacy-preserving guarantee of the proposed mechanism, and the extensive experiments further demonstrate the validity of the proposed mechanism.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"80 1","pages":"601-606"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72850886","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036791
Xiaoxiong Zhong, Yang Qin, Yuanyuan Yang, Li Li
Cognitive radio (CR) is a promising technology to improve spectrum utilization. However, spectrum availability is uncertain which mainly depends on primary user's (PU's) behaviors. This makes it more difficult for most existing CR routing protocols to achieve high throughput in multi-channel cognitive radio networks (CRNs). Inter-session network coding and opportunistic routing can leverage the broadcast nature of the wireless channel to improve the performance for CRNs. In this paper we present a coding aware opportunistic routing protocol for multi-channel CRNs, cognitive radio opportunistic routing (CROR) protocol, which jointly considers the probability of successful spectrum utilization, packet loss rate, and coding opportunities. We evaluate and compare the proposed scheme against three other opportunistic routing protocols with multichannel. It is shown that the CROR, by integrating opportunistic routing with network coding, can obtain much better results, with respect to throughput, the probability of PU-SU packet collision and spectrum utilization efficiency.
{"title":"CROR: Coding-aware opportunistic routing in multi-channel cognitive radio networks","authors":"Xiaoxiong Zhong, Yang Qin, Yuanyuan Yang, Li Li","doi":"10.1109/GLOCOM.2014.7036791","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036791","url":null,"abstract":"Cognitive radio (CR) is a promising technology to improve spectrum utilization. However, spectrum availability is uncertain which mainly depends on primary user's (PU's) behaviors. This makes it more difficult for most existing CR routing protocols to achieve high throughput in multi-channel cognitive radio networks (CRNs). Inter-session network coding and opportunistic routing can leverage the broadcast nature of the wireless channel to improve the performance for CRNs. In this paper we present a coding aware opportunistic routing protocol for multi-channel CRNs, cognitive radio opportunistic routing (CROR) protocol, which jointly considers the probability of successful spectrum utilization, packet loss rate, and coding opportunities. We evaluate and compare the proposed scheme against three other opportunistic routing protocols with multichannel. It is shown that the CROR, by integrating opportunistic routing with network coding, can obtain much better results, with respect to throughput, the probability of PU-SU packet collision and spectrum utilization efficiency.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"46 1","pages":"100-105"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73734930","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036921
B. Nazari, A. Jamalipour
Cognitive radio is a promising paradigm to improve utilization of the radio frequency spectrum. In this work, we study a contract-based mechanism for sharing spectrum among primary licensed user (PU) and secondary unlicensed users (SUs). We assume that SUs cooperate in PU signal transmission. However, there are some challenges that the PU should overcome. First, considering the fact that nodes are selfish, brings the necessity of a reimbursement method to remunerate the helping SUs. Second, SU hides its private channel state information from other nodes, which results in asymmetry of information. The proposed contract-theory based framework provides a solution for spectrum allocation under asymmetric channel information. We compare the performance results with a benchmark scenario and we show through simulation results that both the PU and the SU gain positive revenue.
{"title":"Contract-based cooperative spectrum sharing in cognitive radio networks","authors":"B. Nazari, A. Jamalipour","doi":"10.1109/GLOCOM.2014.7036921","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036921","url":null,"abstract":"Cognitive radio is a promising paradigm to improve utilization of the radio frequency spectrum. In this work, we study a contract-based mechanism for sharing spectrum among primary licensed user (PU) and secondary unlicensed users (SUs). We assume that SUs cooperate in PU signal transmission. However, there are some challenges that the PU should overcome. First, considering the fact that nodes are selfish, brings the necessity of a reimbursement method to remunerate the helping SUs. Second, SU hides its private channel state information from other nodes, which results in asymmetry of information. The proposed contract-theory based framework provides a solution for spectrum allocation under asymmetric channel information. We compare the performance results with a benchmark scenario and we show through simulation results that both the PU and the SU gain positive revenue.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"17 1","pages":"888-892"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81989622","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037039
F. Zhu, F. Gao, M. Yao, Jian Li
In this paper, we design joint information beam-forming and jamming beamforming to guarantee both transmit security and receive security for a full duplex base station (FD-BS). Specifically, we aim to maximize the secret transmit rate while constrain the secret receive rate to be greater than a predefined bound. We convert the original non-convex problem into a new sequence of subproblems where the semidefinite programming (SDP) relaxation can be applied to efficiently find the optimal solutions. We strictly prove that such a relaxation does not change the optimality for these subproblems. Then the global optimal solutions of the original non-convex problem can be obtained via a one-dimensional search. Simulation results are provided to verify the efficiency of the proposed algorithms.
{"title":"Joint information- and jamming-beamforming for full duplex secure communication","authors":"F. Zhu, F. Gao, M. Yao, Jian Li","doi":"10.1109/GLOCOM.2014.7037039","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037039","url":null,"abstract":"In this paper, we design joint information beam-forming and jamming beamforming to guarantee both transmit security and receive security for a full duplex base station (FD-BS). Specifically, we aim to maximize the secret transmit rate while constrain the secret receive rate to be greater than a predefined bound. We convert the original non-convex problem into a new sequence of subproblems where the semidefinite programming (SDP) relaxation can be applied to efficiently find the optimal solutions. We strictly prove that such a relaxation does not change the optimality for these subproblems. Then the global optimal solutions of the original non-convex problem can be obtained via a one-dimensional search. Simulation results are provided to verify the efficiency of the proposed algorithms.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"83 1","pages":"1614-1618"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82141133","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037002
Zhifeng He, S. Mao, S. Kompella
We consider the problem of streaming multi-user videos over the downlink of a Cognitive Radio Network (CRN), where each Cognitive User (CU) can access one channel at a time. Motivated by the prior work that establishes a separation principle for the joint design of spectrum sensor, sensing, and access polices, we first model cooperative spectrum sensing as an Integer Programming problem (IP) and develop a Greedy Poly-matching scheme to solve it for the optimal sensing strategies. We then formulate the problem of CU Quality of Experience (QoE) maximization as a maximum weight matching problem and solve it with the Hungarian Method for optimal channel assignments. The proposed spectrum sensing and channel assignment algorithms are compared with benchmark schemes in simulations, and are found to outperform the benchmark schemes in terms of available channels discovered and CU QoE achieved.
{"title":"QoE driven video streaming in cognitive radio networks: The case of single channel access","authors":"Zhifeng He, S. Mao, S. Kompella","doi":"10.1109/GLOCOM.2014.7037002","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037002","url":null,"abstract":"We consider the problem of streaming multi-user videos over the downlink of a Cognitive Radio Network (CRN), where each Cognitive User (CU) can access one channel at a time. Motivated by the prior work that establishes a separation principle for the joint design of spectrum sensor, sensing, and access polices, we first model cooperative spectrum sensing as an Integer Programming problem (IP) and develop a Greedy Poly-matching scheme to solve it for the optimal sensing strategies. We then formulate the problem of CU Quality of Experience (QoE) maximization as a maximum weight matching problem and solve it with the Hungarian Method for optimal channel assignments. The proposed spectrum sensing and channel assignment algorithms are compared with benchmark schemes in simulations, and are found to outperform the benchmark schemes in terms of available channels discovered and CU QoE achieved.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"62 1","pages":"1388-1393"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82165404","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037068
Yuli Yang, S. Aïssa, A. Eltawil, K. Salama
In this paper, a hierarchical cell structure is considered, where public safety broadcasting is fulfilled in a femtocell located within a macrocell. In the femtocell, also known as local cell, an access point broadcasts to each local node (LN) over an orthogonal frequency sub-band independently. Since the local cell shares the spectrum licensed to the macrocell, a given LN is interfered by transmissions of the macrocell user (MU) in the same sub-band. To improve the broadcast performance in the local cell, a novel scheme is proposed to mitigate the interference from the MU to the LN while achieving diversity gain. For the sake of performance evaluation, ergodic capacity of the proposed scheme is quantified and a corresponding closed-form expression is obtained. By comparing with the traditional scheme that suffers from the MU's interference, numerical results substantiate the advantage of the proposed scheme and provide a useful tool for the broadcast design in hierarchical cell systems.
{"title":"An interference cancellation strategy for broadcast in hierarchical cell structure","authors":"Yuli Yang, S. Aïssa, A. Eltawil, K. Salama","doi":"10.1109/GLOCOM.2014.7037068","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037068","url":null,"abstract":"In this paper, a hierarchical cell structure is considered, where public safety broadcasting is fulfilled in a femtocell located within a macrocell. In the femtocell, also known as local cell, an access point broadcasts to each local node (LN) over an orthogonal frequency sub-band independently. Since the local cell shares the spectrum licensed to the macrocell, a given LN is interfered by transmissions of the macrocell user (MU) in the same sub-band. To improve the broadcast performance in the local cell, a novel scheme is proposed to mitigate the interference from the MU to the LN while achieving diversity gain. For the sake of performance evaluation, ergodic capacity of the proposed scheme is quantified and a corresponding closed-form expression is obtained. By comparing with the traditional scheme that suffers from the MU's interference, numerical results substantiate the advantage of the proposed scheme and provide a useful tool for the broadcast design in hierarchical cell systems.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"37 1","pages":"1792-1797"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79794219","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036935
H. Khakzad, Reza Shakeri, Abbas Taherpour, T. Khattab, M. Hasna
In this paper, we investigate relay-sharing in cognitive radio (CR) networks to improve the secondary user's (SU's) performance in the presence of interference. It is assumed that the relay is shared simultaneously between both the primary user (PU) and the SU by using hierarchical modulation at the relay node while mapping the PU's and the SU's symbols onto two different layers of the hierarchical constellation. The proposed scheme relies on power adjusting, where the SU power adjustment is based on channel side information (CSI) and tolerable interference limit at the PU. Theoretical analyses along with simulation results are provided to evaluate the performance of the proposed dynamic spectrum sharing scheme. The results demonstrate that the proposed relay-sharing scheme may result in about 7dB and 15dB signal to noise ratio (SNR) improvement for the SU in low-SNR and high-SNR regimes, respectively.
{"title":"Cognitive relay-sharing by using hierarchical modulation under interference constraints","authors":"H. Khakzad, Reza Shakeri, Abbas Taherpour, T. Khattab, M. Hasna","doi":"10.1109/GLOCOM.2014.7036935","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036935","url":null,"abstract":"In this paper, we investigate relay-sharing in cognitive radio (CR) networks to improve the secondary user's (SU's) performance in the presence of interference. It is assumed that the relay is shared simultaneously between both the primary user (PU) and the SU by using hierarchical modulation at the relay node while mapping the PU's and the SU's symbols onto two different layers of the hierarchical constellation. The proposed scheme relies on power adjusting, where the SU power adjustment is based on channel side information (CSI) and tolerable interference limit at the PU. Theoretical analyses along with simulation results are provided to evaluate the performance of the proposed dynamic spectrum sharing scheme. The results demonstrate that the proposed relay-sharing scheme may result in about 7dB and 15dB signal to noise ratio (SNR) improvement for the SU in low-SNR and high-SNR regimes, respectively.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"1 1","pages":"973-978"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79800576","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
扫码关注我们
求助内容：
应助结果提醒方式：