Pub Date : 2013-12-11DOI: 10.1109/PIMRC.2013.6666160
Jianfei Cao, Dalin Zhu, M. Lei
Considering the time duplex division (TDD)-based cellular network, this paper investigates the uplink/downlink interference under the framework of centralized-radio access network (C-RAN). According to different uplink/downlink configurations within three neighboring cells, two fundamental cases are discussed, which can be further classified into several scenarios. For the sake of tackling this kind of interference, the interference alignment (IA) transceivers are studied case-by-case. Specifically, by applying the concept of reference vectors, to which direction the interference is to be aligned, we propose a simply methodology to align the interference at the un-intended receivers. Then with respect to the antenna settings, the heuristic process of IA design is presented and discussed. Finally, simulations verify the proposed IA transceivers greatly outperform its benchmark, when there is strong uplink/downlink inter-cell interference.
{"title":"Uplink-downlink interference alignment in TDD-based cellular networks","authors":"Jianfei Cao, Dalin Zhu, M. Lei","doi":"10.1109/PIMRC.2013.6666160","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666160","url":null,"abstract":"Considering the time duplex division (TDD)-based cellular network, this paper investigates the uplink/downlink interference under the framework of centralized-radio access network (C-RAN). According to different uplink/downlink configurations within three neighboring cells, two fundamental cases are discussed, which can be further classified into several scenarios. For the sake of tackling this kind of interference, the interference alignment (IA) transceivers are studied case-by-case. Specifically, by applying the concept of reference vectors, to which direction the interference is to be aligned, we propose a simply methodology to align the interference at the un-intended receivers. Then with respect to the antenna settings, the heuristic process of IA design is presented and discussed. Finally, simulations verify the proposed IA transceivers greatly outperform its benchmark, when there is strong uplink/downlink inter-cell interference.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"25 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131212307","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666316
Raphael Rolny, M. Kuhn, A. Wittneben
We consider the up- as well as downlink of a cellular network with multi-user multiple-input multiple-output (MIMO) communication and propose to turn the entire network into a two-hop network where a large amount of relays assist the bidirectional communication. To this end, many two-way relays are spread over the entire area of the network. In addition to introducing the concept of ubiquitous relaying, different two-way relaying protocols are developed, for amplify-and-forward (AF) as well as decode-and-forward (DF) relays. The goal is to efficiently apply two-way relaying to interference limited cellular networks. To achieve this, relaying is combined with a simple form of base station (BS) cooperation that allows canceling some interference terms. The relays are used to reduce the complexity at the terminal nodes and to improve the overall performance by distributed interference management. Our results show that the proposed concept can offer significant gains compared to a conventional multi-user MIMO strategy without relays.
{"title":"The relay carpet: Ubiquitous two-way relaying in cooperative cellular networks","authors":"Raphael Rolny, M. Kuhn, A. Wittneben","doi":"10.1109/PIMRC.2013.6666316","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666316","url":null,"abstract":"We consider the up- as well as downlink of a cellular network with multi-user multiple-input multiple-output (MIMO) communication and propose to turn the entire network into a two-hop network where a large amount of relays assist the bidirectional communication. To this end, many two-way relays are spread over the entire area of the network. In addition to introducing the concept of ubiquitous relaying, different two-way relaying protocols are developed, for amplify-and-forward (AF) as well as decode-and-forward (DF) relays. The goal is to efficiently apply two-way relaying to interference limited cellular networks. To achieve this, relaying is combined with a simple form of base station (BS) cooperation that allows canceling some interference terms. The relays are used to reduce the complexity at the terminal nodes and to improve the overall performance by distributed interference management. Our results show that the proposed concept can offer significant gains compared to a conventional multi-user MIMO strategy without relays.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134013596","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666345
Hussein Al-Shatri, Xiang Li, R. S. Ganesan, A. Klein, T. Weber
A scenario consisting of several single antenna source-destination node pairs communicating through multiple single antenna relays is considered. A two time-slot transmission scheme is considered. In the first time-slot, the source nodes transmit to both the relays and the destination nodes. Both the source nodes and the relays retransmit to the destination nodes in the second time-slot. As the relays cannot decode the received signals, an amplify and forward relaying strategy is assumed. In the present paper, the sum rate maximization problem is tackled. Due to the two transmissions of the source nodes and the two receptions of the destination nodes, there are temporal transmit and receive filters which can be optimized together with the relays' coefficients aiming at maximizing the sum rate. By partially adapting the filters and by introducing two sets of scaling factors, the sum rate maximization problem is reformulated as a tri-convex optimization problem. An iterative algorithm is proposed which maximizes the sum rate and guarantees a local optimum achievement. The results show that the proposed algorithm outperforms the previously proposed interference alignment scheme in all SNRs.
{"title":"Multi-convex optimization for sum rate maximization in multiuser relay networks","authors":"Hussein Al-Shatri, Xiang Li, R. S. Ganesan, A. Klein, T. Weber","doi":"10.1109/PIMRC.2013.6666345","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666345","url":null,"abstract":"A scenario consisting of several single antenna source-destination node pairs communicating through multiple single antenna relays is considered. A two time-slot transmission scheme is considered. In the first time-slot, the source nodes transmit to both the relays and the destination nodes. Both the source nodes and the relays retransmit to the destination nodes in the second time-slot. As the relays cannot decode the received signals, an amplify and forward relaying strategy is assumed. In the present paper, the sum rate maximization problem is tackled. Due to the two transmissions of the source nodes and the two receptions of the destination nodes, there are temporal transmit and receive filters which can be optimized together with the relays' coefficients aiming at maximizing the sum rate. By partially adapting the filters and by introducing two sets of scaling factors, the sum rate maximization problem is reformulated as a tri-convex optimization problem. An iterative algorithm is proposed which maximizes the sum rate and guarantees a local optimum achievement. The results show that the proposed algorithm outperforms the previously proposed interference alignment scheme in all SNRs.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133251168","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666435
Yuan Chen, B. Walke
A novel analytical framework is presented to evaluate resource consumption, error ratio and spectral efficiency on PHY, MAC and RLC layer in 3GPP LTE systems. Thereby, various aspects of the different LTE system layers are modeled: On PHY layer, association of user terminal to a radio access point, probabilistic radio channel states, adaptive modulation and coding, overhead in LTE radio frame, turbo coded M-QAM block error rate, and Chase combining are taken into account. On MAC layer, hybrid-ARQ protocol, resource assignment failure, and feedback misdetection are accounted for. On RLC layer, segmentation of a RLC SDU into several RLC PDUs, selective repeat - ARQ protocol, feedback loss, and timer for upcoming feedback to be waited for are considered. With the framework, various performance criteria can be evaluated: Resource consumption, error ratio and spectral efficiency are assessed as CDF for any location in a cell, multi-cell scenario map with expected value for each location, CDF for a cell, and expected value and percentile for a cell.
{"title":"Analysis of cell spectral efficiency in 3GPP LTE systems","authors":"Yuan Chen, B. Walke","doi":"10.1109/PIMRC.2013.6666435","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666435","url":null,"abstract":"A novel analytical framework is presented to evaluate resource consumption, error ratio and spectral efficiency on PHY, MAC and RLC layer in 3GPP LTE systems. Thereby, various aspects of the different LTE system layers are modeled: On PHY layer, association of user terminal to a radio access point, probabilistic radio channel states, adaptive modulation and coding, overhead in LTE radio frame, turbo coded M-QAM block error rate, and Chase combining are taken into account. On MAC layer, hybrid-ARQ protocol, resource assignment failure, and feedback misdetection are accounted for. On RLC layer, segmentation of a RLC SDU into several RLC PDUs, selective repeat - ARQ protocol, feedback loss, and timer for upcoming feedback to be waited for are considered. With the framework, various performance criteria can be evaluated: Resource consumption, error ratio and spectral efficiency are assessed as CDF for any location in a cell, multi-cell scenario map with expected value for each location, CDF for a cell, and expected value and percentile for a cell.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128798008","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666296
Yuli Yang, Hao Ma, S. Aïssa
In this work, we consider a cooperative network where multiple relay nodes having different modulation capabilities assist the end-to-end communication between a source and its destination. Firstly, we evaluate the effective capacity (EC) performance of the network under study. According to the analysis, an EC-based relay selection criterion is proposed. Based on the proposed selection rule and half-duplex decode-and-forward protocol, the activated relays cooperatively help with the packet transmission from the source. At the destination, packet combining is taken into account to improve the quality of service. Compared to the popular scheme, opportunistic relay selection, numerical results are provided to prove the validity and advantages of our proposed scheme in certain scenarios. Moreover, the analysis presented herein offers a convenient tool to the relaying transmission design, specifically on which relay selection scheme should be used as well as how to choose the receiving strategy between with and without packet combining at the destination.
{"title":"Relay selection from an effective capacity perspective","authors":"Yuli Yang, Hao Ma, S. Aïssa","doi":"10.1109/PIMRC.2013.6666296","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666296","url":null,"abstract":"In this work, we consider a cooperative network where multiple relay nodes having different modulation capabilities assist the end-to-end communication between a source and its destination. Firstly, we evaluate the effective capacity (EC) performance of the network under study. According to the analysis, an EC-based relay selection criterion is proposed. Based on the proposed selection rule and half-duplex decode-and-forward protocol, the activated relays cooperatively help with the packet transmission from the source. At the destination, packet combining is taken into account to improve the quality of service. Compared to the popular scheme, opportunistic relay selection, numerical results are provided to prove the validity and advantages of our proposed scheme in certain scenarios. Moreover, the analysis presented herein offers a convenient tool to the relaying transmission design, specifically on which relay selection scheme should be used as well as how to choose the receiving strategy between with and without packet combining at the destination.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116333209","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666589
Tao Tao, Bo Zhao, A. Czylwik
In this paper, we focus on a half-duplex downlink cellular system with relay cooperation. We consider the beam-forming design problem with a limited amount of feedback for channel state information (CSI), which is only available at the receiver side. Based on this structure, we calculate the sum-rate lower bound when zero forcing (ZF) or eigen-beamforming is implemented at the macro base station and relay station. With the lower bound, we optimize the numbers of feedback bits for quantizing the desired and interfering channels and propose an adaptive beamforming strategy with limited feedback which selects a suitable beamforming scheme from ZF or eigen-beamforming based on the received interference and noise power level of the users. Simulation result shows that the bit partitioning algorithm outperforms the equal bit distribution scheme especially when the signal to noise ratio (SNR) is large. In addition, our proposed adaptive beamforming strategy outperforms existing schemes in different interference scenarios.
{"title":"Beamforming design for a cooperative relay system with limited feedback","authors":"Tao Tao, Bo Zhao, A. Czylwik","doi":"10.1109/PIMRC.2013.6666589","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666589","url":null,"abstract":"In this paper, we focus on a half-duplex downlink cellular system with relay cooperation. We consider the beam-forming design problem with a limited amount of feedback for channel state information (CSI), which is only available at the receiver side. Based on this structure, we calculate the sum-rate lower bound when zero forcing (ZF) or eigen-beamforming is implemented at the macro base station and relay station. With the lower bound, we optimize the numbers of feedback bits for quantizing the desired and interfering channels and propose an adaptive beamforming strategy with limited feedback which selects a suitable beamforming scheme from ZF or eigen-beamforming based on the received interference and noise power level of the users. Simulation result shows that the bit partitioning algorithm outperforms the equal bit distribution scheme especially when the signal to noise ratio (SNR) is large. In addition, our proposed adaptive beamforming strategy outperforms existing schemes in different interference scenarios.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116658299","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666652
H. Huang, Jia-ming Liang, Jen-Jee Chen, Y. Tseng
Power saving for mobile stations (MSs) is one of the most critical issues in IEEE 802.16j relay networks. To reduce power consumption of MSs, IEEE 802.16j borrows the sleep mode of 802.16e, but new parameters are introduced. Up to now, no previous work has addressed the sleep scheduling problem in IEEE 802.16j networks. Therefore, this paper proposes an energy-efficient, standard-compliant sleep scheduling scheme which involves relay stations (RSs) and realizes spatial reuse on RS transmissions to minimize energy consumption of MSs while guaranteeing their QoS. The main idea of the proposed scheme is to interleave the sleep patterns of MSs and exploit spatial reuse on MS-RS transmissions to reduce resource consumption while enlarging the available frame space. Comprehensive simulation has been conducted to verify the effeteness of our scheduling scheme. It shows that our scheme can serve more requests of MSs while increasing their sleep ratios.
{"title":"Sleep scheduling in IEEE 802.16j relay networks","authors":"H. Huang, Jia-ming Liang, Jen-Jee Chen, Y. Tseng","doi":"10.1109/PIMRC.2013.6666652","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666652","url":null,"abstract":"Power saving for mobile stations (MSs) is one of the most critical issues in IEEE 802.16j relay networks. To reduce power consumption of MSs, IEEE 802.16j borrows the sleep mode of 802.16e, but new parameters are introduced. Up to now, no previous work has addressed the sleep scheduling problem in IEEE 802.16j networks. Therefore, this paper proposes an energy-efficient, standard-compliant sleep scheduling scheme which involves relay stations (RSs) and realizes spatial reuse on RS transmissions to minimize energy consumption of MSs while guaranteeing their QoS. The main idea of the proposed scheme is to interleave the sleep patterns of MSs and exploit spatial reuse on MS-RS transmissions to reduce resource consumption while enlarging the available frame space. Comprehensive simulation has been conducted to verify the effeteness of our scheduling scheme. It shows that our scheme can serve more requests of MSs while increasing their sleep ratios.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114128505","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666459
Eleni Stai, S. Papavassiliou, J. Baras
Achieving high Quality of Service (QoS) over wireless multihop networks calls for enhanced routing/scheduling algorithms. Towards this direction it has been shown in the literature that the Greedy Backpressure algorithm which combines routing based on greedy hyperbolic embedding with backpressure scheduling, achieves to improve delay while remains throughput optimal. However, the performance of such an approach is significantly affected by the selection of the corresponding spanning tree used for greedily embedding the network into the hyperbolic space. Our work aims exactly at addressing this issue, that is the construction of an appropriate spanning tree that improves the cost of the paths used by the Greedy Backpressure approach, when considering a more generic weighted network graph modeling. The latter allows us to take into consideration the link costs in the routing process, which in turn may result in the simultaneous improvement of multiple performance metrics. To address the problem under consideration, we propose a coalition formation game framework among the network nodes, so that they can decide cooperatively for the spanning tree, via trading their value functions designed to depend on the link weights. We prove that the stable outcome of the coalitional game is a spanning tree of the network, and study through simulations the induced improvement in the network performance. Furthermore, we extend the framework for a scenario with multiple costs on each link through multi-tree hyperbolic embedding.
{"title":"A coalitional game based approach for multi-metric optimal routing in wireless networks","authors":"Eleni Stai, S. Papavassiliou, J. Baras","doi":"10.1109/PIMRC.2013.6666459","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666459","url":null,"abstract":"Achieving high Quality of Service (QoS) over wireless multihop networks calls for enhanced routing/scheduling algorithms. Towards this direction it has been shown in the literature that the Greedy Backpressure algorithm which combines routing based on greedy hyperbolic embedding with backpressure scheduling, achieves to improve delay while remains throughput optimal. However, the performance of such an approach is significantly affected by the selection of the corresponding spanning tree used for greedily embedding the network into the hyperbolic space. Our work aims exactly at addressing this issue, that is the construction of an appropriate spanning tree that improves the cost of the paths used by the Greedy Backpressure approach, when considering a more generic weighted network graph modeling. The latter allows us to take into consideration the link costs in the routing process, which in turn may result in the simultaneous improvement of multiple performance metrics. To address the problem under consideration, we propose a coalition formation game framework among the network nodes, so that they can decide cooperatively for the spanning tree, via trading their value functions designed to depend on the link weights. We prove that the stable outcome of the coalitional game is a spanning tree of the network, and study through simulations the induced improvement in the network performance. Furthermore, we extend the framework for a scenario with multiple costs on each link through multi-tree hyperbolic embedding.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126364448","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666282
C. Schneider, Naveed Iqbal, R. Thomä
Within this contribution the robustness and reliability of MIMO order (MOS) and antenna subset selection (AS) procedures has been studied. We considered AS for spatial multiplex (SM) systems, where the total power is distributed equally among selected antennas. MIMO channel data sets from a channel sounding campaign in an urban macro cell scenario have been used for advanced performance evaluation. At first, we studied correlation characteristics along various measurement tracks with single and dual polarized antenna configurations. We found that even under NLOS high correlation between antenna elements appears. Based on channel correlation at the transmit side and the receive SNR we discussed different methods for adaptive switching of the number of active RF modules and followed by optimized antenna subset selection (AS). Until a certain SNR threshold our novel low complex proposals perfectly follow the known algorithms from literature.
{"title":"Performance of MIMO order and antenna subset selection in realistic urban macro cell","authors":"C. Schneider, Naveed Iqbal, R. Thomä","doi":"10.1109/PIMRC.2013.6666282","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666282","url":null,"abstract":"Within this contribution the robustness and reliability of MIMO order (MOS) and antenna subset selection (AS) procedures has been studied. We considered AS for spatial multiplex (SM) systems, where the total power is distributed equally among selected antennas. MIMO channel data sets from a channel sounding campaign in an urban macro cell scenario have been used for advanced performance evaluation. At first, we studied correlation characteristics along various measurement tracks with single and dual polarized antenna configurations. We found that even under NLOS high correlation between antenna elements appears. Based on channel correlation at the transmit side and the receive SNR we discussed different methods for adaptive switching of the number of active RF modules and followed by optimized antenna subset selection (AS). Until a certain SNR threshold our novel low complex proposals perfectly follow the known algorithms from literature.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121740267","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666443
C. Cano, D. Malone
The standardized Medium Access Control (MAC) protocols for Power Line Communication (PLC) networks (Homeplug and IEEE 1901) are based on the Distributed Coordination Function (DCF) defined for IEEE 802.11. However, the backoff procedure is modified with the goal of decreasing the collision probability. In this work, the backoff procedure of PLC MAC protocols is compared to DCF in different traffic conditions and scenarios, including scenarios with all nodes in coverage range as well as topologies with hidden and exposed terminal problems. The goal is to demonstrate and quantify the pros and cons of each approach in each particular case. Results show that the modified backoff procedure of the Homeplug MAC reduces the collision probability when there is high contention. However, the performance is not always improved compared to DCF. Moreover, when Homeplug provides better performance than the vanilla DCF, we show that the DCF can be easily tuned to achieve similar gains.
{"title":"Evaluation of the backoff procedure of Homeplug MAC vs. DCF","authors":"C. Cano, D. Malone","doi":"10.1109/PIMRC.2013.6666443","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666443","url":null,"abstract":"The standardized Medium Access Control (MAC) protocols for Power Line Communication (PLC) networks (Homeplug and IEEE 1901) are based on the Distributed Coordination Function (DCF) defined for IEEE 802.11. However, the backoff procedure is modified with the goal of decreasing the collision probability. In this work, the backoff procedure of PLC MAC protocols is compared to DCF in different traffic conditions and scenarios, including scenarios with all nodes in coverage range as well as topologies with hidden and exposed terminal problems. The goal is to demonstrate and quantify the pros and cons of each approach in each particular case. Results show that the modified backoff procedure of the Homeplug MAC reduces the collision probability when there is high contention. However, the performance is not always improved compared to DCF. Moreover, when Homeplug provides better performance than the vanilla DCF, we show that the DCF can be easily tuned to achieve similar gains.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131408421","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
扫码关注我们
求助内容：
应助结果提醒方式：