Pub Date : 2013-12-02DOI: 10.1109/WCSP.2013.6677145
Linqiong Jia, Wence Zhang, Zhaohui Yang, Chunhua Ma, Ming Chen
The problem of cell sites planning in a given service area in LTE cellular networks is studied in this paper, the optimization objective of which is to minimize the power consumption of both users and cell sites under the constraint of cell load balancing. Non-uniform traffic distributions across the entire service area are considered. An efficient algorithm is proposed, which first works out a proper range of the optimal sites number, and then determines the cell sites locations for each number in the range by iteratively solving a convex problem to minimize the power consumption of both users and cell sites. The optimal cell sites number is the one with minimal power consumption and the locations are determined accordingly. An example scenario is presented to demonstrate the convergence and effectiveness of the proposed algorithm.
{"title":"Cell sites planning with minimized power consumption under cell load balancing constraint in LTE networks","authors":"Linqiong Jia, Wence Zhang, Zhaohui Yang, Chunhua Ma, Ming Chen","doi":"10.1109/WCSP.2013.6677145","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677145","url":null,"abstract":"The problem of cell sites planning in a given service area in LTE cellular networks is studied in this paper, the optimization objective of which is to minimize the power consumption of both users and cell sites under the constraint of cell load balancing. Non-uniform traffic distributions across the entire service area are considered. An efficient algorithm is proposed, which first works out a proper range of the optimal sites number, and then determines the cell sites locations for each number in the range by iteratively solving a convex problem to minimize the power consumption of both users and cell sites. The optimal cell sites number is the one with minimal power consumption and the locations are determined accordingly. An example scenario is presented to demonstrate the convergence and effectiveness of the proposed algorithm.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125942817","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}
Frequency allocation and scrambling code allocation are challenging issues for TD-SCDMA networks. Proper allocation schemes should not only meet traffic volume requirement and networking constraints, but suppress intercell interference effectively as well. This paper investigates joint frequency and scrambling code allocation, in order to take full use of the freedom degrees owned by these two resources and thus suppress interference to the greatest extent. A complete model of intercell interference is established, taking radio propagation condition, traffic distribution, frequency orthogonality and code correlation into consideration. A novel two-step joint allocation algorithm is proposed, with joint frequency and scrambling code family allocation in the first step and then scrambling code selection in the second step. Therefore, the minimum interference is achieved by the joint allocation, and computational complexity is greatly reduced by the two-step implementation. Numerical results show that in interference suppression point of view, our proposed joint allocation outperforms the sequential allocation commonly used in engineering.
{"title":"Joint frequency and scrambling code allocation for TD-SCDMA cellular network optimization","authors":"Cheng Wang, Zhouyun Wu, Aiping Huang, Hangguan Shan, Liang Shen, Zhoushi Xiong","doi":"10.1109/WCSP.2013.6677250","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677250","url":null,"abstract":"Frequency allocation and scrambling code allocation are challenging issues for TD-SCDMA networks. Proper allocation schemes should not only meet traffic volume requirement and networking constraints, but suppress intercell interference effectively as well. This paper investigates joint frequency and scrambling code allocation, in order to take full use of the freedom degrees owned by these two resources and thus suppress interference to the greatest extent. A complete model of intercell interference is established, taking radio propagation condition, traffic distribution, frequency orthogonality and code correlation into consideration. A novel two-step joint allocation algorithm is proposed, with joint frequency and scrambling code family allocation in the first step and then scrambling code selection in the second step. Therefore, the minimum interference is achieved by the joint allocation, and computational complexity is greatly reduced by the two-step implementation. Numerical results show that in interference suppression point of view, our proposed joint allocation outperforms the sequential allocation commonly used in engineering.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129301645","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-02DOI: 10.1109/WCSP.2013.6677281
Xiao Cai, Zhaoyang Zhang, C. Zhong
A novel algorithm called Cooperative Binary Iterative Hard Thresholding (CB-IHT) based on distributed 1-bit compressive sensing is proposed in this paper. Taking advantage of the correlated nature of distributed signal processing, the proposed algorithm is aimed to fight against the error floor in the estimation of distorted sparse signal, with an array of agents recovering the target signal cooperatively. The principles of convex optimization, consistent reconstruction and greedy pursuit algorithm are combined in the algorithm design. With two joint sparsity models representing distortion of equivalent parallel AWGN channels and parallel fading channels separately, the algorithm is performed through extensive simulations, which show that with severe distortion and large bit-budget, estimation accuracy can be improved by simply increasing the array scale.
{"title":"Distorted sparse signal estimation from distributed sign measurements","authors":"Xiao Cai, Zhaoyang Zhang, C. Zhong","doi":"10.1109/WCSP.2013.6677281","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677281","url":null,"abstract":"A novel algorithm called Cooperative Binary Iterative Hard Thresholding (CB-IHT) based on distributed 1-bit compressive sensing is proposed in this paper. Taking advantage of the correlated nature of distributed signal processing, the proposed algorithm is aimed to fight against the error floor in the estimation of distorted sparse signal, with an array of agents recovering the target signal cooperatively. The principles of convex optimization, consistent reconstruction and greedy pursuit algorithm are combined in the algorithm design. With two joint sparsity models representing distortion of equivalent parallel AWGN channels and parallel fading channels separately, the algorithm is performed through extensive simulations, which show that with severe distortion and large bit-budget, estimation accuracy can be improved by simply increasing the array scale.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129666653","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-02DOI: 10.1109/WCSP.2013.6677206
Mi Hu, J. Ge, Xiaoye Shi
In this paper, we study the optimal power allocation (OPA) for the two-way relay channel employing the analogue network coding (ANC) protocol in cognitive radio (CR) network. The OPA scheme is proposed by minimizing the weaker link's individual outage probability under the sum-power constraint and interference power threshold (IPT) constraints to the primary user (PU) in a Rayleigh fading channel environment. Particularly, for the purpose of accomplishing the power allocation more realistically, the interference to each other between PU and secondary user (SU) and relay is taken into consideration. And the closed-form solution for the optimum power allocation scheme of each case is derived. Numerical Results confirm that the system with the proposed scheme for the two-way relaying with ANC has a gain of 3dB over the equal power allocation (EPA) scheme no matter with or without IPT. When introduced IPT constraints into the optimization scheme, the outage probability of SU communication cannot be reduced after a certain level of total power, even though the total power is sufficient. Meanwhile, the best location for the relay is near by the middle point of the two end nodes regardless of the power allocation scheme.
{"title":"Optimal power allocation scheme for the two-way relay channel using ANC in cognitive radio","authors":"Mi Hu, J. Ge, Xiaoye Shi","doi":"10.1109/WCSP.2013.6677206","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677206","url":null,"abstract":"In this paper, we study the optimal power allocation (OPA) for the two-way relay channel employing the analogue network coding (ANC) protocol in cognitive radio (CR) network. The OPA scheme is proposed by minimizing the weaker link's individual outage probability under the sum-power constraint and interference power threshold (IPT) constraints to the primary user (PU) in a Rayleigh fading channel environment. Particularly, for the purpose of accomplishing the power allocation more realistically, the interference to each other between PU and secondary user (SU) and relay is taken into consideration. And the closed-form solution for the optimum power allocation scheme of each case is derived. Numerical Results confirm that the system with the proposed scheme for the two-way relaying with ANC has a gain of 3dB over the equal power allocation (EPA) scheme no matter with or without IPT. When introduced IPT constraints into the optimization scheme, the outage probability of SU communication cannot be reduced after a certain level of total power, even though the total power is sufficient. Meanwhile, the best location for the relay is near by the middle point of the two end nodes regardless of the power allocation scheme.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124603033","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-02DOI: 10.1109/WCSP.2013.6677099
Yu-zhen Huang, F. Al-Qahtani, C. Zhong, Qi-hui Wu
This paper investigate the impact of primary transceivers on the outage performance of a dual-hop decode-and-forward (DF) spectrum sharing relay system with multiple secondary user (SU) destinations in Nakagami-m fading channels. To doing so, we derive new exact and asymptotic closed-form expressions for the outage probability of spectrum sharing relay systems employing the opportunistic scheduling algorithm, which readily enable us to characterize the impact of various key system parameters on the outage performance of the system. Monte Carlo simulation results are provided to verify the theoretical analysis and evaluate the effects of channel fading severity, SU relay placement, and number of SU destinations. The finding of this paper suggests that the interference temperature constraint results in the outage saturation phenomenon and zero diversity gain of spectrum sharing relay systems.
{"title":"Outage analysis of spectrum sharing relay systems with multi-secondary destinations in the presence of primary user's interference","authors":"Yu-zhen Huang, F. Al-Qahtani, C. Zhong, Qi-hui Wu","doi":"10.1109/WCSP.2013.6677099","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677099","url":null,"abstract":"This paper investigate the impact of primary transceivers on the outage performance of a dual-hop decode-and-forward (DF) spectrum sharing relay system with multiple secondary user (SU) destinations in Nakagami-m fading channels. To doing so, we derive new exact and asymptotic closed-form expressions for the outage probability of spectrum sharing relay systems employing the opportunistic scheduling algorithm, which readily enable us to characterize the impact of various key system parameters on the outage performance of the system. Monte Carlo simulation results are provided to verify the theoretical analysis and evaluate the effects of channel fading severity, SU relay placement, and number of SU destinations. The finding of this paper suggests that the interference temperature constraint results in the outage saturation phenomenon and zero diversity gain of spectrum sharing relay systems.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121611842","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-02DOI: 10.1109/WCSP.2013.6677208
Cunhua Pan, Bo Du, Cailuan Su, Lei Wu, Ming Chen
This paper studies the jointly distributed transceiver design for time-division-duplex (TDD) multicell downlink systems where there is no exchange information between the Base Stations (BSs). With an aim to minimize the sum MSE under per-BS power constraint, we give a hierarchical iterative algorithm which can be implemented in a distributed manner with low complexity. The algorithm is described as follows. First, with given precoders, the equalizers are updated by MMSE method. Second, by keeping the equalizers fixed, the original problem is convex in precoders and the precoders can be solved with the aid of KKT conditions. Finally, repeat the above steps until the algorithm converges. The proof of the convergence and the analysis of the complexity are given as well. Simulation results show that the proposed algorithm is converged within few iterations and outperforms the existing distributed algorithms.
{"title":"Jointly distributed transceiver design for multicell systems with low complexity","authors":"Cunhua Pan, Bo Du, Cailuan Su, Lei Wu, Ming Chen","doi":"10.1109/WCSP.2013.6677208","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677208","url":null,"abstract":"This paper studies the jointly distributed transceiver design for time-division-duplex (TDD) multicell downlink systems where there is no exchange information between the Base Stations (BSs). With an aim to minimize the sum MSE under per-BS power constraint, we give a hierarchical iterative algorithm which can be implemented in a distributed manner with low complexity. The algorithm is described as follows. First, with given precoders, the equalizers are updated by MMSE method. Second, by keeping the equalizers fixed, the original problem is convex in precoders and the precoders can be solved with the aid of KKT conditions. Finally, repeat the above steps until the algorithm converges. The proof of the convergence and the analysis of the complexity are given as well. Simulation results show that the proposed algorithm is converged within few iterations and outperforms the existing distributed algorithms.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121024116","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}
Wireless data rates are prodicted to increase 1000 fold by 2020 and likely go up to 10,000 times by 2025. To meet the explosive growth in traffic during the next fifteen years, significant improvement in spectral efficiency is required. One of the promising innovative technologies to meet the above requirements is the massive MIMO technology adopting in large-scale antenna array system. The MIMO channel formed by the massive MIMO technology is likely to be very asymmetric and the number of possible independent data streams for transmission is limited by the number of antennas at the mobile station. Thus MU-MIMO (multi-user MIMO), which offer spatial multiplexing gain without the requirement of multiple antenna arrays at the mobile station, is very worthy of study in large scale antenna array system. In this paper, we give a formula of SINR prediction based on MU-MIMO in large scale antenna array system. Using the formula, a base station could easily predict the capacity loss because of non-deal Channel State Information (CSI), and then choose MIMO mode(e.g. adaptive switching between Single User-MIMO and MU-MIMO) or the best paired users properly in MU-MIMO system. Simulation results show the rationality of the formula.
{"title":"SINR prediction based on MU-MIMO in large scale antenna array system","authors":"Zhaohua Lu, Dengkui Zhu, Xiaodan Zhang, Xianming Chen","doi":"10.1109/WCSP.2013.6677060","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677060","url":null,"abstract":"Wireless data rates are prodicted to increase 1000 fold by 2020 and likely go up to 10,000 times by 2025. To meet the explosive growth in traffic during the next fifteen years, significant improvement in spectral efficiency is required. One of the promising innovative technologies to meet the above requirements is the massive MIMO technology adopting in large-scale antenna array system. The MIMO channel formed by the massive MIMO technology is likely to be very asymmetric and the number of possible independent data streams for transmission is limited by the number of antennas at the mobile station. Thus MU-MIMO (multi-user MIMO), which offer spatial multiplexing gain without the requirement of multiple antenna arrays at the mobile station, is very worthy of study in large scale antenna array system. In this paper, we give a formula of SINR prediction based on MU-MIMO in large scale antenna array system. Using the formula, a base station could easily predict the capacity loss because of non-deal Channel State Information (CSI), and then choose MIMO mode(e.g. adaptive switching between Single User-MIMO and MU-MIMO) or the best paired users properly in MU-MIMO system. Simulation results show the rationality of the formula.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116323533","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-02DOI: 10.1109/WCSP.2013.6677115
Lijuan Cao, Wenjun Xu, Xuehong Lin, Jiaru Lin
The MAC protocol can minimize simultaneous channel access attempts in an effort to decrease the interference and thereby increases reliability, which is vitally important for VANETs (vehicle ad hoc networks). In this paper, an adaptive hybrid MAC (Medium Access Control) scheme is proposed for VANETs, in which the transmission frame is split dynamically into two parts according to the traffic load. In the first part, CSMA/CA (Carrier Sense Multiple Access method with Collision Avoidance) is adopted as the access technology, and in the second one, STDMA (Self-organizing Time Division Multiple Access) is exploited. We implement simulations with various traffic loads in the MATLAB platform, and the simulation results show that the proposed scheme is reliable and can achieve better performance in channel access delay and packet drop probability than both pure CSMA/CA and STDMA schemes.
MAC协议可以最大限度地减少同时通道访问尝试，以减少干扰，从而提高可靠性，这对vanet(车辆自组织网络)至关重要。本文提出了一种针对vanet的自适应混合介质访问控制(MAC)方案，该方案将传输帧根据业务负载动态拆分为两部分。第一部分采用CSMA/CA (Carrier Sense Multiple Access method with Collision Avoidance)作为接入技术，第二部分采用自组织时分多址(STDMA)技术。仿真结果表明，该方案可靠，在信道接入时延和丢包概率方面均优于纯CSMA/CA和STDMA方案。
{"title":"A CSMA/TDMA dynamic splitting scheme for MAC protocol in VANETs","authors":"Lijuan Cao, Wenjun Xu, Xuehong Lin, Jiaru Lin","doi":"10.1109/WCSP.2013.6677115","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677115","url":null,"abstract":"The MAC protocol can minimize simultaneous channel access attempts in an effort to decrease the interference and thereby increases reliability, which is vitally important for VANETs (vehicle ad hoc networks). In this paper, an adaptive hybrid MAC (Medium Access Control) scheme is proposed for VANETs, in which the transmission frame is split dynamically into two parts according to the traffic load. In the first part, CSMA/CA (Carrier Sense Multiple Access method with Collision Avoidance) is adopted as the access technology, and in the second one, STDMA (Self-organizing Time Division Multiple Access) is exploited. We implement simulations with various traffic loads in the MATLAB platform, and the simulation results show that the proposed scheme is reliable and can achieve better performance in channel access delay and packet drop probability than both pure CSMA/CA and STDMA schemes.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121479508","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-02DOI: 10.1109/WCSP.2013.6677041
A. Awang, Shobhit Agarwal
In Wireless Sensor Networks (WSNs), sensor nodes are often deployed in large quantity and high density. Due to dense deployment, the sensed data are often redundant and highly correlated. Transmitting redundant data is not practical in the resource-constrained WSNs particularly from the viewpoint of energy conservation. Data aggregation offers a key solution to curtail the network loads and hence reduces the transmission energy consumption. In this work, we propose two data aggregation mechanisms (class-based and alpha-based) that aggregate and route data packet based on Received Signal Strength Indicator (RSSI). Each node maintains an RSSI value with respect to a sink node. When a data packet is generated, an aggregation identification (Agg ID) is associated with that packet. Using the RSSI and Agg ID in RSSI-Based Forwarding (RBF), we favor nodes closer to sink when aggregating and relaying a data packet. We show via simulation the performance of the proposed mechanisms in terms of normalized number of transmissions, energy consumed per data packet, network lifetime and packet loss probability.
{"title":"Data aggregation using RSSI for multihop Wireless Sensor Networks","authors":"A. Awang, Shobhit Agarwal","doi":"10.1109/WCSP.2013.6677041","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677041","url":null,"abstract":"In Wireless Sensor Networks (WSNs), sensor nodes are often deployed in large quantity and high density. Due to dense deployment, the sensed data are often redundant and highly correlated. Transmitting redundant data is not practical in the resource-constrained WSNs particularly from the viewpoint of energy conservation. Data aggregation offers a key solution to curtail the network loads and hence reduces the transmission energy consumption. In this work, we propose two data aggregation mechanisms (class-based and alpha-based) that aggregate and route data packet based on Received Signal Strength Indicator (RSSI). Each node maintains an RSSI value with respect to a sink node. When a data packet is generated, an aggregation identification (Agg ID) is associated with that packet. Using the RSSI and Agg ID in RSSI-Based Forwarding (RBF), we favor nodes closer to sink when aggregating and relaying a data packet. We show via simulation the performance of the proposed mechanisms in terms of normalized number of transmissions, energy consumed per data packet, network lifetime and packet loss probability.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127762313","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-02DOI: 10.1109/WCSP.2013.6677146
Yan Li, Xiaodong Ji, M. Peng, Yuan Li, Chao-Wei Huang
Multiple input multiple output (MIMO) system with large number of antennas, referred to as massive MIMO, has drawn increasing attention for it enables very high throughput in LTE-Advanced networks. Massive MIMO arrays are expected to be implemented in a three dimensional (3D) array structure and 3D MIMO is introduced. Antenna propagation was considered only in horizontal domain during the past few years. In this paper, vertical domain of antenna is taken into account and the modeling of 3D channel is investigated. Furthermore, an enhanced dynamic beamforming algorithm is proposed where beamforming vector can be obtained according to both users' horizontal and vertical directions. Enhanced performance can be obtained by the proposed algorithm compared with conventional 2D beamforming. In addition, the impact of sector radius on spectral efficiency as well as cell coverage is analyzed and the optimal downtilts for different senarios are explored.
{"title":"An enhanced beamforming algorithm for three dimensional MIMO in LTE-advanced networks","authors":"Yan Li, Xiaodong Ji, M. Peng, Yuan Li, Chao-Wei Huang","doi":"10.1109/WCSP.2013.6677146","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677146","url":null,"abstract":"Multiple input multiple output (MIMO) system with large number of antennas, referred to as massive MIMO, has drawn increasing attention for it enables very high throughput in LTE-Advanced networks. Massive MIMO arrays are expected to be implemented in a three dimensional (3D) array structure and 3D MIMO is introduced. Antenna propagation was considered only in horizontal domain during the past few years. In this paper, vertical domain of antenna is taken into account and the modeling of 3D channel is investigated. Furthermore, an enhanced dynamic beamforming algorithm is proposed where beamforming vector can be obtained according to both users' horizontal and vertical directions. Enhanced performance can be obtained by the proposed algorithm compared with conventional 2D beamforming. In addition, the impact of sector radius on spectral efficiency as well as cell coverage is analyzed and the optimal downtilts for different senarios are explored.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122371049","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
扫码关注我们
求助内容：
应助结果提醒方式：