Pub Date : 2013-12-02DOI: 10.1109/WCSP.2013.6677188
Ruixue Liu, Zhao Li, Liyuan Xiao
In this paper a scheduling algorithm based on proactive co-channel interference (CCI) evaluation for multiuser multiple-input multiple-output (MU-MIMO) broadcast channel (BC) is proposed. The strategy converts user scheduling to spatial subchannel selection problem. A new parameter η, named as proactive CCI evaluation factor is defined for estimating the existing and potential mutual interference. With different settings of η, the proposed algorithm can be generalized to some existing reactive scheduling methods. The user and subchannel scheduling criterion as well as processing procedure are presented in this paper. By appropriately choosing η and comprehensively considering candidate subchannel transmission gain, along with mutual interference among candidate and activated subchannels as well as those would be selected subsequently. A set of sub-channels with less CCI are scheduled, and an improvement of system sum rate is achieved. Simulation results show that compared with those reactive methods, given appropriate η the proposed algorithm could achieve better tradeoff between system sum rate improvement and computational complexity control.
{"title":"Proactive CCI evaluation and transmission gain based scheduling for MU-MIMO broadcast channel","authors":"Ruixue Liu, Zhao Li, Liyuan Xiao","doi":"10.1109/WCSP.2013.6677188","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677188","url":null,"abstract":"In this paper a scheduling algorithm based on proactive co-channel interference (CCI) evaluation for multiuser multiple-input multiple-output (MU-MIMO) broadcast channel (BC) is proposed. The strategy converts user scheduling to spatial subchannel selection problem. A new parameter η, named as proactive CCI evaluation factor is defined for estimating the existing and potential mutual interference. With different settings of η, the proposed algorithm can be generalized to some existing reactive scheduling methods. The user and subchannel scheduling criterion as well as processing procedure are presented in this paper. By appropriately choosing η and comprehensively considering candidate subchannel transmission gain, along with mutual interference among candidate and activated subchannels as well as those would be selected subsequently. A set of sub-channels with less CCI are scheduled, and an improvement of system sum rate is achieved. Simulation results show that compared with those reactive methods, given appropriate η the proposed algorithm could achieve better tradeoff between system sum rate improvement and computational complexity control.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"8 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":"131016001","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.6677237
Kang Song, Baofeng Ji, Yongming Huang, Luxi Yang
In this paper, the performance of a two-way amplify and forward (AF) multi-antenna relay network is presented, where the worse receive signal-to-noise ratio (SNR) of the two end users is maximized. We first derive the exact probability density function (PDF) of receive SNR for two users. Then an approximate expression of SNR in the high-SNR regime is obtained. A closed-form average sum bit error rate (BER) approximation is also derived to quantify the performance of the antenna selection system at high SNR. It is shown by simulation that our analytical result is efficient in estimating the network reliability, especially in the high transmit SNR region.
{"title":"Performance of antenna selection for two-way relay networks with Physical Network Coding","authors":"Kang Song, Baofeng Ji, Yongming Huang, Luxi Yang","doi":"10.1109/WCSP.2013.6677237","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677237","url":null,"abstract":"In this paper, the performance of a two-way amplify and forward (AF) multi-antenna relay network is presented, where the worse receive signal-to-noise ratio (SNR) of the two end users is maximized. We first derive the exact probability density function (PDF) of receive SNR for two users. Then an approximate expression of SNR in the high-SNR regime is obtained. A closed-form average sum bit error rate (BER) approximation is also derived to quantify the performance of the antenna selection system at high SNR. It is shown by simulation that our analytical result is efficient in estimating the network reliability, especially in the high transmit SNR region.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"56 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132154426","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.6677190
Hongrui Wang, Dongming Wang, Ruixun Liu, Hongxiang Xie, Zhaohui Yang
In this paper, we present the optimization of the locations of the remote radio units for the distributed antenna systems with the multi-cell pilot contamination. Considering the two-cell distributed antenna system scenario with pilot contamination, we get the objective function of optimization by maximizing the lower bound of the cell averaged ergodic rate. Since the conventional squared distance criterion appropriate for the single-cell distributed antenna system may not be suitable for the multi-cell scenario, we get reasonable locations of remote radio units by applying the k-means algorithm generating the initial values and the gradient ascent algorithm maximizing the objective function. We compare the locations of remote radio units in the two-cell scenario considering pilot contamination with those not considering pilot contamination clearly, and simulation results show that the cell averaged ergodic rate considering pilot contamination is reasonably larger than that not considering pilot contamination.
{"title":"Antenna location design for distributed antenna systems with pilot contamination","authors":"Hongrui Wang, Dongming Wang, Ruixun Liu, Hongxiang Xie, Zhaohui Yang","doi":"10.1109/WCSP.2013.6677190","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677190","url":null,"abstract":"In this paper, we present the optimization of the locations of the remote radio units for the distributed antenna systems with the multi-cell pilot contamination. Considering the two-cell distributed antenna system scenario with pilot contamination, we get the objective function of optimization by maximizing the lower bound of the cell averaged ergodic rate. Since the conventional squared distance criterion appropriate for the single-cell distributed antenna system may not be suitable for the multi-cell scenario, we get reasonable locations of remote radio units by applying the k-means algorithm generating the initial values and the gradient ascent algorithm maximizing the objective function. We compare the locations of remote radio units in the two-cell scenario considering pilot contamination with those not considering pilot contamination clearly, and simulation results show that the cell averaged ergodic rate considering pilot contamination is reasonably larger than that not considering pilot contamination.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"36 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":"128815439","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.6677095
Rui Wang, Xinxin Feng, Xiaoying Gan, Jing Liu, Haitao Liu
Due to the demand for better transmission quality and lower power consumption, cooperation between macro users and femto users in a macrocell-femtocell overlay network brings a win-win situation. In this paper, we balance macro user's own profit and social fairness by focusing on the Nash bargaining solution for femtocell users partition problem. In order to solve the NP-hard problem, we introduce the concept of spatial distance and the method to determine the location of pivot point in bargaining game. A femtocell users partition algorithm based on bargaining solution in geometrical perspective is proposed. We evaluate the performance of the proposed algorithm through numerical results. It shows that the utility-gain product by geometrical bargaining solution is close to that by full permutation, and the former greatly reduces the computation complexity.
{"title":"Femtocell as a relay: A bargaining solution for femto users partition in geometrical perspective","authors":"Rui Wang, Xinxin Feng, Xiaoying Gan, Jing Liu, Haitao Liu","doi":"10.1109/WCSP.2013.6677095","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677095","url":null,"abstract":"Due to the demand for better transmission quality and lower power consumption, cooperation between macro users and femto users in a macrocell-femtocell overlay network brings a win-win situation. In this paper, we balance macro user's own profit and social fairness by focusing on the Nash bargaining solution for femtocell users partition problem. In order to solve the NP-hard problem, we introduce the concept of spatial distance and the method to determine the location of pivot point in bargaining game. A femtocell users partition algorithm based on bargaining solution in geometrical perspective is proposed. We evaluate the performance of the proposed algorithm through numerical results. It shows that the utility-gain product by geometrical bargaining solution is close to that by full permutation, and the former greatly reduces the computation complexity.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"28 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":"127796097","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.6677077
Sheng Yuan, Pingping Xu
Step Frequency Radar and interferometric technique can be combined to measure the displacement of a bridge. Based on the reason of ambiguous high resolution range profiles of stepped frequency radar, the algorithms to achieve unambiguous high resolution range profiles is analyzed. And a new algorithms to achieve real one-dimensional profiles is proposed. Secondly, because of the ambiguous displacement measured by interferometric technology, the solution which can be called conjugate phase multiplication is proposed. Finally, the validity of these methods are verified by simulation.
{"title":"The improvement of displacement measurement algorithms by Step Frequency Radar","authors":"Sheng Yuan, Pingping Xu","doi":"10.1109/WCSP.2013.6677077","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677077","url":null,"abstract":"Step Frequency Radar and interferometric technique can be combined to measure the displacement of a bridge. Based on the reason of ambiguous high resolution range profiles of stepped frequency radar, the algorithms to achieve unambiguous high resolution range profiles is analyzed. And a new algorithms to achieve real one-dimensional profiles is proposed. Secondly, because of the ambiguous displacement measured by interferometric technology, the solution which can be called conjugate phase multiplication is proposed. Finally, the validity of these methods are verified by simulation.","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":"133767662","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.6677263
Changhong Chen, Jie Zhang, Z. Gan
Human action recognition is an important area of computer vision research and applications. In this paper, we propose a new state model-based recognition approach based on latent dynamic Conditional Random Field (LDCRF) for action recognition. Combined feature of histograms of oriented gradient (HOG) and histograms of optic flow (HOF) is extracted from each frame. Neighborhood Preserving Embedding (NPE) is employed for reducing dimensions of the combined features. LDCRF model is built based on the probe features and the most likely label can be obtained from the trained LDCRF models. Its performance is tested both on single-person action datasets and human interaction dataset. The experimental results show the effectiveness of our algorithm.
{"title":"Human action recognition based on latent-dynamic Conditional Random Field","authors":"Changhong Chen, Jie Zhang, Z. Gan","doi":"10.1109/WCSP.2013.6677263","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677263","url":null,"abstract":"Human action recognition is an important area of computer vision research and applications. In this paper, we propose a new state model-based recognition approach based on latent dynamic Conditional Random Field (LDCRF) for action recognition. Combined feature of histograms of oriented gradient (HOG) and histograms of optic flow (HOF) is extracted from each frame. Neighborhood Preserving Embedding (NPE) is employed for reducing dimensions of the combined features. LDCRF model is built based on the probe features and the most likely label can be obtained from the trained LDCRF models. Its performance is tested both on single-person action datasets and human interaction dataset. The experimental results show the effectiveness of our algorithm.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"168 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":"114375493","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.6677220
Wendong Yang, Yueming Cai, Shiming Xu, Guoqin Kang
In this paper, joint time-frequency subchannel pairing is investigated for buffer-aided multirelay OFDM networks. Closed-form expressions for the outage probability and symbol error probability are obtained. Lower and upper bounds for the capacity are also given. Simulation results validate our analysis and show that joint time-frequency subchannel pairing can significantly improve the performance of the system.
{"title":"Joint time-frequency subchannel pairing for buffer-aided multirelay OFDM networks","authors":"Wendong Yang, Yueming Cai, Shiming Xu, Guoqin Kang","doi":"10.1109/WCSP.2013.6677220","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677220","url":null,"abstract":"In this paper, joint time-frequency subchannel pairing is investigated for buffer-aided multirelay OFDM networks. Closed-form expressions for the outage probability and symbol error probability are obtained. Lower and upper bounds for the capacity are also given. Simulation results validate our analysis and show that joint time-frequency subchannel pairing can significantly improve the performance of the system.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"3 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":"125932446","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.6677042
Zhenzhen Yang, Zhenzhen Yang
In this paper, an efficient image reconstruction algorithm based on compressed sensing (CS) in the wavelet domain is proposed. The new algorithm is composed of three steps. Firstly, the image is represented with its coefficients using the discrete wavelet transform (DWT). Secondly, the measurement is obtained by using a random Gaussian matrix. Finally, an accelerated augmented Lagrangian method (AALM) is proposed to reconstruct the sparse coefficients, which will be converted by the inverse discrete wavelet transform (IDWT) to the reconstructed image. Our experimental results show that the proposed reconstruction algorithm yields a higher peak signal to noise ratio (PSNR) reconstructed image as well as a faster convergence rate as compared to some existing reconstruction algorithms.
{"title":"Accelerated augmented Lagrangian method for image reconstruction","authors":"Zhenzhen Yang, Zhenzhen Yang","doi":"10.1109/WCSP.2013.6677042","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677042","url":null,"abstract":"In this paper, an efficient image reconstruction algorithm based on compressed sensing (CS) in the wavelet domain is proposed. The new algorithm is composed of three steps. Firstly, the image is represented with its coefficients using the discrete wavelet transform (DWT). Secondly, the measurement is obtained by using a random Gaussian matrix. Finally, an accelerated augmented Lagrangian method (AALM) is proposed to reconstruct the sparse coefficients, which will be converted by the inverse discrete wavelet transform (IDWT) to the reconstructed image. Our experimental results show that the proposed reconstruction algorithm yields a higher peak signal to noise ratio (PSNR) reconstructed image as well as a faster convergence rate as compared to some existing reconstruction algorithms.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"41 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":"124717475","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.6677283
Jun Sun, Yingzhuang Liu, Guangxi Zhu
This paper explores the problem of how a secondary transmitter could serve several users simultaneously by utilizing the spectrum of a primary system while imposing no impact on it (i.e. satisfying the coexistence constraint), even if the primary system keeps active all the time. The difficulty of this problem lies in that how the secondary system should tackle the interference encountered at multiple secondary receivers. In the cognitive transmission framework, the core of the above problem include two aspects: 1) How to learn quickly the message(s) of the primary system? 2) How to efficiently address the interference at multiple secondary receivers with the knowledge of the primary message? To solve these two problems, our main idea is to fully exploit the advantages of multiple antennas and the potential of transmitter cognition of the interfered message, in order to achieve the goal of fast exploration and full exploitation. In information theoretic terms, the above problem is equivalent to studying the achievable rate of the causally cognitive MISO broadcast channel under the so-called coexistence constraint. For this problem, we propose an efficient achievable scheme which is essentially based on the dirty paper coding and the zero-forcing beamforming and proves to be capable of realizing rather considerable sum rate and degrees of freedom for the secondary system. Our scheme exploits an interesting result regarding the capacity region of the MIMO Gaussian broadcast channel with states known only to the encoders.
{"title":"On the achievable rates and degrees of freedom of causally cognitive MISO broadcast channels","authors":"Jun Sun, Yingzhuang Liu, Guangxi Zhu","doi":"10.1109/WCSP.2013.6677283","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677283","url":null,"abstract":"This paper explores the problem of how a secondary transmitter could serve several users simultaneously by utilizing the spectrum of a primary system while imposing no impact on it (i.e. satisfying the coexistence constraint), even if the primary system keeps active all the time. The difficulty of this problem lies in that how the secondary system should tackle the interference encountered at multiple secondary receivers. In the cognitive transmission framework, the core of the above problem include two aspects: 1) How to learn quickly the message(s) of the primary system? 2) How to efficiently address the interference at multiple secondary receivers with the knowledge of the primary message? To solve these two problems, our main idea is to fully exploit the advantages of multiple antennas and the potential of transmitter cognition of the interfered message, in order to achieve the goal of fast exploration and full exploitation. In information theoretic terms, the above problem is equivalent to studying the achievable rate of the causally cognitive MISO broadcast channel under the so-called coexistence constraint. For this problem, we propose an efficient achievable scheme which is essentially based on the dirty paper coding and the zero-forcing beamforming and proves to be capable of realizing rather considerable sum rate and degrees of freedom for the secondary system. Our scheme exploits an interesting result regarding the capacity region of the MIMO Gaussian broadcast channel with states known only to the encoders.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"22 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":"128411677","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.6677057
M. He, Ying Yang, Weidong Wang
Network designers expect a highly mobile, highly responsive, and quickly deployable network structure to enable communication in emergency situations. For this reason, a major research goal for emerging mobile network (mobile sensor network, mobile ad hoc network, etc.)is to achieve good coverage and robust communication performance by coordinated management of base stations or nodes. In this paper, we extend current methods to balancing cell load by taking base station mobility into account.We propose a novel distributed base station mobility strategy (DMS). We focus on a recently attractive network model where localized communication is supported by using mobile base stations (MBSs) placed on moving vehicles. In order to minimize the blocking rate in high traffic density area, the proposed strategy will lead the MBSs to suitable locations and re-share the whole traffic load. We demonstrate the convergence of this distributed mobility strategy by both theoretical analysis and numerical evaluations of realistic networks. The strategy enables each MBS to select destination efficiently and locally with limited information exchange. Compared with the traditional load balancing method based on transmit power control, the proposed algorithm has obvious advantages in reducing the dropped calls, especially with extremely uneven load distribution.
{"title":"Distributed base station mobility strategy and load balancing in wireless networks","authors":"M. He, Ying Yang, Weidong Wang","doi":"10.1109/WCSP.2013.6677057","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677057","url":null,"abstract":"Network designers expect a highly mobile, highly responsive, and quickly deployable network structure to enable communication in emergency situations. For this reason, a major research goal for emerging mobile network (mobile sensor network, mobile ad hoc network, etc.)is to achieve good coverage and robust communication performance by coordinated management of base stations or nodes. In this paper, we extend current methods to balancing cell load by taking base station mobility into account.We propose a novel distributed base station mobility strategy (DMS). We focus on a recently attractive network model where localized communication is supported by using mobile base stations (MBSs) placed on moving vehicles. In order to minimize the blocking rate in high traffic density area, the proposed strategy will lead the MBSs to suitable locations and re-share the whole traffic load. We demonstrate the convergence of this distributed mobility strategy by both theoretical analysis and numerical evaluations of realistic networks. The strategy enables each MBS to select destination efficiently and locally with limited information exchange. Compared with the traditional load balancing method based on transmit power control, the proposed algorithm has obvious advantages in reducing the dropped calls, especially with extremely uneven load distribution.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"43 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":"128280043","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
扫码关注我们
求助内容：
应助结果提醒方式：