Low-complexity Location-aware Multi-user Massive MIMO Beamforming for High Speed Train Communications

Massive Multiple-input Multiple-output (MIMO) adaption is one of the primary evolving objectives for the next generation high speed train (HST) communication system. In this paper, we consider how to design an efficient low-complexity location-aware beamforming for the multi-user (MU) massive MIMO system in HST scenario. We first put forward a low-complexity beamforming based on location information, where multiple users are considered. Then, without considering inter-beam interference, a closed-form solution to maximize the total service competence of base station (BS) is proposed in this MU HST scenario. Finally, we present a location-aid searching-based suboptimal solution to eliminate the inter-beam interference and maximize the BS service competence. Various simulations are given to exhibit the advantages of our proposed massive MIMO beamforming method.Comment: This paper has been accepted for future publication by VTC2017-Sprin

A New Method for Minimizing the Unnecessary Handover in High-Speed Scenario

The application of Wireless Local Area Network (WLAN) is limited to indoor or pedestrian walking speed environment because the small WLAN coverage will lead to the growth of unnecessary handover rate in high-speed scenario. The previously proposed traveling distance prediction based handover methods assumed mobile terminal (MT) travels at a constant speed is impractical as most of the MTs may not be traveling at constant speed in real environment. These methods have poor performance in case of acceleration because MT will leave the network earlier than the estimated time. In this paper, a new traveling distance prediction based handover scheme that is aware of MT's speed changes is proposed to overcome the limitation of the existing methods. The proposed scheme is adapted to the MT velocity and acceleration or deceleration rate. The numerical result shows that the performance of the proposed scheme is better than the existing handover methods in high-speed scenario. It keeps the probability of unnecessary handover within the user acceptable level in high-speed scenario

Network selection mechanism for telecardiology application in high speed environment

The existing network selection schemes biased either to cost or Quality of Service (QoS) are not efficient enough for telecardiology application in high traveling speed environment. Selection of the candidate network that is fulfilling the telecardiology service requirements as well as user preference is a challenging issue. This is because the preference of telecardiology user might change based on the patient health condition. This research proposed a novel Telecardiology-based Handover Decision Making (THODM) mechanism that consists of three closely integrated algorithms: Adaptive Service Adjustment (ASA), Dwelling Time Prediction (DTP) and Patient Health Condition-based Network Evaluation (PHCNE). The ASA algorithm guarantees the quality of telecardiology service when none of the available networks fulfils the service requirements. The DTP algorithm minimizes the probability of handover failure and unnecessary handover to Wireless Local Area Network (WLAN), while optimizing the connection time with WLAN in high traveling speed environment. The PHCNE algorithm evaluates the quality of available networks and selects the best network based on the telecardiology services requirement and the patient health condition. Simulation results show that the proposed THODM mechanism reduced the number of handover failures and unnecessary handovers up to 80.0% and 97.7%, respectively, compared with existing works. The cost of THODM mechanism is 20% and 85.3% lower than the Speed Threshold-based Handover (STHO) and Bandwidth-based Handover (BWHO) schemes, respectively. In terms of throughput, the proposed scheme is up to 75% higher than the STHO scheme and 370% greater than the BWHO scheme. For telecardiology application in high traveling speed environment, the proposed THODM mechanism has better performance than the existing network selection schemes

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words