Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883589
A. Syarif, Imen Benyahia, A. Abouaissa, L. Idoumghar, R. F. Sari, P. Lorenz
This paper is a study about deployment strategy for achieving coverage and connectivity as two fundamental issues in wireless sensor networks. To achieve the best deployment, a new approach based on elitist non-dominated sorting genetic algorithm (NSGA-II) is used. There are two objectives in this study, connectivity and coverage. We defined a fitness function to achieve the best nodes deployment. Further we performed simulation to verify and validate the deployment of wireless sensor network as an output from the proposed mechanism. Some performance parameters have been measured to investigate and analyze the proposed sensor-deployment. The simulation results show that the proposed algorithm can maintain the coverage and connectivity in a given sensing area with a relatively small number of sensor nodes.
{"title":"Evolutionary multi-objective based approach for wireless sensor network deployment","authors":"A. Syarif, Imen Benyahia, A. Abouaissa, L. Idoumghar, R. F. Sari, P. Lorenz","doi":"10.1109/ICC.2014.6883589","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883589","url":null,"abstract":"This paper is a study about deployment strategy for achieving coverage and connectivity as two fundamental issues in wireless sensor networks. To achieve the best deployment, a new approach based on elitist non-dominated sorting genetic algorithm (NSGA-II) is used. There are two objectives in this study, connectivity and coverage. We defined a fitness function to achieve the best nodes deployment. Further we performed simulation to verify and validate the deployment of wireless sensor network as an output from the proposed mechanism. Some performance parameters have been measured to investigate and analyze the proposed sensor-deployment. The simulation results show that the proposed algorithm can maintain the coverage and connectivity in a given sensing area with a relatively small number of sensor nodes.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129067142","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883894
Quang-Dung Ho, Yue Gao, Gowdemy Rajalingham, T. Le-Ngoc
Neighbor area network (NAN) is one of the most important segments of smart grid communications network (SGCN) since it is responsible for the information exchanges between the utility and a large number of smart meters (SMs) in order to enable various important smart grid (SG) applications. Greedy perimeter stateless routing (GPSR) and the routing protocol for low-power and lossy networks (RPL) have been considered as the most promising layer-3 protocols for wireless mesh NANs. This paper compares the system performance and investigates the applicability of these two protocols in practical NAN scenarios. Specifically, transmission reliability, latency and routing path details of GPSR and RPL are studied by extensive simulations. The advantages and disadvantages of each protocol with respect to the characteristics and required features of NAN are discussed in details. The effects of wireless channel characteristics and network offered load levels are also investigated.
{"title":"Performance and applicability of candidate routing protocols for smart grid's wireless mesh neighbor area networks","authors":"Quang-Dung Ho, Yue Gao, Gowdemy Rajalingham, T. Le-Ngoc","doi":"10.1109/ICC.2014.6883894","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883894","url":null,"abstract":"Neighbor area network (NAN) is one of the most important segments of smart grid communications network (SGCN) since it is responsible for the information exchanges between the utility and a large number of smart meters (SMs) in order to enable various important smart grid (SG) applications. Greedy perimeter stateless routing (GPSR) and the routing protocol for low-power and lossy networks (RPL) have been considered as the most promising layer-3 protocols for wireless mesh NANs. This paper compares the system performance and investigates the applicability of these two protocols in practical NAN scenarios. Specifically, transmission reliability, latency and routing path details of GPSR and RPL are studied by extensive simulations. The advantages and disadvantages of each protocol with respect to the characteristics and required features of NAN are discussed in details. The effects of wireless channel characteristics and network offered load levels are also investigated.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129107034","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883457
V. Suryaprakash, G. Fettweis
A flexible and effectual back-haul infrastructure is required for managing extremely dense future mobile networks proficiently, and economically. This paper aims to establish a framework which can estimate the cost of a network, and then use the framework to minimize the deployment cost of the network by optimizing the number of back-haul nodes required to help the base stations satisfy user demands. The two main contributions of this work are: the derivation of a framework that gives the cost of deploying a back-haul node in a 3-layer model which consists of users, base stations, and back-haul nodes; and the generalization of the framework to obtain the cost of deploying a node in a particular layer of interest in a k-layer model. The utility of this framework is illustrated for the 3-layer model by showing that there exist a range of back-haul node intensity values for which deployment costs can be minimized while satisfying users' rate requirements.
{"title":"An analysis of backhaul costs of radio access networks using stochastic geometry","authors":"V. Suryaprakash, G. Fettweis","doi":"10.1109/ICC.2014.6883457","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883457","url":null,"abstract":"A flexible and effectual back-haul infrastructure is required for managing extremely dense future mobile networks proficiently, and economically. This paper aims to establish a framework which can estimate the cost of a network, and then use the framework to minimize the deployment cost of the network by optimizing the number of back-haul nodes required to help the base stations satisfy user demands. The two main contributions of this work are: the derivation of a framework that gives the cost of deploying a back-haul node in a 3-layer model which consists of users, base stations, and back-haul nodes; and the generalization of the framework to obtain the cost of deploying a node in a particular layer of interest in a k-layer model. The utility of this framework is illustrated for the 3-layer model by showing that there exist a range of back-haul node intensity values for which deployment costs can be minimized while satisfying users' rate requirements.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123910461","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883449
Walid Y. Zibideh, M. Matalgah
Encryption is a vital process to ensure the confidentiality of the information transmitted over an insecure wireless channel. However, the nature of the wireless channel tends to deteriorate due to noise, interference and fading. Therefore, an encrypted signal will be received with some errors. Consequently, due to the strict avalanche criterion (SAC), these errors propagate during decryption resulting in half the bits (on average) after decryption to be in error. In order to alleviate these errors, smart coding and/or new encryption algorithms that take into account the nature of wireless channels are required. A modified version of the data encryption standard (DES) called M-DES is one proposed solution, where the error performance and security are improved. However, in M-DES half the cipher is not used to carry information, which degrades the throughput. In this work, we propose what we call the Key-Based Coded Permutation (KBCP), where we use hamming(7,4) codes in the remaining space of M-DES. Using computer simulations, we show that the use of KBCP on top of the first 16 rounds of M-DES significantly improves the error performance. In addition, we use numerical results to show that the use of KBCP enhances the security of the encrypted information.
{"title":"Key-Based Coded Permutation ciphers with improved error performance and security in wireless channels","authors":"Walid Y. Zibideh, M. Matalgah","doi":"10.1109/ICC.2014.6883449","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883449","url":null,"abstract":"Encryption is a vital process to ensure the confidentiality of the information transmitted over an insecure wireless channel. However, the nature of the wireless channel tends to deteriorate due to noise, interference and fading. Therefore, an encrypted signal will be received with some errors. Consequently, due to the strict avalanche criterion (SAC), these errors propagate during decryption resulting in half the bits (on average) after decryption to be in error. In order to alleviate these errors, smart coding and/or new encryption algorithms that take into account the nature of wireless channels are required. A modified version of the data encryption standard (DES) called M-DES is one proposed solution, where the error performance and security are improved. However, in M-DES half the cipher is not used to carry information, which degrades the throughput. In this work, we propose what we call the Key-Based Coded Permutation (KBCP), where we use hamming(7,4) codes in the remaining space of M-DES. Using computer simulations, we show that the use of KBCP on top of the first 16 rounds of M-DES significantly improves the error performance. In addition, we use numerical results to show that the use of KBCP enhances the security of the encrypted information.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123927001","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883491
Hao Lian, Xiao Yan, Lina Weng, Jian Yang, Z. Feng, Qixun Zhang, Yingzhao Yan
This paper proposes an efficient bandwidth allocation scheme to fully utilize the multi-access ability of multimode terminals in heterogeneous networks. To model the fact that the suitability of different networks to different traffics varies, which is seldom considered in previous literature, the term “Match-Degree” is introduced and calculated using grey relational analysis. Afterwards, two methods, namely weighted bandwidth factor and cumulative utility function are proposed to integrate the influence of “Match-Degree” into the conventional utility-functions. Moreover, energy consumption and network price are also considered to make our model more comprehensive. The bandwidth allocation problem is formulated as maximizing the overall utility by adjusting the bandwidth allocated to each user. Based on optimization theory, an iterative algorithm is constructed to solve this problem. And numerical results validate the performance enhancement of our scheme compared with the existing ones.
{"title":"Match-Degree based bandwidth allocation scheme in heterogeneous networks","authors":"Hao Lian, Xiao Yan, Lina Weng, Jian Yang, Z. Feng, Qixun Zhang, Yingzhao Yan","doi":"10.1109/ICC.2014.6883491","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883491","url":null,"abstract":"This paper proposes an efficient bandwidth allocation scheme to fully utilize the multi-access ability of multimode terminals in heterogeneous networks. To model the fact that the suitability of different networks to different traffics varies, which is seldom considered in previous literature, the term “Match-Degree” is introduced and calculated using grey relational analysis. Afterwards, two methods, namely weighted bandwidth factor and cumulative utility function are proposed to integrate the influence of “Match-Degree” into the conventional utility-functions. Moreover, energy consumption and network price are also considered to make our model more comprehensive. The bandwidth allocation problem is formulated as maximizing the overall utility by adjusting the bandwidth allocated to each user. Based on optimization theory, an iterative algorithm is constructed to solve this problem. And numerical results validate the performance enhancement of our scheme compared with the existing ones.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123980578","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 : 2014-06-10DOI: 10.1109/ICC.2014.6884135
B. Bai, Wei Chen, Z. Cao, K. Letaief
The green communications, which focus on improving the energy efficiency, have attracted much attention from both academia and industry recently. In this paper, the tradeoff between outage probability and energy efficiency will be addressed for multi-flow cooperative communication systems with taking energy budget and devices energy consumption into consideration. The proposed approach will first formulate the multi-flow cooperative communication system as a weighted random bipartite graph (WRBG) model. The minimum weighted maximum matching (MWMM) method will then be proposed to select a relay for each source-destination (s-d) pair in order to minimize the outage probability and maximize the average energy efficiency simultaneously. By analyzing the properties of every sample of the WRBG model, the closed-form formulas for the outage probability and average energy efficiency will then be obtained. Therefore, based on the derived tradeoff, the outage probability and average energy efficiency can be balanced by adjusting the energy budgets and transmission rate according to the system requirement. Moreover, the proposed MWMM method also enjoys an advantage of the log-polynomial computation complexity for parallel implementations.
{"title":"Outage and energy efficiency tradeoff for multi-flow cooperative communication systems","authors":"B. Bai, Wei Chen, Z. Cao, K. Letaief","doi":"10.1109/ICC.2014.6884135","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884135","url":null,"abstract":"The green communications, which focus on improving the energy efficiency, have attracted much attention from both academia and industry recently. In this paper, the tradeoff between outage probability and energy efficiency will be addressed for multi-flow cooperative communication systems with taking energy budget and devices energy consumption into consideration. The proposed approach will first formulate the multi-flow cooperative communication system as a weighted random bipartite graph (WRBG) model. The minimum weighted maximum matching (MWMM) method will then be proposed to select a relay for each source-destination (s-d) pair in order to minimize the outage probability and maximize the average energy efficiency simultaneously. By analyzing the properties of every sample of the WRBG model, the closed-form formulas for the outage probability and average energy efficiency will then be obtained. Therefore, based on the derived tradeoff, the outage probability and average energy efficiency can be balanced by adjusting the energy budgets and transmission rate according to the system requirement. Moreover, the proposed MWMM method also enjoys an advantage of the log-polynomial computation complexity for parallel implementations.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123984526","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883465
Jaya Rao, A. Fapojuwo, Salman Naqvi, Isaac Osunkunle, C. Rumpel, Dave Morley
This paper addresses the problem of characterizing the quality of experience (QoE) of users accessing different types of applications in 802.11n wireless local area network (WLAN) deployment environments. Using the generalized logistic function with fractional powers, an analytically tractable QoE model that can be flexibly applied to different application types (real time and nonreal time) is formulated as a function of several quality of service (QoS) parameters. An 802.11n WLAN testbed is then used to validate the accuracy of the QoE model via experimental QoE measurements. The paper also investigates the impact of different network operational parameters including the number of users supported, percentage of real time traffic streamed and level of co-channel interference on both the QoS and QoE performance. Next, an optimization problem is solved to maximize the overall QoE achievable subject to the QoS constraints of the applications in use. Overall, the developed QoE model can be used as an effective tool for enhancing the Access Point (AP) capacity and the QoE performance by optimally adapting the network operational parameters.
{"title":"On modeling and measuring quality of experience performance in IEEE 802.11n wireless networks","authors":"Jaya Rao, A. Fapojuwo, Salman Naqvi, Isaac Osunkunle, C. Rumpel, Dave Morley","doi":"10.1109/ICC.2014.6883465","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883465","url":null,"abstract":"This paper addresses the problem of characterizing the quality of experience (QoE) of users accessing different types of applications in 802.11n wireless local area network (WLAN) deployment environments. Using the generalized logistic function with fractional powers, an analytically tractable QoE model that can be flexibly applied to different application types (real time and nonreal time) is formulated as a function of several quality of service (QoS) parameters. An 802.11n WLAN testbed is then used to validate the accuracy of the QoE model via experimental QoE measurements. The paper also investigates the impact of different network operational parameters including the number of users supported, percentage of real time traffic streamed and level of co-channel interference on both the QoS and QoE performance. Next, an optimization problem is solved to maximize the overall QoE achievable subject to the QoS constraints of the applications in use. Overall, the developed QoE model can be used as an effective tool for enhancing the Access Point (AP) capacity and the QoE performance by optimally adapting the network operational parameters.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123986326","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883579
Kun Wang, Huang Guo, Lei Shu, B. Liu
The routing efficiency in Delay Tolerant Networks (DTN) with social characteristics degrades owing to intermittent connection and high latency. Additionally, congestion is another issue because of the limited resources of nodes. To solve these problems, an improved Socially Aware Congestion Control algorithm (SACC) is proposed. In this algorithm, the social features and the congestion level of the node are utilized to construct a Social Congestion Metric (SCM). In the forwarding process, messages are forwarded to the nodes with higher SCM. When the congestion occurs, the node calculates the social links of itself with every message's destination node, and then drops the message with minimum social link rather than random dropping. Simulation results show that in the acceptable range of delay tolerance, the proposed algorithm improves the delivery probability, decreases the dropping probability and reduces the overhead.
{"title":"An improved congestion control algorithm based on social awareness in Delay Tolerant Networks","authors":"Kun Wang, Huang Guo, Lei Shu, B. Liu","doi":"10.1109/ICC.2014.6883579","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883579","url":null,"abstract":"The routing efficiency in Delay Tolerant Networks (DTN) with social characteristics degrades owing to intermittent connection and high latency. Additionally, congestion is another issue because of the limited resources of nodes. To solve these problems, an improved Socially Aware Congestion Control algorithm (SACC) is proposed. In this algorithm, the social features and the congestion level of the node are utilized to construct a Social Congestion Metric (SCM). In the forwarding process, messages are forwarded to the nodes with higher SCM. When the congestion occurs, the node calculates the social links of itself with every message's destination node, and then drops the message with minimum social link rather than random dropping. Simulation results show that in the acceptable range of delay tolerance, the proposed algorithm improves the delivery probability, decreases the dropping probability and reduces the overhead.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123310660","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883748
Wangkit Wong, Simbarashe Dzinamarira, S. Chan
The performance of multi-channel (MRMC) wireless mesh networks (WMNs) is largely affected by interference, which depends on router placement, traffic routing and channel assignment. This work seeks to jointly optimize the placement, routing and channel assignment for mesh deployment given flow requirements. The problem is complex because router placement changes network topology which in turns impacts routing and channel decisions, while routing and channel assignment algorithms affect router placement decision. We present a novel scheme PRACA (Placement, Routing And Channel Assignment), which seeks to minimize the network-wide interference by considering the three inter-dependent factors. Through extensive simulation, we show that PRACA significantly outperforms other schemes in terms of loss rate, delay, fairness and throughput.
{"title":"Optimizing router placement for wireless mesh deployment","authors":"Wangkit Wong, Simbarashe Dzinamarira, S. Chan","doi":"10.1109/ICC.2014.6883748","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883748","url":null,"abstract":"The performance of multi-channel (MRMC) wireless mesh networks (WMNs) is largely affected by interference, which depends on router placement, traffic routing and channel assignment. This work seeks to jointly optimize the placement, routing and channel assignment for mesh deployment given flow requirements. The problem is complex because router placement changes network topology which in turns impacts routing and channel decisions, while routing and channel assignment algorithms affect router placement decision. We present a novel scheme PRACA (Placement, Routing And Channel Assignment), which seeks to minimize the network-wide interference by considering the three inter-dependent factors. Through extensive simulation, we show that PRACA significantly outperforms other schemes in terms of loss rate, delay, fairness and throughput.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123614819","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 : 2014-06-10DOI: 10.1109/ICC.2014.6884146
Yi Xu, G. Yue, N. Prasad, S. Rangarajan, S. Mao
In this paper, we consider the design of user grouping and scheduling for large-scale multiple-input multiple-output (MIMO) frequency-division-duplexing (FDD) systems. Based on a recently proposed two-stage precoding framework, we first propose an improved K-means user grouping scheme which allocates the users to different pre-beamforming groups using the second-order channel statistics, and then a user grouping scheme that considers both load balancing and precoding design. After user groups are so determined, we present a dynamic user scheduling scheme where second-stage precoding is designed based on instantaneous channel conditions. We demonstrate the efficacy of the proposed schemes through simulations.
{"title":"User grouping and scheduling for large scale MIMO systems with two-stage precoding","authors":"Yi Xu, G. Yue, N. Prasad, S. Rangarajan, S. Mao","doi":"10.1109/ICC.2014.6884146","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884146","url":null,"abstract":"In this paper, we consider the design of user grouping and scheduling for large-scale multiple-input multiple-output (MIMO) frequency-division-duplexing (FDD) systems. Based on a recently proposed two-stage precoding framework, we first propose an improved K-means user grouping scheme which allocates the users to different pre-beamforming groups using the second-order channel statistics, and then a user grouping scheme that considers both load balancing and precoding design. After user groups are so determined, we present a dynamic user scheduling scheme where second-stage precoding is designed based on instantaneous channel conditions. We demonstrate the efficacy of the proposed schemes through simulations.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121298194","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
扫码关注我们
求助内容：
应助结果提醒方式：