{"title":"Outage probability analysis of the decode and forward relaying over the composite fading multipath/shadowing channels","authors":"A. Dziri, D. Le Ruyet, D. Roviras, M. Terré","doi":"10.1109/SPAWC.2010.5670907","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5670907","url":null,"abstract":"Cooperative diversity is one of the promising solutions to overcome the channel impairments and provide high data rate coverage. It has been studied for different channel fading as Rayleigh, Rice and Nakagami-m. Nevertheless, for a decode and forward relaying over composite fading including simultaneously multipath and shadowing, outage results have ever appeared. Using the Nakagami probability density function (pdf) to model multipath fading and the Gamma pdf to model shadowing has led to the generalized-K model for composite fading. This paper gives an analytical expression of the outage probability of the Decode and Forward cooperative technique over the generalized-K fading channel. Simulation results are in good agreement with our theoretical analysis.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129804562","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cooperative multicell ARQ in MIMO cellular systems","authors":"K. Woradit, Tony Q. S. Quek, Zander Lei","doi":"10.1109/SPAWC.2010.5670997","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5670997","url":null,"abstract":"Coordinated multi-point processing at multiple base stations can improve coverage and throughput for future cellular systems. In this paper, we study the coordinated reception at multiple MIMO base stations by proposing cooperative multi-cell automatic repeat request (ARQ) protocols via wired backhaul links. In particular, we consider three protocols where the cooperative base stations employ different type of multi-cell processing, namely, opportunistic decode-and-forward, amplify-and-forward, and compress-and-forward processing. We derive the average packet error rates for these protocols. Numerical results show the effectiveness of the proposed protocols compared to conventional ARQ protocol. Furthermore, the degree of improvement depends on the type of cooperative multicell ARQ protocols and the operating average signal-to-noise ratio of the main and backhaul links.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127115040","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}
Weisi Guo, Ioannis Chatzigeorgiou, I. Wassell, R. Carrasco
{"title":"Power control for turbo coded symmetrical collaborative networks","authors":"Weisi Guo, Ioannis Chatzigeorgiou, I. Wassell, R. Carrasco","doi":"10.1109/SPAWC.2010.5671032","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5671032","url":null,"abstract":"Optimal power allocation for pure relay networks utilizing repetition codes has drawn a great deal of attention. However, power allocation in a cooperative network, where users who act as relays for each other and who utilize non-trivial codes, remains a challenge. With the aid of theoretical frame error rate expressions, we explore the performance of adaptive power control for decode-and-forward (DF) collaborative networks containing M users, employing turbo codes over statistically similar Rayleigh block faded channels. We conclude that power control can greatly benefit a DF collaborative network in a block fading environment.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"91 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114104440","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the usage of antennas in MIMO and MISO interference channels","authors":"M. Kaynia, A. Goldsmith, D. Gesbert, G. Oien","doi":"10.1109/SPAWC.2010.5671110","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5671110","url":null,"abstract":"We investigate the performance of an uncoordinated 2 link MIMO interference channel as a function of the number of antennas and the average channel gains. The channel coefficients are random and uncorrelated, all links undergo Rayleigh fading, and the transmitters have no channel state information. The analysis is done in terms of ergodic capacity and outage probability. For non-asymptotic networks (i.e., when the number of transmit and receive antennas is finite and small), we derive upper and lower bounds to both our performance metrics. Moreover, the particular case of a MISO channel is considered, where exact expressions for the ergodic capacity, distribution of the capacity, and outage probability are derived. It is concluded theoretically, and somewhat surprisingly, that using all transmit antennas is not always optimal. That is, depending on the average channel gains and the requested communication rate, a transmitter should apply its antennas in different ways in order to minimize the outage probability.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"297 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132937193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cooperative sequential binary hypothesis testing using cyclostationary features","authors":"K. Aditya Mohan, C. Murthy","doi":"10.1109/SPAWC.2010.5671064","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5671064","url":null,"abstract":"A cognitive radio should be capable of finding the best spectrum band for communication depending on primary transmissions, the ambient noise level and interference. The first step in achieving this goal is to sense the existence of primary and secondary transmitters in various channels. In addition to the problem of signal detection, there is a need to distinguish between different signals at very low SNR. In this paper, the spectral correlation function is used for hypothesis testing. The sufficient statistic for feature vector based detection in the presence of timing uncertainty is derived. Sequential detection is used to decrease the average number of samples required for testing. Theoretical expressions for the stopping time at low SNR are derived for the AWGN channel. In a fading environment, the performance is evaluated using an approximate expression for the distribution of spectral correlation function. Monte-Carlo simulations verify the accuracy of the theoretical expressions.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133346628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cooperative communications: Synchronization in fast flat-fading channels with various signal constellations","authors":"Md. Tofazzal Hossain, David B. Smith","doi":"10.1109/SPAWC.2010.5671050","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5671050","url":null,"abstract":"A non-data-aided near maximum likelihood (NDA-NML) symbol timing estimator is applied to cooperative communications in fast flat-fading conditions. The performance of a three-node detect-and-forward cooperative communication system is evaluated operating in fast Rayleigh fading channels using various signal constellations with and without synchronization. Timing errors have significant effect on performance. The lower complexity NDA-NML estimator performs well for larger signal constellations in fast fading, when compared to a data aided maximum likelihood (DA-ML) estimator.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133616925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Time slot allocation for TDMA/CDMA TH-UWB ad-hoc networks","authors":"P. Mary, I. Fijalkow, C. Poulliat","doi":"10.1109/SPAWC.2010.5671049","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5671049","url":null,"abstract":"In this paper, we deal with the time slot allocation in time-hopping ultra-wide band (TH-UWB) ad-hoc networks in order to maximize the total sum rate. This problem is known to be a discrete NP-hard optimization problem and hence cannot be solved with a computationally efficient algorithm. Moreover, the sum rate maximization often leads to starvation of links experiencing bad channel conditions. Our main contribution is to propose an algorithm which approaches the maximum sum rate while keeping the starvation rate under a threshold. We first propose a time slot allocation scheme based on an accept/reject criterion. The performance of the algorithm depends on the acceptance threshold. In a second approach, we add the starvation rate in constraints leading to a new algorithm maximizing the sum rate and keeping the starvation rate under control. Extensive simulation results show that the proposed algorithm achieves reasonable sum rate performances under restrictive starvation threshold.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132728598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Decentralized space-time block coding for two-way relay networks","authors":"F. Verde, A. Scaglione","doi":"10.1109/SPAWC.2010.5670981","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5670981","url":null,"abstract":"Cooperation diversity schemes employing space-time block coding (STBC) techniques have been proposed for wireless networks to increase systems capacity and coverage, by allowing multiple relay nodes distributed in space to assist the transmission between a given pair of terminals. Conventional relaying strategies, such as amplify-and-forward (A&F) and decode-and-forward (D&F), are designed by considering unidirectional communications via relays, which are referred to as one-way relay channels. Recently, it has been shown that, when there is consistent traffic in both directions, the use of two-way relaying protocols, which explicitly account for the bidirectional nature of the data flow, can potentially improve the network performance. In this paper, capitalizing on randomized STBC, a coding rule which has been originally developed for D&F one-way relay channels, fully decentralized cooperative communication schemes are proposed for both A&F and D&F relays, where each relay is unaware of both the effective STBC being employed by the other nodes and the number of cooperating stations. Numerical results are provided to highlight the effectiveness of the proposed two-way relaying schemes in comparison to their one-way counterparts.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133605871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance analysis of dual-hop variable gain relay networks over Generalized-K fading channels","authors":"Omer Waqar, M. Ghogho, D. McLernon","doi":"10.1109/SPAWC.2010.5671081","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5671081","url":null,"abstract":"In this paper, we develop a new and comprehensive analytical framework for the performance analysis of variable gain dual-hop relay networks over generalized-K fading channels which are typically encountered in composite fading/shadowing environments. We propose a new and generic approach for deriving the closed-form expressions of the ergodic capacity1 of the dual-hop networks with variable gain relays considering a Generalized-K fading and its specific case of Nakagami-m fading. Furthermore, we show that at high average end-to-end signal-to-noise ratio (SNR), the average symbol error probability (ASEP) of the dual-hop variable gain relay network over Generalized-K fading channels can be closely approximated by the sum of the ASEP's of the two same single input single output (SISO) systems. Finally, we also derive a new closed-form expression of the moments of an upper-bound of the end-to-end SNR. Monte-Carlo simulations are also provided in order to validate the analytical framework.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115559369","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}
R. Andreotti, I. Stupia, F. Giannetti, V. Lottici, L. Vandendorpe
{"title":"Resource allocation in OFDMA underlay cognitive radio systems based on Ant Colony Optimization","authors":"R. Andreotti, I. Stupia, F. Giannetti, V. Lottici, L. Vandendorpe","doi":"10.1109/SPAWC.2010.5671014","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5671014","url":null,"abstract":"This paper1 deals with dynamic resource allocation problem for OFDMA-based cognitive radio systems. The proposed solution is specifically tailored for a secondary base stations (SBS) transmitting to secondary users (SUs) over the same bands of the licensed primary users (PUs) in underlay fashion. The downlink transmission goodput is thereby maximized while keeping the interference on the PUs within a tolerable range. The NP-hard goodput maximization problem is tackled resorting to an efficient meta-heuristic algorithm based on Ant Colony Optimization (ACO) framework.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129501343","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}