An Optimal Antenna Assignment Strategy for Information Raining

This paper addresses the antenna assignment problem for distributed multiple-antenna architecture that enables wireless communication between onboard and ground in subway and railway. We propose a class of algorithms that match the assignment pattern to the large scale fading. Such algorithms are not constrained by short coherence time inherited in subway and railway. We will then derive an optimal antenna assignment strategy employing maximum ratio combining. Simulation results will be provided to demonstrate the advantages of the proposed strategy, which can also be applied to the recently proposed information raining system.