Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054782
M. Jiang, N. Prasad, Xiaodong Wang
DFT-Spread-OFDMA (DFT-S-OFDMA) technique has been adopted as the uplink access scheme in emerging cellular systems such as the 3GPP long term evolution (3GPP-LTE), in order to reduce the peak-to-average-power ratio (PAPR). In this scheme, data symbols are precoded using a DFT operation at the transmitter before being sent to the OFDM modulator. Moreover, emerging cellular systems will also deploy multiple antennas at the base-station to increase the transmission reliability and/or system capacity. The design of low-complexity, low-latency and high-performance receivers for such DFT-S-OFDMA systems is an important open problem that has hitherto received little attention. In this paper, three receivers are proposed and examined for such DFT-S-OFDMA systems, which include a highly efficient group soft demodulator (referred to as the GMLSD), an enhanced iterative block decision feedback equalizer (IBDFE) and the conventional linear minimum mean square error (LMMSE) receiver. Monte Carlo simulations are performed to compare the performance of the proposed receiver algorithms. It is shown that the GMLSD receiver is ideal for the DFT-S-OFDMA based systems due to its low complexity and superior performance.
{"title":"Design of efficient receivers for DFT-S-OFDMA systems","authors":"M. Jiang, N. Prasad, Xiaodong Wang","doi":"10.1109/CISS.2009.5054782","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054782","url":null,"abstract":"DFT-Spread-OFDMA (DFT-S-OFDMA) technique has been adopted as the uplink access scheme in emerging cellular systems such as the 3GPP long term evolution (3GPP-LTE), in order to reduce the peak-to-average-power ratio (PAPR). In this scheme, data symbols are precoded using a DFT operation at the transmitter before being sent to the OFDM modulator. Moreover, emerging cellular systems will also deploy multiple antennas at the base-station to increase the transmission reliability and/or system capacity. The design of low-complexity, low-latency and high-performance receivers for such DFT-S-OFDMA systems is an important open problem that has hitherto received little attention. In this paper, three receivers are proposed and examined for such DFT-S-OFDMA systems, which include a highly efficient group soft demodulator (referred to as the GMLSD), an enhanced iterative block decision feedback equalizer (IBDFE) and the conventional linear minimum mean square error (LMMSE) receiver. Monte Carlo simulations are performed to compare the performance of the proposed receiver algorithms. It is shown that the GMLSD receiver is ideal for the DFT-S-OFDMA based systems due to its low complexity and superior performance.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127332514","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054846
Christopher Keeser, B. Belzer, T. Fischer
We propose passive phase conjugation (PPC) with iterative demodulation and decoding for communication over the shallow underwater acoustic channel. PPC mitigates inter-symbol interference (ISI) caused by multipath in the channel. A softinput, soft-output (SISO) differential BPSK (DBPSK) demodulator and a SISO irregular repeat accumulate (IRA) channel decoder arranged in an iterative ‘turbo’ structure improve the bit error rate (BER) at higher symbol rates. A linear estimator tracks channel phase variations arising from Doppler effects and wave motion. The system was tested at Lake Pend Oreille in Idaho over a distance of 1.78 km in shallow water with BERs below 10−5 at 2,500 information bits per second.
{"title":"Shallow underwater communication with passive phase conjugation and iterative demodulation and decoding","authors":"Christopher Keeser, B. Belzer, T. Fischer","doi":"10.1109/CISS.2009.5054846","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054846","url":null,"abstract":"We propose passive phase conjugation (PPC) with iterative demodulation and decoding for communication over the shallow underwater acoustic channel. PPC mitigates inter-symbol interference (ISI) caused by multipath in the channel. A softinput, soft-output (SISO) differential BPSK (DBPSK) demodulator and a SISO irregular repeat accumulate (IRA) channel decoder arranged in an iterative ‘turbo’ structure improve the bit error rate (BER) at higher symbol rates. A linear estimator tracks channel phase variations arising from Doppler effects and wave motion. The system was tested at Lake Pend Oreille in Idaho over a distance of 1.78 km in shallow water with BERs below 10−5 at 2,500 information bits per second.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132313206","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054708
Ghadamali Bagherikaram, A. Motahari, A. Khandani
In this paper, we first consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-taper also receives the transmitted signal. We assume that the signals are transmitted over additive white Gaussian noise channels. We characterize the secrecy capacity region of this channel. Our achievable coding scheme is based on superposition coding and the random binning. We refer to this scheme as Secret Superposition Coding. The converse proof combines the converse proof for the conventional Gaussian broadcast channel and the perfect secrecy constraint. This capacity region matches the capacity region of the broadcast channel without security constraint. It also matches the secrecy capacity of the wire-tap channel. Based on the rate characterization of the secure Gaussian broadcast channel, we then use a multilevel coding approach for the slowly fading wire-tap. We assume that the transmitter only knows the eavesdropper's channel. In this approach, source node sends secure layered coding and the receiver viewed as a continuum ordered users. We derive optimum power allocation for the layers which maximizes the total average rate.
{"title":"Secrecy capacity region of Gaussian broadcast channel","authors":"Ghadamali Bagherikaram, A. Motahari, A. Khandani","doi":"10.1109/CISS.2009.5054708","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054708","url":null,"abstract":"In this paper, we first consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-taper also receives the transmitted signal. We assume that the signals are transmitted over additive white Gaussian noise channels. We characterize the secrecy capacity region of this channel. Our achievable coding scheme is based on superposition coding and the random binning. We refer to this scheme as Secret Superposition Coding. The converse proof combines the converse proof for the conventional Gaussian broadcast channel and the perfect secrecy constraint. This capacity region matches the capacity region of the broadcast channel without security constraint. It also matches the secrecy capacity of the wire-tap channel. Based on the rate characterization of the secure Gaussian broadcast channel, we then use a multilevel coding approach for the slowly fading wire-tap. We assume that the transmitter only knows the eavesdropper's channel. In this approach, source node sends secure layered coding and the receiver viewed as a continuum ordered users. We derive optimum power allocation for the layers which maximizes the total average rate.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127989628","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054793
Rick S. Blum, Zhemin Xu, Brian M. Sadler
We consider the sensor selection problem in a wireless sensor network attempting to solve a binary hypothesis testing problem. The selection is based only on the sensor observations and the focus is on the extreme case where the position of the sensors is not exploited except through its influence on the sensor observations. Decentralized processing approaches are desired. A subset of sensors are selected to transmit their observations to a fusion center where the hypothesis testing decision will be made. We propose three new sensor selection schemes based on observed data. The first scheme, called optimum sensor selection (OSS), uses all sensor observations to compute the metric used to rank each candidate subset. The second scheme, called selection by averaging over unseen sensors (SAUS), uses only the observations of the candidate subset to compute the ranking metric. The third approach, called GSAUS, is a distributed greedy sensor selection scheme based on SAUS. The performance of each proposed scheme is evaluated by Monte Carlo simulation for a Gaussian shift-in-mean hypothesis testing problem so that a comparison between the various sensor selection schemes can be performed. The results indicate that proper distributed selection approaches can provide performance close to the optimum centralized selection approaches and significant improvement over random selection, an approach which has been suggested in the past. A particular approach called the ordered magnitude log-likelihood ratio (OLLR) approach, which was suggested previously for a different problem formulation, looks especially attractive.
{"title":"Decentralized sensor selection based on sensor observations for energy efficient hypothesis testing","authors":"Rick S. Blum, Zhemin Xu, Brian M. Sadler","doi":"10.1109/CISS.2009.5054793","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054793","url":null,"abstract":"We consider the sensor selection problem in a wireless sensor network attempting to solve a binary hypothesis testing problem. The selection is based only on the sensor observations and the focus is on the extreme case where the position of the sensors is not exploited except through its influence on the sensor observations. Decentralized processing approaches are desired. A subset of sensors are selected to transmit their observations to a fusion center where the hypothesis testing decision will be made. We propose three new sensor selection schemes based on observed data. The first scheme, called optimum sensor selection (OSS), uses all sensor observations to compute the metric used to rank each candidate subset. The second scheme, called selection by averaging over unseen sensors (SAUS), uses only the observations of the candidate subset to compute the ranking metric. The third approach, called GSAUS, is a distributed greedy sensor selection scheme based on SAUS. The performance of each proposed scheme is evaluated by Monte Carlo simulation for a Gaussian shift-in-mean hypothesis testing problem so that a comparison between the various sensor selection schemes can be performed. The results indicate that proper distributed selection approaches can provide performance close to the optimum centralized selection approaches and significant improvement over random selection, an approach which has been suggested in the past. A particular approach called the ordered magnitude log-likelihood ratio (OLLR) approach, which was suggested previously for a different problem formulation, looks especially attractive.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121403656","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054830
Ran Ren, M. Fowler, N. Wu
In emitter geo-location estimation systems, it is well known that the geometry between sensors and the emitter can seriously impact the accuracy of the location estimate. Here we consider a case where a set of sensors is tasked to perform a sequence of location estimates on an emitter as the sensors progress throughout their trajectories. The goal is to select the trajectories so as to optimally improve the location estimate at each step in the sequence. To build the optimal trajectories, the aircraft, at their current locations, need to know their optimal next states at the time of next estimation, under the constraint of a reachable set due to limited reachable velocity or thrust. In this paper, we propose a one-step method to tackle the optimal next state(ONS) problem using the Particle Swarm Optimization(PSO) by solving the optimal amount of applied thrust along the flying trajectories. Simulation results show that the proposed method dramatically improves the estimation accuracy along the flying trajectories, compared to the random walk and constant velocity scheme. We also show that the estimation accuracy performance is also insensitive to the problem dimensionality.
{"title":"Finding optimal trajectory points for TDOA/FDOA geo-location sensors","authors":"Ran Ren, M. Fowler, N. Wu","doi":"10.1109/CISS.2009.5054830","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054830","url":null,"abstract":"In emitter geo-location estimation systems, it is well known that the geometry between sensors and the emitter can seriously impact the accuracy of the location estimate. Here we consider a case where a set of sensors is tasked to perform a sequence of location estimates on an emitter as the sensors progress throughout their trajectories. The goal is to select the trajectories so as to optimally improve the location estimate at each step in the sequence. To build the optimal trajectories, the aircraft, at their current locations, need to know their optimal next states at the time of next estimation, under the constraint of a reachable set due to limited reachable velocity or thrust. In this paper, we propose a one-step method to tackle the optimal next state(ONS) problem using the Particle Swarm Optimization(PSO) by solving the optimal amount of applied thrust along the flying trajectories. Simulation results show that the proposed method dramatically improves the estimation accuracy along the flying trajectories, compared to the random walk and constant velocity scheme. We also show that the estimation accuracy performance is also insensitive to the problem dimensionality.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116296392","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054815
George K. Papageorgiou, J. Baras
In this paper the interaction between the AIMD algorithm of TCP and the random access channel is investigated. In particular, we examine the effects of the MAC and the physical layer of the backward channel on the window size evolution of TCP. The problem of coupling the window size evolution of TCP with a random access channel is addressed using point processes and the theory of martingales.
{"title":"A simple model for the window size evolution of TCP coupled with MAC and PHY layers","authors":"George K. Papageorgiou, J. Baras","doi":"10.1109/CISS.2009.5054815","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054815","url":null,"abstract":"In this paper the interaction between the AIMD algorithm of TCP and the random access channel is investigated. In particular, we examine the effects of the MAC and the physical layer of the backward channel on the window size evolution of TCP. The problem of coupling the window size evolution of TCP with a random access channel is addressed using point processes and the theory of martingales.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115766426","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054704
Wenkai Wang, Husheng Li, Y. Sun, Zhu Han
Collaborative sensing in cognitive radio networks can significantly improve the probability of detecting the transmission of primary users. In current collaborative sensing schemes, all collaborative secondary users are assumed to be honest. As a consequence, the system is vulnerable to attacks in which malicious secondary users report false detection results. In this paper, we investigate how to improve the security of collaborative sensing. Particularly, we develop a malicious user detection algorithm that calculates the suspicious level of secondary users based on their past reports. Then, we calculate trust values as well as consistency values that are used to eliminate the malicious users' influence on the primary user detection results. Through simulations, we show that even a single malicious user can significantly degrade the performance of collaborative sensing. The proposed trust value indicator can effectively differentiate honest and malicious secondary users. The receiver operating characteristic (ROC) curves for the primary user detection demonstrate the improvement in the security of collaborative sensing.
{"title":"Attack-proof collaborative spectrum sensing in cognitive radio networks","authors":"Wenkai Wang, Husheng Li, Y. Sun, Zhu Han","doi":"10.1109/CISS.2009.5054704","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054704","url":null,"abstract":"Collaborative sensing in cognitive radio networks can significantly improve the probability of detecting the transmission of primary users. In current collaborative sensing schemes, all collaborative secondary users are assumed to be honest. As a consequence, the system is vulnerable to attacks in which malicious secondary users report false detection results. In this paper, we investigate how to improve the security of collaborative sensing. Particularly, we develop a malicious user detection algorithm that calculates the suspicious level of secondary users based on their past reports. Then, we calculate trust values as well as consistency values that are used to eliminate the malicious users' influence on the primary user detection results. Through simulations, we show that even a single malicious user can significantly degrade the performance of collaborative sensing. The proposed trust value indicator can effectively differentiate honest and malicious secondary users. The receiver operating characteristic (ROC) curves for the primary user detection demonstrate the improvement in the security of collaborative sensing.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114356513","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054753
Ashraf Al Daoud, M. Alanyali
We study secondary spectrum sharing in narrowband cellular networks in which calls in neighboring cells need to be assigned different channels. Analysis of such networks are in general difficult due to large state spaces and lack of closed form expressions. Here we consider linear topologies and show that they lend themselves to exact analysis. We analyze four sharing policies where equilibrium distribution of cell occupancies is a Markov random field. For each policy we derive closed form expressions for the equilibrium distributions in the form of a product of certain stochastic matrices. This characterization leads to tractable computation of equilibrium distributions and blocking probabilities. We use the obtained results to compare the policies in terms of (i) maximum revenue, and (ii) secondary price-demand pairs that lead to positive profit for the network service provider.
{"title":"On spectrum sharing in narrowband cellular wireless networks","authors":"Ashraf Al Daoud, M. Alanyali","doi":"10.1109/CISS.2009.5054753","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054753","url":null,"abstract":"We study secondary spectrum sharing in narrowband cellular networks in which calls in neighboring cells need to be assigned different channels. Analysis of such networks are in general difficult due to large state spaces and lack of closed form expressions. Here we consider linear topologies and show that they lend themselves to exact analysis. We analyze four sharing policies where equilibrium distribution of cell occupancies is a Markov random field. For each policy we derive closed form expressions for the equilibrium distributions in the form of a product of certain stochastic matrices. This characterization leads to tractable computation of equilibrium distributions and blocking probabilities. We use the obtained results to compare the policies in terms of (i) maximum revenue, and (ii) secondary price-demand pairs that lead to positive profit for the network service provider.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127389732","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054814
Beibei Wang, Zhu Han, K. Liu
Peer-to-peer (P2P) systems have become more and more popular in nowadays by providing decentralized, self-organizing and fault tolerant file sharing services. As the selfish users do not benefit from providing free service, they tend to download files from other users and yet not to upload for the others, resulting in low system efficiency. In this paper, we propose a correlated equilibrium-based file sharing game to enhance users' performance. We first characterize users' utility with their expected delay. Then, using the correlated equilibrium concept, instead of optimizing their own benefits alone, the users are aware of the best response for them to jointly optimize their strategies together and achieve the correlated equilibrium. Simulation results are presented to demonstrate the efficiency of the proposed scheme.
{"title":"Peer-to-peer file sharing game using correlated equilibrium","authors":"Beibei Wang, Zhu Han, K. Liu","doi":"10.1109/CISS.2009.5054814","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054814","url":null,"abstract":"Peer-to-peer (P2P) systems have become more and more popular in nowadays by providing decentralized, self-organizing and fault tolerant file sharing services. As the selfish users do not benefit from providing free service, they tend to download files from other users and yet not to upload for the others, resulting in low system efficiency. In this paper, we propose a correlated equilibrium-based file sharing game to enhance users' performance. We first characterize users' utility with their expected delay. Then, using the correlated equilibrium concept, instead of optimizing their own benefits alone, the users are aware of the best response for them to jointly optimize their strategies together and achieve the correlated equilibrium. Simulation results are presented to demonstrate the efficiency of the proposed scheme.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126246736","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054779
F. Iannello, O. Simeone
A Two-Way Relay Channels (TWRC) is studied over quasi-static fading channels by focusing on the throughput of Type-I HARQ strategies. An upper bound is evaluated, along with a number of achievable results obtained by proposing different protocols combining Type-I HARQ with standard amplify or decode-and-forward techniques or more sophisticated lattice code-based strategies. Performance comparison among the different protocols shows a trade-off between the achievable throughput and the system overhead required to obtain partial channel state information at the nodes.
{"title":"Throughput analysis of type-I HARQ strategies in Two-Way Relay Channels","authors":"F. Iannello, O. Simeone","doi":"10.1109/CISS.2009.5054779","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054779","url":null,"abstract":"A Two-Way Relay Channels (TWRC) is studied over quasi-static fading channels by focusing on the throughput of Type-I HARQ strategies. An upper bound is evaluated, along with a number of achievable results obtained by proposing different protocols combining Type-I HARQ with standard amplify or decode-and-forward techniques or more sophisticated lattice code-based strategies. Performance comparison among the different protocols shows a trade-off between the achievable throughput and the system overhead required to obtain partial channel state information at the nodes.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123810634","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
扫码关注我们
求助内容：
应助结果提醒方式：