Search

The robustness of system throughput with scheduling is a critical issue. In this paper, we analyze the sensitivity of multi-user scheduling performance to channel misreporting in systems with massive antennas. The main result is that for the round-robin scheduler combined with max-min power control, the channel magnitude misreporting is harmful to the scheduling performance and has a different impact from the purely physical layer analysis. Specifically, for the homogeneous users that have equal average signal-to-noise ratios (SNRs), underreporting is harmful, while overreporting is beneficial to others. In underreporting, the asymptotic rate loss on others is derived, which is tight when the number of antennas is huge. One interesting observation in our research is that the rate loss "periodically" increases and decreases as the number of misreporters grows. For the heterogeneous users that have various SNRs, both underreporting and overreporting can degrade the scheduler performance. We observe that strong misreporting changes the user grouping decision and hence greatly decreases some users' rates regardless of others gaining rate improvements, while with carefully designed weak misreporting, the scheduling decision keeps fixed and the rate loss on others is shown to grow nearly linearly with the number of misreporters., Comment: 10 pages, 8 figures, will appear in Infocom 2018

This paper considers a multi-pair two-way amplify-and-forward relaying system, where multiple pairs of full-duplex users are served via a full-duplex relay with massive antennas, and the relay adopts maximum-ratio combining/maximum-ratio transmission (MRC/MRT) processing. The orthogonal pilot scheme and the least square method are firstly exploited to estimate the channel state information (CSI). When the number of relay antennas is finite, we derive an approximate sum rate expression which is shown to be a good predictor of the ergodic sum rate, especially in large number of antennas. Then the corresponding achievable rate expression is obtained by adopting another pilot scheme which estimates the composite CSI for each user pair to reduce the pilot overhead of channel estimation. We analyze the achievable rates of the two pilot schemes and then show the relative merits of the two methods. Furthermore, power allocation strategies for users and the relay are proposed based on sum rate maximization and max-min fairness criterion, respectively. Finally, numerical results verify the accuracy of the analytical results and show the performance gains achieved by the proposed power allocation., Comment: Accepted by IEEE Transactions on Vehicular Technology

It is starting to become a big trend in the era of social networking that people produce and upload user-generated contents to Internet via wireless networks, bringing a significant burden on wireless uplink networks. In this paper, we contribute to designing and theoretical understanding of wireless cache-enabled upload transmission in a delay-tolerant small cell network to relieve the burden, and then propose the corresponding scheduling policies for the small base station (SBS) under the infinite and finite cache sizes. Specifically, the cache ability introduced by SBS enables SBS to eliminate the redundancy among the upload contents from users. This strategy not only alleviates the wireless backhual traffic congestion from SBS to a macro base station (MBS), but also improves the transmission efficiency of SBS. We then investigate the scheduling schemes of SBS to offload more data traffic under caching size constraint. Moreover, two operational regions for the wireless cache-enabled upload network, namely, the delay-limited region and the cache-limited region, are established to reveal the fundamental tradeoff between the delay tolerance and the cache ability. Finally, numerical results are provided to demonstrate the significant performance gains of the proposed wireless cache-enabled upload network., Comment: submitted to IEEE Trans. Veh. Tech., Sep. 2016