Pub Date : 2008-12-08DOI: 10.1109/PIMRC.2008.4699782
J. Jeganathan, A. Ghrayeb, L. Szczecinski
A fundamental component of spatial modulation (SM), termed generalized space shift keying (GSSK), is presented. GSSK modulation inherently exploits fading in wireless communication to provide better performance over conventional amplitude/phase modulation (APM) techniques. In GSSK, only the antenna indices, and not the symbols themselves (as in the case of SM and APM), relay information. We exploit GSSKpsilas degrees of freedom to achieve better performance, which is done by formulating its constellation in an optimal manner. To support our results, we also derive upper bounds on GSSKpsilas bit error probability, where the source of GSSKpsilas strength is made clear. Analytical and simulation results show performance gains (1.5-3 dB) over popular multiple antenna APM systems (including Bell Laboratories layered space time (BLAST) and maximum ratio combining (MRC) schemes), making GSSK an excellent candidate for future wireless applications.
{"title":"Generalized space shift keying modulation for MIMO channels","authors":"J. Jeganathan, A. Ghrayeb, L. Szczecinski","doi":"10.1109/PIMRC.2008.4699782","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699782","url":null,"abstract":"A fundamental component of spatial modulation (SM), termed generalized space shift keying (GSSK), is presented. GSSK modulation inherently exploits fading in wireless communication to provide better performance over conventional amplitude/phase modulation (APM) techniques. In GSSK, only the antenna indices, and not the symbols themselves (as in the case of SM and APM), relay information. We exploit GSSKpsilas degrees of freedom to achieve better performance, which is done by formulating its constellation in an optimal manner. To support our results, we also derive upper bounds on GSSKpsilas bit error probability, where the source of GSSKpsilas strength is made clear. Analytical and simulation results show performance gains (1.5-3 dB) over popular multiple antenna APM systems (including Bell Laboratories layered space time (BLAST) and maximum ratio combining (MRC) schemes), making GSSK an excellent candidate for future wireless applications.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122976239","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699467
Shingo Watanabe, Y. Kamiya, K. Umebayashi, Yasuo Suzuki
Wireless ad hoc networks attract interests of researchers. In such networks, data packets are relayed by nodes from a source node to a destination node. This is referred to as multi-hop communication. For such system, it is known that the IEEE802.11 DCF is not efficient. Then, in order to improve the efficiency, several methods were proposed conventionally. However, most of them are not aware of realistic radio environments considering multipath fading. Therefore, the conventional methods can be damaged seriously under multipath fading. In this paper, we propose a new MAC protocol for wireless ad hoc networks, that is robust against multipath fading.
{"title":"A new efficient and robust MAC protocol against multipath fading for ad hoc networks","authors":"Shingo Watanabe, Y. Kamiya, K. Umebayashi, Yasuo Suzuki","doi":"10.1109/PIMRC.2008.4699467","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699467","url":null,"abstract":"Wireless ad hoc networks attract interests of researchers. In such networks, data packets are relayed by nodes from a source node to a destination node. This is referred to as multi-hop communication. For such system, it is known that the IEEE802.11 DCF is not efficient. Then, in order to improve the efficiency, several methods were proposed conventionally. However, most of them are not aware of realistic radio environments considering multipath fading. Therefore, the conventional methods can be damaged seriously under multipath fading. In this paper, we propose a new MAC protocol for wireless ad hoc networks, that is robust against multipath fading.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114596554","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699610
C. Christophorou, A. Pitsillides
Handover Control is one of the essential means to guarantee the continuity of mobile services to a user traveling in a cellular infrastructure, without interruption. In previous work we illustrated that using the current 3GPP specified handover control algorithm to provide continuity of MBMS (Multimedia Broadcast Multicast Service) services to a user crossing cell boundaries results either in capacity or QoS inefficiencies and proposed a new MEHO (Mobile Evaluated Handover) based MBMS handover control algorithm that compensated for them. This algorithm, although effective in terms of capacity and QoS, has some limitations concerning the way certain parameters vital for the efficient MBMS handover execution are estimated. In this paper, using a different approach (Network Evaluated Handover (NEHO)), we enhance previous work and propose a different method, that eliminates all of its predecessorpsilas deficiencies while achieving the same capacity and QoS efficiencies.
{"title":"A NEHO based MBMS Handover Control approach","authors":"C. Christophorou, A. Pitsillides","doi":"10.1109/PIMRC.2008.4699610","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699610","url":null,"abstract":"Handover Control is one of the essential means to guarantee the continuity of mobile services to a user traveling in a cellular infrastructure, without interruption. In previous work we illustrated that using the current 3GPP specified handover control algorithm to provide continuity of MBMS (Multimedia Broadcast Multicast Service) services to a user crossing cell boundaries results either in capacity or QoS inefficiencies and proposed a new MEHO (Mobile Evaluated Handover) based MBMS handover control algorithm that compensated for them. This algorithm, although effective in terms of capacity and QoS, has some limitations concerning the way certain parameters vital for the efficient MBMS handover execution are estimated. In this paper, using a different approach (Network Evaluated Handover (NEHO)), we enhance previous work and propose a different method, that eliminates all of its predecessorpsilas deficiencies while achieving the same capacity and QoS efficiencies.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117256000","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699734
T. Takenaka, H. Mineno, T. Mizuno
We have developed a wireless multi-hop localization game, i.e., a war game, based on a classical field game. The players use mobile game consoles with ad-hoc networking capability and play the game on a field. The fundamental concept underlying a wireless multi-hop localization game is that players on a team establish an ad-hoc network to estimate their positions and then compete for positioning accuracy with other teams by using a multi-hop localization technique. Simulation revealed that velocity and obstruction position were the key parameters in playing the war game. The simulation results demonstrated that the proposed game made a good use of the ad-hoc networking capability.
{"title":"Evaluation of wireless multi-hop localization game for entertainment computing","authors":"T. Takenaka, H. Mineno, T. Mizuno","doi":"10.1109/PIMRC.2008.4699734","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699734","url":null,"abstract":"We have developed a wireless multi-hop localization game, i.e., a war game, based on a classical field game. The players use mobile game consoles with ad-hoc networking capability and play the game on a field. The fundamental concept underlying a wireless multi-hop localization game is that players on a team establish an ad-hoc network to estimate their positions and then compete for positioning accuracy with other teams by using a multi-hop localization technique. Simulation revealed that velocity and obstruction position were the key parameters in playing the war game. The simulation results demonstrated that the proposed game made a good use of the ad-hoc networking capability.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128238358","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699747
Jun-Zhao Sun
This paper presents a threshold based query processing method for continuous data gathering in sensor networks. The method is based on the flexible setting of thresholds and the analysis on the content to be sent over the network. Thresholds represent the accuracy requirement of the application issuing the queries. Thus at each single sensor node, instead of direct delivery of each result data, data communication is needed only when the current data is out of the range constrained by the thresholds. A series of static and dynamic algorithms are proposed for the flexible setting of threshold values. The performance of the proposed algorithms shows that the proposed methods can achieve better performance than without performing the optimization.
{"title":"Threshold-based processing for continuous query in wireless sensor networks","authors":"Jun-Zhao Sun","doi":"10.1109/PIMRC.2008.4699747","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699747","url":null,"abstract":"This paper presents a threshold based query processing method for continuous data gathering in sensor networks. The method is based on the flexible setting of thresholds and the analysis on the content to be sent over the network. Thresholds represent the accuracy requirement of the application issuing the queries. Thus at each single sensor node, instead of direct delivery of each result data, data communication is needed only when the current data is out of the range constrained by the thresholds. A series of static and dynamic algorithms are proposed for the flexible setting of threshold values. The performance of the proposed algorithms shows that the proposed methods can achieve better performance than without performing the optimization.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129903268","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699883
N. Yi, Y. Ma, R. Tafazolli
A transmitter with cognitive capability can sense talk between the other transmitter-receiver pairs. When this transmitter knows full or partial message of the others, it can choose an efficient strategy to access the transmission medium. This is referred to as cognitive radio channel. This work aims to investigate multi-tone transmission over two-user cognitive radio channels where cross-talk interference is weak. Cognitive transmitter (Ttimes1) is assumed to have full knowledge of message that is sent by the other transmitter (Ttimes2) to its corresponding receiver (Rtimes2). Channel capacity is carefully analyzed for frequency-selective scenarios. Efficient power-allocation strategies at Ttimes1 are investigated for various wireless environments. It is shown that Ttimes1 can find an efficient resource-accessing strategy if the channel gain of Ttimes1-Rtimes1 (the corresponding receiver) link is larger than the channel gain of Ttimes2-Rtimes2 link. In this case, the cognitive transmitter Ttimes1 can offer better performance by employing equal power allocation approach. Otherwise, it is not worthy for Ttimes1 to access transmission medium of Ttimes2-Rtimes2 link.
{"title":"Multi-tone transmissions over two-user cognitive radio channel with weak interference","authors":"N. Yi, Y. Ma, R. Tafazolli","doi":"10.1109/PIMRC.2008.4699883","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699883","url":null,"abstract":"A transmitter with cognitive capability can sense talk between the other transmitter-receiver pairs. When this transmitter knows full or partial message of the others, it can choose an efficient strategy to access the transmission medium. This is referred to as cognitive radio channel. This work aims to investigate multi-tone transmission over two-user cognitive radio channels where cross-talk interference is weak. Cognitive transmitter (Ttimes1) is assumed to have full knowledge of message that is sent by the other transmitter (Ttimes2) to its corresponding receiver (Rtimes2). Channel capacity is carefully analyzed for frequency-selective scenarios. Efficient power-allocation strategies at Ttimes1 are investigated for various wireless environments. It is shown that Ttimes1 can find an efficient resource-accessing strategy if the channel gain of Ttimes1-Rtimes1 (the corresponding receiver) link is larger than the channel gain of Ttimes2-Rtimes2 link. In this case, the cognitive transmitter Ttimes1 can offer better performance by employing equal power allocation approach. Otherwise, it is not worthy for Ttimes1 to access transmission medium of Ttimes2-Rtimes2 link.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130332024","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699716
C. Athaudage, M. Saito, J. Evans
In this paper, we analyze the capacity of orthogonal frequency division multiplexing (OFDM) systems with carrier frequency offset (CFO) in frequency-selective Nakagami-m fading channels. Previous work on this topic has not taken into account the frequency selectivity of the channel. In this work, we have explicitly attributed the effect of channel frequency selectivity, i.e. frequency domain correlations, in evaluating the OFDM system performance in the presence of CFO. A closed-form expression is derived of the probability density function (PDF) of the signal-to-interference-and-noise ratio (SINR) in terms of CFO and channel correlation vector. Capacity is evaluated using numerical integration. The frequency-flat fading scenario and the perfectly frequency-selective fading (uncorrelated subcarriers) scenario form the two extremes, i.e. bounds, of the achievable OFDM capacity in the presence of CFO in Nakagami-m fading channels.
{"title":"Capacity of OFDM systems in Nakagami-m fading channels: The role of channel frequency selectivity","authors":"C. Athaudage, M. Saito, J. Evans","doi":"10.1109/PIMRC.2008.4699716","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699716","url":null,"abstract":"In this paper, we analyze the capacity of orthogonal frequency division multiplexing (OFDM) systems with carrier frequency offset (CFO) in frequency-selective Nakagami-m fading channels. Previous work on this topic has not taken into account the frequency selectivity of the channel. In this work, we have explicitly attributed the effect of channel frequency selectivity, i.e. frequency domain correlations, in evaluating the OFDM system performance in the presence of CFO. A closed-form expression is derived of the probability density function (PDF) of the signal-to-interference-and-noise ratio (SINR) in terms of CFO and channel correlation vector. Capacity is evaluated using numerical integration. The frequency-flat fading scenario and the perfectly frequency-selective fading (uncorrelated subcarriers) scenario form the two extremes, i.e. bounds, of the achievable OFDM capacity in the presence of CFO in Nakagami-m fading channels.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130549806","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699440
Jean-Baptiste Landre, S. Wendt
The E-DCH transport channel uses multi-code transmission together with a special kind of QPSK modulation (BPSK modulation on I and Q axis) to achieve high throughput. On frequency selective channels the orthogonality between the spreading codes is lost and inter-code-interference (ICI) arises. This interference limits performances in case the base stations have a classical receiver (Rake), especially for HSUPA 5,76 Mbps mobiles. Realistic performances of those mobiles are shown in this paper. A new kind of simulation method, based on existing drive test measurements, is used. The measurements are combined with link level simulation results to obtain reliable performance estimation. Simulation results show that the throughput does not exceed 2,5 Mbps if the base stations have a Rake receiver.
{"title":"HSUPA 5,76 Mbps mobiles: Throughputs evaluation on a live network","authors":"Jean-Baptiste Landre, S. Wendt","doi":"10.1109/PIMRC.2008.4699440","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699440","url":null,"abstract":"The E-DCH transport channel uses multi-code transmission together with a special kind of QPSK modulation (BPSK modulation on I and Q axis) to achieve high throughput. On frequency selective channels the orthogonality between the spreading codes is lost and inter-code-interference (ICI) arises. This interference limits performances in case the base stations have a classical receiver (Rake), especially for HSUPA 5,76 Mbps mobiles. Realistic performances of those mobiles are shown in this paper. A new kind of simulation method, based on existing drive test measurements, is used. The measurements are combined with link level simulation results to obtain reliable performance estimation. Simulation results show that the throughput does not exceed 2,5 Mbps if the base stations have a Rake receiver.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130588724","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699933
J. Boudec, R. Merz
The Internet of Things, emerging pervasive and sensor networks are low data-rate wireless networks with, a priori, no specific topology and no fixed infrastructure. Their primary requirements are twofold: first, low power consumption and, due to environmental concerns, low emitted power. Second, robustness to poor propagation environments and multi-user interference. Impulse-radio ultra-wide band (IR-UWB) physical layers have the potential to satisfy these requirements. Because the features of IR-UWB physical layers differ from narrow-band physical layers, the design rules of IR-UWB networks are likely to be different than for narrow-band wireless networks. Indeed, to optimally use the resources available, it is crucial for the network layers to take into account and take advantage of the underlying physical layer. Therefore, we are interested in the design of IR-UWB networks in a low data-rate, self-organized, and multi-hop context. We concentrate on the medium access control (MAC) layer and the physical layer. In the case of low data-rate IR-UWB networks, the optimal design is to allow for parallel and concurrent transmissions at the MAC layer. Interference is managed with rate adaptation, no power control and an interference mitigation scheme at the physical layer. A protocol that implements the optimal design and allows for parallel transmissions outperforms protocols that use exclusion or power control.
{"title":"Concurrent and parallel transmissions are optimal for low data-rate IR-UWB networks","authors":"J. Boudec, R. Merz","doi":"10.1109/PIMRC.2008.4699933","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699933","url":null,"abstract":"The Internet of Things, emerging pervasive and sensor networks are low data-rate wireless networks with, a priori, no specific topology and no fixed infrastructure. Their primary requirements are twofold: first, low power consumption and, due to environmental concerns, low emitted power. Second, robustness to poor propagation environments and multi-user interference. Impulse-radio ultra-wide band (IR-UWB) physical layers have the potential to satisfy these requirements. Because the features of IR-UWB physical layers differ from narrow-band physical layers, the design rules of IR-UWB networks are likely to be different than for narrow-band wireless networks. Indeed, to optimally use the resources available, it is crucial for the network layers to take into account and take advantage of the underlying physical layer. Therefore, we are interested in the design of IR-UWB networks in a low data-rate, self-organized, and multi-hop context. We concentrate on the medium access control (MAC) layer and the physical layer. In the case of low data-rate IR-UWB networks, the optimal design is to allow for parallel and concurrent transmissions at the MAC layer. Interference is managed with rate adaptation, no power control and an interference mitigation scheme at the physical layer. A protocol that implements the optimal design and allows for parallel transmissions outperforms protocols that use exclusion or power control.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123968634","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699788
C. Esli, A. Wittneben
Two-way relaying, which enables bidirectional simultaneous data transmission between two nodes, is an efficient means to reduce the spectral efficiency loss observed in conventional half-duplex relaying schemes. In this paper, we consider a multiuser cellular two-way relaying scenario with several mobile stations (MSs) at one end of the bidirectional link and a single base station (BS) serving all MSs at the other end. Both the BS and the MSs exchange private messages simultaneously via a single relay node, i.e., concurrent uplink and downlink, in only two time slots, independent of the number of MSs. In the downlink, while the relay separates different MSs spatially, e.g., using either zero-forcing beamforming or zero-forcing dirty paper coding, it benefits from XOR precoding followed by self-interference cancellation, in order to separate messages within a message pair to be exchanged between the BS and each MS. The corresponding sum rate optimization problem is solved with an iterative algorithm based on semidefinite programming.
{"title":"Multiuser MIMO two-way relaying for cellular communications","authors":"C. Esli, A. Wittneben","doi":"10.1109/PIMRC.2008.4699788","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699788","url":null,"abstract":"Two-way relaying, which enables bidirectional simultaneous data transmission between two nodes, is an efficient means to reduce the spectral efficiency loss observed in conventional half-duplex relaying schemes. In this paper, we consider a multiuser cellular two-way relaying scenario with several mobile stations (MSs) at one end of the bidirectional link and a single base station (BS) serving all MSs at the other end. Both the BS and the MSs exchange private messages simultaneously via a single relay node, i.e., concurrent uplink and downlink, in only two time slots, independent of the number of MSs. In the downlink, while the relay separates different MSs spatially, e.g., using either zero-forcing beamforming or zero-forcing dirty paper coding, it benefits from XOR precoding followed by self-interference cancellation, in order to separate messages within a message pair to be exchanged between the BS and each MS. The corresponding sum rate optimization problem is solved with an iterative algorithm based on semidefinite programming.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123982392","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
扫码关注我们
求助内容：
应助结果提醒方式：