Device-to-Device communication (D2D) integrated in cellular networks emerges as a new trend in response to notable rise in traffic demand. Resource allocation is one of the important challenges in deployment of D2D networks. In this paper, we formulate an optimization problem for optimal resource allocation and then propose a novel algorithm namely maximum clique based resource allocation (MCRA) for improving the spectral reuse based on graph theoretic concept of maximum clique. Practical application of D2D communications requires each node to receive and transmit signals during the communication process. We have considered this issue in constructing the interference graph and mathematical formulations in our system model. We have proposed an efficient algorithm called binary code-based maximum clique detector (BCMD) to find the maximum clique solution with reduced complexity in interference graphs. Finally, to mitigate the overall interference and complexity of the problem, a two level resource allocation algorithm (TLRA) is suggested. The results demonstrate that substantial gains are achieved in terms of sum rate, time and computational complexity compared to the existing approaches in literature.
{"title":"Maximum clique-based resource allocation in device-to-device communications","authors":"Golnoosh Elhami, Mona Zehni, Mohammadreza Pakravan","doi":"10.1109/PIMRC.2015.7343480","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343480","url":null,"abstract":"Device-to-Device communication (D2D) integrated in cellular networks emerges as a new trend in response to notable rise in traffic demand. Resource allocation is one of the important challenges in deployment of D2D networks. In this paper, we formulate an optimization problem for optimal resource allocation and then propose a novel algorithm namely maximum clique based resource allocation (MCRA) for improving the spectral reuse based on graph theoretic concept of maximum clique. Practical application of D2D communications requires each node to receive and transmit signals during the communication process. We have considered this issue in constructing the interference graph and mathematical formulations in our system model. We have proposed an efficient algorithm called binary code-based maximum clique detector (BCMD) to find the maximum clique solution with reduced complexity in interference graphs. Finally, to mitigate the overall interference and complexity of the problem, a two level resource allocation algorithm (TLRA) is suggested. The results demonstrate that substantial gains are achieved in terms of sum rate, time and computational complexity compared to the existing approaches in literature.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130511680","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-12-03DOI: 10.1109/PIMRC.2015.7343324
Daiki Cho, S. Narieda
This paper presents a feature detection based spectrum sensing technique by some test statistics sharing among multiple receive antennas. In conventional feature (signal cyclostationarity) detection based spectrum sensing techniques with multiple antenna systems, computational complexity is not low, and it increases in proportion to the number of receive antennas. In this paper, test statistics are shared among multiple receive antennas for improving computational efficiency. The results are compared with results obtained using some conventional techniques and they show that 1) the presented technique can obtain favorable results even though the presented technique has a low computational complexity in comparison with the conventional techniques; 2) the performances and computational complexity of the presented technique are better and lower than that of conventional techniques in proportion to the number of receive antennas; 3) when noise variances at each of the RF chains are different, degradation of performance can be suppressed by adjusting computational complexity.
{"title":"Feature detection based computationally efficient spectrum sensing by test statistics sharing among multiple receive antennas","authors":"Daiki Cho, S. Narieda","doi":"10.1109/PIMRC.2015.7343324","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343324","url":null,"abstract":"This paper presents a feature detection based spectrum sensing technique by some test statistics sharing among multiple receive antennas. In conventional feature (signal cyclostationarity) detection based spectrum sensing techniques with multiple antenna systems, computational complexity is not low, and it increases in proportion to the number of receive antennas. In this paper, test statistics are shared among multiple receive antennas for improving computational efficiency. The results are compared with results obtained using some conventional techniques and they show that 1) the presented technique can obtain favorable results even though the presented technique has a low computational complexity in comparison with the conventional techniques; 2) the performances and computational complexity of the presented technique are better and lower than that of conventional techniques in proportion to the number of receive antennas; 3) when noise variances at each of the RF chains are different, degradation of performance can be suppressed by adjusting computational complexity.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130509746","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-12-03DOI: 10.1109/PIMRC.2015.7343382
M. Aloqlah, I. Atawi, M. Al-Mistarihi
This paper investigates the performance of an energy detector with single antenna reception operating over κ-μ shadowed fading. Novel accurate expressions for both the average detection probability and the average area under the receiver operating characteristic curve (average AUC) are derived using the well-known probability density function (PDF)-based method. The unified framework shows that the obtained results can be expressed as an infinite series form which converges steadily and rapidly. Based on this derived analytical formulas, the impact of key fading parameters on the performance of energy detector is discussed. Furthermore, the accuracy of the analytical expressions is substantiated by Monte Carlo simulation results.
{"title":"Further performance results for energy detector operating over k-μ shadowed fading","authors":"M. Aloqlah, I. Atawi, M. Al-Mistarihi","doi":"10.1109/PIMRC.2015.7343382","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343382","url":null,"abstract":"This paper investigates the performance of an energy detector with single antenna reception operating over κ-μ shadowed fading. Novel accurate expressions for both the average detection probability and the average area under the receiver operating characteristic curve (average AUC) are derived using the well-known probability density function (PDF)-based method. The unified framework shows that the obtained results can be expressed as an infinite series form which converges steadily and rapidly. Based on this derived analytical formulas, the impact of key fading parameters on the performance of energy detector is discussed. Furthermore, the accuracy of the analytical expressions is substantiated by Monte Carlo simulation results.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127774249","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-12-03DOI: 10.1109/PIMRC.2015.7343643
L. Khalil, P. Jung
Location services gained attraction with the recent advancements in context and location-aware technologies. Furthermore, location information becomes important with the deployment of wireless communication networks and the mobility that characterizes the wireless communication users. Within indoor environments, coverage of the explicit sensors based on Global Positioning System (GPS) is limited. Building an indoor location tracking system based on the Received Signal Strength Indicator (RSSI) of the widely deployed Wireless Local Area Network (WLAN) is considered cost effective. Extended Kalman Filter (EKF) is the most implemented algorithm for obtaining location information out of the RSSI measurements. In this paper, we propose the Spherical Simplex Unscented Kalman Filter (SSUKF) to work over WLAN IEEE 802.11n networks for indoor positioning and tracking. SSUKF exploits the RSSI measurements and the knowledge of anchor nodes' positions for location estimation. SSUKF is proposed for easy of implementation and reduced computational cost compared with EKF. Comparative results are illustrated using Monte Carlo simulations in MATLAB.
{"title":"Spherical simplex unscented Kalman filter for RSSI-Based WLAN IEEE 802.11n positioning and tracking","authors":"L. Khalil, P. Jung","doi":"10.1109/PIMRC.2015.7343643","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343643","url":null,"abstract":"Location services gained attraction with the recent advancements in context and location-aware technologies. Furthermore, location information becomes important with the deployment of wireless communication networks and the mobility that characterizes the wireless communication users. Within indoor environments, coverage of the explicit sensors based on Global Positioning System (GPS) is limited. Building an indoor location tracking system based on the Received Signal Strength Indicator (RSSI) of the widely deployed Wireless Local Area Network (WLAN) is considered cost effective. Extended Kalman Filter (EKF) is the most implemented algorithm for obtaining location information out of the RSSI measurements. In this paper, we propose the Spherical Simplex Unscented Kalman Filter (SSUKF) to work over WLAN IEEE 802.11n networks for indoor positioning and tracking. SSUKF exploits the RSSI measurements and the knowledge of anchor nodes' positions for location estimation. SSUKF is proposed for easy of implementation and reduced computational cost compared with EKF. Comparative results are illustrated using Monte Carlo simulations in MATLAB.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127974268","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-12-03DOI: 10.1109/PIMRC.2015.7343422
Yu Cao, Ming Jia, Jianglei Ma, Mohammad Javad Abdoli
An adjustable pulse bandwidth single carrier waveform for asynchronous low-cost low-power 5G M2M applications is proposed. The solution uses ultra narrow-band pulse to improve coverage, which is a much more efficient coverage enhancement solution than existing repetition solutions. Frequency localized pulse shaping is used, which allows asynchronous transmission and packing more machine-type devices (MTDs) for the same spectrum resources. In addition, bandwidth of each MTD is configurable based on long term channel quality and system load, which supports higher throughput and lower power consumption. Performance comparison with the repetition solution of 3GPP LTE demonstrates significant gain in terms of number of supported connections.
{"title":"Adjustable ultra narrow-band pulse for asynchronous 5G M2M communications","authors":"Yu Cao, Ming Jia, Jianglei Ma, Mohammad Javad Abdoli","doi":"10.1109/PIMRC.2015.7343422","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343422","url":null,"abstract":"An adjustable pulse bandwidth single carrier waveform for asynchronous low-cost low-power 5G M2M applications is proposed. The solution uses ultra narrow-band pulse to improve coverage, which is a much more efficient coverage enhancement solution than existing repetition solutions. Frequency localized pulse shaping is used, which allows asynchronous transmission and packing more machine-type devices (MTDs) for the same spectrum resources. In addition, bandwidth of each MTD is configurable based on long term channel quality and system load, which supports higher throughput and lower power consumption. Performance comparison with the repetition solution of 3GPP LTE demonstrates significant gain in terms of number of supported connections.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127350570","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-12-03DOI: 10.1109/PIMRC.2015.7343489
Thilina N. Weerasinghe, Alexandre Kanyeshuli, F. Li
One of the main challenges confronted by wireless sensor networks (WSNs) is to reduce energy consumption of nodes for the purpose of network lifetime extension. In the literature, many backbone based protocols such as connected dominating set (CDS) and broadcast or multicast based protocols are employed in order to improve network performance in terms of metrics like energy consumption, number of transmissions and dissemination delay. In this paper, we evaluate the performance of a recently proposed transmission protocol known as collective flooding (CF), which is based on link correlation, under various link correlation conditions. Through simulations and analyses we demonstrate that although CF performs well in most cases in comparison with CDS and multicast based protocols, weak link correlation could cause serious performance degradation for CF based data transmissions. Accordingly, we propose two techniques and demonstrate that they improve significantly the performance of CF under weak link correlation.
{"title":"Evaluation and improvement of collective flooding in WSNs with various link correlations","authors":"Thilina N. Weerasinghe, Alexandre Kanyeshuli, F. Li","doi":"10.1109/PIMRC.2015.7343489","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343489","url":null,"abstract":"One of the main challenges confronted by wireless sensor networks (WSNs) is to reduce energy consumption of nodes for the purpose of network lifetime extension. In the literature, many backbone based protocols such as connected dominating set (CDS) and broadcast or multicast based protocols are employed in order to improve network performance in terms of metrics like energy consumption, number of transmissions and dissemination delay. In this paper, we evaluate the performance of a recently proposed transmission protocol known as collective flooding (CF), which is based on link correlation, under various link correlation conditions. Through simulations and analyses we demonstrate that although CF performs well in most cases in comparison with CDS and multicast based protocols, weak link correlation could cause serious performance degradation for CF based data transmissions. Accordingly, we propose two techniques and demonstrate that they improve significantly the performance of CF under weak link correlation.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126757688","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-12-03DOI: 10.1109/PIMRC.2015.7343548
Rahul Thakur, Vijeth J. Kotagi, C. Murthy
Use of femtocells for indoor and office environment has proved to be an effective solution to handle ever increasing mobile data demands. Femtocell helps improving network capacity in an energy efficient manner without significantly burdening the operator with huge capital and operational expenditure. Since extremely dense femtocell deployments are expected in near future, it is of interest to look into their energy efficiency measures. In this paper, we analyse the energy efficiency aspect of cell selection scheme for femtocell networks. Cell selection scheme defines the criteria on which mobile users associate themselves with base stations. Hence, it plays a crucial role in system load balancing and total energy consumption. We suggest a unique cell selection scheme that assigns mobile users to femtocell base stations considering the capacity improvement obtained per unit increase in transmit power. Our proposed scheme shows an improvement in network performance in terms of both system capacity and energy efficiency. Additionally, we suggest the use of power spreading over subchannels to keep overall interference minimum while maximizing spectrum utilization.
{"title":"An energy efficient cell selection scheme for femtocell network with spreading","authors":"Rahul Thakur, Vijeth J. Kotagi, C. Murthy","doi":"10.1109/PIMRC.2015.7343548","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343548","url":null,"abstract":"Use of femtocells for indoor and office environment has proved to be an effective solution to handle ever increasing mobile data demands. Femtocell helps improving network capacity in an energy efficient manner without significantly burdening the operator with huge capital and operational expenditure. Since extremely dense femtocell deployments are expected in near future, it is of interest to look into their energy efficiency measures. In this paper, we analyse the energy efficiency aspect of cell selection scheme for femtocell networks. Cell selection scheme defines the criteria on which mobile users associate themselves with base stations. Hence, it plays a crucial role in system load balancing and total energy consumption. We suggest a unique cell selection scheme that assigns mobile users to femtocell base stations considering the capacity improvement obtained per unit increase in transmit power. Our proposed scheme shows an improvement in network performance in terms of both system capacity and energy efficiency. Additionally, we suggest the use of power spreading over subchannels to keep overall interference minimum while maximizing spectrum utilization.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114305331","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-12-03DOI: 10.1109/PIMRC.2015.7343394
I-Wei Lai, Chia-han Lee, G. Ascheid, H. Meyr, T. Chiueh
We propose an efficient iterative multiple-input multiple-output (MIMO) detection algorithm based on the local search. Specifically, since the MIMO channel matrix twists the lattice structure of the received symbols, the proposed channel-aware local search (CA-LS) defines its search neighborhood according to the instantaneous channel realization. Such channel-dependent neighborhood can be efficiently identified by using the sphere decoder in a set that comprises the differences between pairs of QAM vectors, which is termed as delta vectors. The delta vectors with small quadratic norms with respect to the channel matrix are identified and then used as the search directions of the CA-LS. Features like sparsity and non-uniformity of delta vectors are exploited to reduce the SD complexity. Furthermore, by reformulating the detection criterion, the log-likelihood ratio (LLR) computations and searches of the CA-LS are greatly simplified. Numerical simulations demonstrate that compared with other practical iterative MIMO detectors, e.g., the list sphere decoder, the CA-LS achieves superior performance in both error rate and complexity aspects.
{"title":"Channel-aware local search (CA-LS) for iterative MIMO detection","authors":"I-Wei Lai, Chia-han Lee, G. Ascheid, H. Meyr, T. Chiueh","doi":"10.1109/PIMRC.2015.7343394","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343394","url":null,"abstract":"We propose an efficient iterative multiple-input multiple-output (MIMO) detection algorithm based on the local search. Specifically, since the MIMO channel matrix twists the lattice structure of the received symbols, the proposed channel-aware local search (CA-LS) defines its search neighborhood according to the instantaneous channel realization. Such channel-dependent neighborhood can be efficiently identified by using the sphere decoder in a set that comprises the differences between pairs of QAM vectors, which is termed as delta vectors. The delta vectors with small quadratic norms with respect to the channel matrix are identified and then used as the search directions of the CA-LS. Features like sparsity and non-uniformity of delta vectors are exploited to reduce the SD complexity. Furthermore, by reformulating the detection criterion, the log-likelihood ratio (LLR) computations and searches of the CA-LS are greatly simplified. Numerical simulations demonstrate that compared with other practical iterative MIMO detectors, e.g., the list sphere decoder, the CA-LS achieves superior performance in both error rate and complexity aspects.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114185023","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-12-03DOI: 10.1109/PIMRC.2015.7343349
Yafei Wang, Bin Xia, Zhiyong Chen
In this paper, we investigate a two-way full-duplex (TWFD) amplify-forward (AF) relay cooperative communication system, of which all transceiver nodes operate in full-duplex (FD) mode. Considering that the self-interference (SI) introduced by the Co-time Co-frequency transceiver is closely related to the local transmitting power, we view the average power of residual self-interference (RSI) as the transmitting power multiplied by one coefficient representing the SI cancelation capability quantitatively. We analytically derive the exact expressions of the outage probabilities for the forward and backward links. Besides, we investigate the achievable rate which can hardly be obtained in closed-form, however, an approximate expression for it as one upper bound is given by the Jensen's inequality. Numerical results are also provided to verify the validity of theoretical analysis.
{"title":"Performance analysis of two-way full-duplex amplify-forward relay systems","authors":"Yafei Wang, Bin Xia, Zhiyong Chen","doi":"10.1109/PIMRC.2015.7343349","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343349","url":null,"abstract":"In this paper, we investigate a two-way full-duplex (TWFD) amplify-forward (AF) relay cooperative communication system, of which all transceiver nodes operate in full-duplex (FD) mode. Considering that the self-interference (SI) introduced by the Co-time Co-frequency transceiver is closely related to the local transmitting power, we view the average power of residual self-interference (RSI) as the transmitting power multiplied by one coefficient representing the SI cancelation capability quantitatively. We analytically derive the exact expressions of the outage probabilities for the forward and backward links. Besides, we investigate the achievable rate which can hardly be obtained in closed-form, however, an approximate expression for it as one upper bound is given by the Jensen's inequality. Numerical results are also provided to verify the validity of theoretical analysis.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120974154","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-12-03DOI: 10.1109/PIMRC.2015.7343325
Younes Abdi, T. Ristaniemi
Interrupted reporting has recently been introduced as an effective method to increase the energy efficiency of cooperative spectrum sensing schemes in cognitive radio networks. In this paper, joint optimization of the reporting and fusion phases in a cooperative sensing with interrupted reporting is considered. This optimization aims at finding the best weights used at the fusion center to construct a linear fusion of the received interrupted reports, jointly with Bernoulli distributions governing the statistical behavior of the interruptions. The problem is formulated by using the deflection criterion and as a nonconvex quadratic program which is then solved for a suboptimal solution, in a computationally-affordable fashion, by a semidefinite relaxation technique. The system performance is then demonstrated by a set of numerical results which compare the performance of the system for the cases with and without the optimal linear fusion.
{"title":"Linear fusion of interrupted reports in cooperative spectrum sensing for cognitive radio networks","authors":"Younes Abdi, T. Ristaniemi","doi":"10.1109/PIMRC.2015.7343325","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343325","url":null,"abstract":"Interrupted reporting has recently been introduced as an effective method to increase the energy efficiency of cooperative spectrum sensing schemes in cognitive radio networks. In this paper, joint optimization of the reporting and fusion phases in a cooperative sensing with interrupted reporting is considered. This optimization aims at finding the best weights used at the fusion center to construct a linear fusion of the received interrupted reports, jointly with Bernoulli distributions governing the statistical behavior of the interruptions. The problem is formulated by using the deflection criterion and as a nonconvex quadratic program which is then solved for a suboptimal solution, in a computationally-affordable fashion, by a semidefinite relaxation technique. The system performance is then demonstrated by a set of numerical results which compare the performance of the system for the cases with and without the optimal linear fusion.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122986763","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
扫码关注我们
求助内容：
应助结果提醒方式：