Xiaoyan Wang, Yusheng Ji, Hao Zhou, Zhi Liu, Jie Li
This paper addresses the spectrum leasing issue in cognitive radio networks by exploiting the secondary user’s cooperative retransmission. In contrast with the previous researches that focuses on cancellationbased or coding-based cooperative retransmissions, we propose a novel trading-based mechanism to facilitate the cooperative retransmission for cognitive radio networks. By utilizing the Stackelberg game model, we incentivize the otherwise non-cooperative users by maximizing their utilities in terms of transmission rates and economic profit. We analyze the existence of the unique Nash equilibrium of the game, and provide the optimal solutions with corresponding constraints. Numerical results demonstrate the efficiency of the proposed mechanism, under which the performance of the whole system could be substantially improved. Received on 05 March 2015 accepted on 17 March 2015; published on 16 July 2015
{"title":"Incentivize Spectrum Leasing in Cognitive Radio Networks by Exploiting Cooperative Retransmission","authors":"Xiaoyan Wang, Yusheng Ji, Hao Zhou, Zhi Liu, Jie Li","doi":"10.4108/ws.1.3.e2","DOIUrl":"https://doi.org/10.4108/ws.1.3.e2","url":null,"abstract":"This paper addresses the spectrum leasing issue in cognitive radio networks by exploiting the secondary user’s cooperative retransmission. In contrast with the previous researches that focuses on cancellationbased or coding-based cooperative retransmissions, we propose a novel trading-based mechanism to facilitate the cooperative retransmission for cognitive radio networks. By utilizing the Stackelberg game model, we incentivize the otherwise non-cooperative users by maximizing their utilities in terms of transmission rates and economic profit. We analyze the existence of the unique Nash equilibrium of the game, and provide the optimal solutions with corresponding constraints. Numerical results demonstrate the efficiency of the proposed mechanism, under which the performance of the whole system could be substantially improved. Received on 05 March 2015 accepted on 17 March 2015; published on 16 July 2015","PeriodicalId":288158,"journal":{"name":"EAI Endorsed Trans. Wirel. Spectr.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123748033","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 : 2015-05-25DOI: 10.4108/icst.mobimedia.2015.258975
Yanbo Ma, Piming Ma, Haixia Zhang
This paper considers a cooperative Orthogonal Frequency Division Multiplexing (OFDM)-based cognitive radio network, where the primary system leases a fraction of its subcarriers to the secondary system in exchange for the secondary users (SUs) acting as decode-and-forward relays. Our aim is to determine an fair resource allocation strategy among the primary users and SUs as so to maximize the network capacity. To this end, a network utility maximization optimization problem of power, subcarrier allocation and relay selection is formulated based on a class of α-fair utility. This problem is solved by applying the lagrangian dual method and a joint fair resource allocation policy at the SUs is derived in a closed-form expression. Moreover, a novel stochastic algorithm is developed to approach the optimal policy by dynamically learning the intended wireless channels. Simulation results demonstrate that both primary and secondary systems can benefit from the proposed resource allocation policy.
{"title":"Joint Fair Resource Allocation for Opportunistic Spectrum Sharing in OFDM-based Cognitive Radio Networks","authors":"Yanbo Ma, Piming Ma, Haixia Zhang","doi":"10.4108/icst.mobimedia.2015.258975","DOIUrl":"https://doi.org/10.4108/icst.mobimedia.2015.258975","url":null,"abstract":"This paper considers a cooperative Orthogonal Frequency Division Multiplexing (OFDM)-based cognitive radio network, where the primary system leases a fraction of its subcarriers to the secondary system in exchange for the secondary users (SUs) acting as decode-and-forward relays. Our aim is to determine an fair resource allocation strategy among the primary users and SUs as so to maximize the network capacity. To this end, a network utility maximization optimization problem of power, subcarrier allocation and relay selection is formulated based on a class of α-fair utility. This problem is solved by applying the lagrangian dual method and a joint fair resource allocation policy at the SUs is derived in a closed-form expression. Moreover, a novel stochastic algorithm is developed to approach the optimal policy by dynamically learning the intended wireless channels. Simulation results demonstrate that both primary and secondary systems can benefit from the proposed resource allocation policy.","PeriodicalId":288158,"journal":{"name":"EAI Endorsed Trans. Wirel. Spectr.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121662685","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 : 2015-05-25DOI: 10.4108/icst.mobimedia.2015.259057
Mu Wang, Changqiao Xu, Yiran Wei, Jianfeng Guan
With the fast development of mobile communication technologies and increased capabilities of smart terminals, the multimedia service has become one of the most attractive applications in mobile Internet. And the combination of social-based mobile multimedia and mobile peer-to-peer (P2P) network has attracted increasing research interests in recent years. However, how to deploy large scale P2P-based social multimedia applications over MANETs has become a bid challenge. In this paper, we propose a Propagation-based Content Dissemination solution for Social Interactive Multimedia services over MANETs (PSIM). In PSIM, the video content propagation problem is formulated as an Epidemic Information Dissemination (SIR) model. Based on the chunk-based dissemination model and analysis, a novel Propagation-based Video Chunk Demands Estimation Algorithm and a Stability-based Cooperative Carrier Selection Mechanism are proposed to estimate the video chunk demands and choose stable cooperative cache nodes, respectively. Simulation results show how PSIM achieves better performance in comparison with another state-of-art solution.
{"title":"Propagation-based Content Dissemination for Social Mobile Interactive Multimedia Services","authors":"Mu Wang, Changqiao Xu, Yiran Wei, Jianfeng Guan","doi":"10.4108/icst.mobimedia.2015.259057","DOIUrl":"https://doi.org/10.4108/icst.mobimedia.2015.259057","url":null,"abstract":"With the fast development of mobile communication technologies and increased capabilities of smart terminals, the multimedia service has become one of the most attractive applications in mobile Internet. And the combination of social-based mobile multimedia and mobile peer-to-peer (P2P) network has attracted increasing research interests in recent years. However, how to deploy large scale P2P-based social multimedia applications over MANETs has become a bid challenge. In this paper, we propose a Propagation-based Content Dissemination solution for Social Interactive Multimedia services over MANETs (PSIM). In PSIM, the video content propagation problem is formulated as an Epidemic Information Dissemination (SIR) model. Based on the chunk-based dissemination model and analysis, a novel Propagation-based Video Chunk Demands Estimation Algorithm and a Stability-based Cooperative Carrier Selection Mechanism are proposed to estimate the video chunk demands and choose stable cooperative cache nodes, respectively. Simulation results show how PSIM achieves better performance in comparison with another state-of-art solution.","PeriodicalId":288158,"journal":{"name":"EAI Endorsed Trans. Wirel. Spectr.","volume":"30 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124899460","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 : 2015-05-25DOI: 10.4108/icst.mobimedia.2015.259100
M. VenkataPhaniKumar, K. C. R. C. Varma, S. Mahapatra
In this paper, a novel rate control mechanism is proposed for constant bit rate video streaming. The initial quantization parameter used for encoding a video sequence is determined using the average spatio-temporal complexity of the sequence, its resolution and the target bit rate. Simple linear estimation models are then used to predict the number of bits that would be necessary to encode a frame for a given complexity and quantization parameter. The experimental results demonstrate that our proposed rate control mechanism significantly outperforms the existing rate control scheme in the Joint Model (JM) reference software in terms of Peak Signal to Noise Ratio (PSNR) and consistent perceptual visual quality while achieving the target bit rate. Furthermore, the proposed scheme is validated through implementation on a miniature test-bed.
本文提出了一种用于恒比特率视频流的速率控制机制。用于编码视频序列的初始量化参数是使用序列的平均时空复杂度、分辨率和目标比特率来确定的。然后使用简单的线性估计模型来预测编码给定复杂度和量化参数的帧所需的比特数。实验结果表明，我们提出的速率控制机制在达到目标比特率的同时，在峰值信噪比(PSNR)和一致的感知视觉质量方面显著优于Joint Model (JM)参考软件中现有的速率控制方案。最后，在一个小型试验台上对该方案进行了验证。
{"title":"A Novel Rate Control Scheme for Constant Bit Rate Video Streaming","authors":"M. VenkataPhaniKumar, K. C. R. C. Varma, S. Mahapatra","doi":"10.4108/icst.mobimedia.2015.259100","DOIUrl":"https://doi.org/10.4108/icst.mobimedia.2015.259100","url":null,"abstract":"In this paper, a novel rate control mechanism is proposed for constant bit rate video streaming. The initial quantization parameter used for encoding a video sequence is determined using the average spatio-temporal complexity of the sequence, its resolution and the target bit rate. Simple linear estimation models are then used to predict the number of bits that would be necessary to encode a frame for a given complexity and quantization parameter. The experimental results demonstrate that our proposed rate control mechanism significantly outperforms the existing rate control scheme in the Joint Model (JM) reference software in terms of Peak Signal to Noise Ratio (PSNR) and consistent perceptual visual quality while achieving the target bit rate. Furthermore, the proposed scheme is validated through implementation on a miniature test-bed.","PeriodicalId":288158,"journal":{"name":"EAI Endorsed Trans. Wirel. Spectr.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129591166","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}
Driven by both safety concerns and commercial interests, popular content distribution (PCD), as one of the key services offered by vehicular networks, has recently received considerable attention. In this paper, we address the PCD problem in highway scenarios, in which a popular file is distributed to a group of onboard units (OBUs) driving through an area of interest (AoI). Due to high speeds of vehicles and deep fading of vehicle-to-roadside (V2R) channels, the OBUs may not finish downloading the entire file. Consequently, a peer-to-peer (p2p) network should be constructed among the OBUs for completing the file delivery process. Here, we apply the cognitive radio technique for vehicle-to-vehicle communications and propose a cooperative approach based on coalition formation games, which jointly considers the spectrum sensing and channel access performance. Simulation results show that our approach presents a considerable performance improvement compared with the non-cooperative case.
{"title":"Popular Content Distribution in CR-VANETs with Joint Spectrum Sensing and Channel Access using Coalitional Games","authors":"Tianyu Wang, Lingyang Song, Zhu Han","doi":"10.4108/ws.1.2.e4","DOIUrl":"https://doi.org/10.4108/ws.1.2.e4","url":null,"abstract":"Driven by both safety concerns and commercial interests, popular content distribution (PCD), as one of the key services offered by vehicular networks, has recently received considerable attention. In this paper, we address the PCD problem in highway scenarios, in which a popular file is distributed to a group of onboard units (OBUs) driving through an area of interest (AoI). Due to high speeds of vehicles and deep fading of vehicle-to-roadside (V2R) channels, the OBUs may not finish downloading the entire file. Consequently, a peer-to-peer (p2p) network should be constructed among the OBUs for completing the file delivery process. Here, we apply the cognitive radio technique for vehicle-to-vehicle communications and propose a cooperative approach based on coalition formation games, which jointly considers the spectrum sensing and channel access performance. Simulation results show that our approach presents a considerable performance improvement compared with the non-cooperative case.","PeriodicalId":288158,"journal":{"name":"EAI Endorsed Trans. Wirel. Spectr.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128908094","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}
Distributed spectrum sharing via congestion advertisement is modelled and studied as a game theoretic problem. A related graphical anti-coordination game problem and a suitable logit-response learning mechanism is proposed and studied. It has been shown that introducing an arbitrary small congestion advertisement term into the users utility can improve the convergence rate of the spectrum sharing game exponentially. Finally, simulation results are presented to evaluate the price of anarchy, convergence rate and phase transition properties. Received on 17 March 2013; accepted on 25 June 2013; published on 14 July 2014
{"title":"Distributed Spectrum Sharing Games Via Congestion Advertisement","authors":"Mahdi Azarafrooz, R. Chandramouli","doi":"10.4108/ws.1.2.e1","DOIUrl":"https://doi.org/10.4108/ws.1.2.e1","url":null,"abstract":"Distributed spectrum sharing via congestion advertisement is modelled and studied as a game theoretic problem. A related graphical anti-coordination game problem and a suitable logit-response learning mechanism is proposed and studied. It has been shown that introducing an arbitrary small congestion advertisement term into the users utility can improve the convergence rate of the spectrum sharing game exponentially. Finally, simulation results are presented to evaluate the price of anarchy, convergence rate and phase transition properties. Received on 17 March 2013; accepted on 25 June 2013; published on 14 July 2014","PeriodicalId":288158,"journal":{"name":"EAI Endorsed Trans. Wirel. Spectr.","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121381529","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}
Cooperative multiple-input multiple-output (MIMO) relaying is investigated in the paper. We introduce DFAF selection MIMO relaying, where the relay equipped with multiple antennas can adaptively switch between decode-and-forward (DF) and amplify-and-forward (AF) according to its decoding state of the sourcemessage. We consider two wireless environment scenarios: 1)The scenario with traditional channels are considered firstly. We analyze the outage performance of DF-AF selection MIMO relaying, and a closed-form expression is derived. In addition, the diversity order is obtained based on the expression. For comparison purpose, we also obtain the closed-form outage probability and the diversity order for the AF MIMO relaying and the DF MIMO relaying. 2)We investigate the cooperative MIMO relaying in the presnece of keyholes secondly. We present performance analysis of orthogonal space-time block coded transmission for a cooperative MIMO relaying system with keyholes. For DF MIMO relaying, exact outage probability and symbol error probability (SEP) are obtained. Regarding AF MIMO relaying and DF-AF selection MIMO relaying, the lower and upper bounds are derived. In both traditional and keyhole scenarios, theoretical analysis which has been further verified through Monte-Carlo simulations demonstrate that the DF-AF selection MIMO relaying has better performance than the AF MIMO relaying and the DF MIMO relaying. Received on 09 October 2013; accepted on 09 December 2013; published on 14 July 2014
{"title":"Cooperative MIMO Relaying with Orthogonal Space-Time Block Codes in Wireless Channels with and without Keyholes","authors":"Tian Zhang, Wei Chen, Wei Zhang, Z. Cao","doi":"10.4108/ws.1.2.e3","DOIUrl":"https://doi.org/10.4108/ws.1.2.e3","url":null,"abstract":"Cooperative multiple-input multiple-output (MIMO) relaying is investigated in the paper. We introduce DFAF selection MIMO relaying, where the relay equipped with multiple antennas can adaptively switch between decode-and-forward (DF) and amplify-and-forward (AF) according to its decoding state of the sourcemessage. We consider two wireless environment scenarios: 1)The scenario with traditional channels are considered firstly. We analyze the outage performance of DF-AF selection MIMO relaying, and a closed-form expression is derived. In addition, the diversity order is obtained based on the expression. For comparison purpose, we also obtain the closed-form outage probability and the diversity order for the AF MIMO relaying and the DF MIMO relaying. 2)We investigate the cooperative MIMO relaying in the presnece of keyholes secondly. We present performance analysis of orthogonal space-time block coded transmission for a cooperative MIMO relaying system with keyholes. For DF MIMO relaying, exact outage probability and symbol error probability (SEP) are obtained. Regarding AF MIMO relaying and DF-AF selection MIMO relaying, the lower and upper bounds are derived. In both traditional and keyhole scenarios, theoretical analysis which has been further verified through Monte-Carlo simulations demonstrate that the DF-AF selection MIMO relaying has better performance than the AF MIMO relaying and the DF MIMO relaying. Received on 09 October 2013; accepted on 09 December 2013; published on 14 July 2014","PeriodicalId":288158,"journal":{"name":"EAI Endorsed Trans. Wirel. Spectr.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114665989","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}
The demand for cellular data service has been skyrocketing since the debut of data-intensive smart phones and touchpads. However, not all data are created equal. Many popular applications on mobile devices, such as email synchronization and social network updates, are delay tolerant. In addition, cellular load varies significantly in both large and small time scales. To alleviate network congestion and improve network performance, we present a set of opportunistic trough filling schemes that leverage the time-variation of network congestion and delay-tolerance of certain traffic in this paper. We consider average delay, deadline, and clearance time as the performance metrics. Simulation results show promising performance improvement over the standard schemes. The work shed lights on addressing the pressing issue of cellular overload.
{"title":"Alleviate Cellular Congestion Through Opportunistic Trough Filling","authors":"Yichuan Wang, Xin Liu","doi":"10.4108/ws.1.1.e5","DOIUrl":"https://doi.org/10.4108/ws.1.1.e5","url":null,"abstract":"The demand for cellular data service has been skyrocketing since the debut of data-intensive smart phones and touchpads. However, not all data are created equal. Many popular applications on mobile devices, such as email synchronization and social network updates, are delay tolerant. In addition, cellular load varies significantly in both large and small time scales. To alleviate network congestion and improve network performance, we present a set of opportunistic trough filling schemes that leverage the time-variation of network congestion and delay-tolerance of certain traffic in this paper. We consider average delay, deadline, and clearance time as the performance metrics. Simulation results show promising performance improvement over the standard schemes. The work shed lights on addressing the pressing issue of cellular overload.","PeriodicalId":288158,"journal":{"name":"EAI Endorsed Trans. Wirel. Spectr.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132866870","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}
While it is well accepted that cooperative spectrum sensing will significantly improve the sensing performance, the necessity of cooperation is not sufficiently appreciated. In this paper, by analyzing the spectrum sensing problem from the system perspective, we show that without cooperation, the performance will suffer from a fundamental tradeoff between reliability and efficiency. However, if cooperation is incorporated in the spectrum sensing process and the threshold is selected appropriately, the efficiencyreliability tradeoff in the non-cooperative case can be largely overcome by exploiting the cooperative diversity. These results show that cooperation in spectrum sensing is not just a luxury but a necessity. Received on 10 November 2013; accepted on 08 December 2013; published on 11 April 2014
{"title":"Spectrum Sensing: To Cooperate or Not to Cooperate?","authors":"Dongliang Duan, Liuqing Yang, Shuguang Cui","doi":"10.4108/ws.1.1.e3","DOIUrl":"https://doi.org/10.4108/ws.1.1.e3","url":null,"abstract":"While it is well accepted that cooperative spectrum sensing will significantly improve the sensing performance, the necessity of cooperation is not sufficiently appreciated. In this paper, by analyzing the spectrum sensing problem from the system perspective, we show that without cooperation, the performance will suffer from a fundamental tradeoff between reliability and efficiency. However, if cooperation is incorporated in the spectrum sensing process and the threshold is selected appropriately, the efficiencyreliability tradeoff in the non-cooperative case can be largely overcome by exploiting the cooperative diversity. These results show that cooperation in spectrum sensing is not just a luxury but a necessity. Received on 10 November 2013; accepted on 08 December 2013; published on 11 April 2014","PeriodicalId":288158,"journal":{"name":"EAI Endorsed Trans. Wirel. Spectr.","volume":"16 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129425375","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}
The theory of compressive sensing (CS) has been employed to detect available spectrum resource in cognitive radio (CR) networks recently. Capitalizing on the spectrum resource underutilization and spatial sparsity of primary user (PU) locations, CS enables the identification of the unused spectrum bands and PU locations at a low sampling rate. Although CS has been studied in the cooperative spectrum sensing mechanism in which CR nodes work collaboratively to accomplish the spectrum sensing and PU localization task, many important issues remain unsettled. Does the designed compressive spectrum sensing mechanism satisfy the Restricted Isometry Property, which guarantees a successful recovery of the original sparse signal? Can the spectrum sensing results help the localization of PUs? What are the characteristics of localization errors? To answer those questions, we try to justify the applicability of the CS theory to the compressive spectrum sensing framework in this paper, and propose a design of PU localization utilizing the spectrum usage information. The localization error is analyzed by the Cramér-Rao lower bound, which can be exploited to improve the localization performance. Detail analysis and simulations are presented to support the claims and demonstrate the efficacy and efficiency of the proposed mechanism. Received on 30 September 2013; accepted on 14 November 2013; published on 11 April 2014
{"title":"Spectrum Sensing and Primary User Localization in Cognitive Radio Networks via Sparsity","authors":"Lanchao Liu, Zhu Han, Zhiqiang Wu, Lijun Qian","doi":"10.4108/ws.1.1.e2","DOIUrl":"https://doi.org/10.4108/ws.1.1.e2","url":null,"abstract":"The theory of compressive sensing (CS) has been employed to detect available spectrum resource in cognitive radio (CR) networks recently. Capitalizing on the spectrum resource underutilization and spatial sparsity of primary user (PU) locations, CS enables the identification of the unused spectrum bands and PU locations at a low sampling rate. Although CS has been studied in the cooperative spectrum sensing mechanism in which CR nodes work collaboratively to accomplish the spectrum sensing and PU localization task, many important issues remain unsettled. Does the designed compressive spectrum sensing mechanism satisfy the Restricted Isometry Property, which guarantees a successful recovery of the original sparse signal? Can the spectrum sensing results help the localization of PUs? What are the characteristics of localization errors? To answer those questions, we try to justify the applicability of the CS theory to the compressive spectrum sensing framework in this paper, and propose a design of PU localization utilizing the spectrum usage information. The localization error is analyzed by the Cramér-Rao lower bound, which can be exploited to improve the localization performance. Detail analysis and simulations are presented to support the claims and demonstrate the efficacy and efficiency of the proposed mechanism. Received on 30 September 2013; accepted on 14 November 2013; published on 11 April 2014","PeriodicalId":288158,"journal":{"name":"EAI Endorsed Trans. Wirel. Spectr.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129772539","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
扫码关注我们
求助内容：
应助结果提醒方式：