With the development of wireless devices and the increase of mobile users, the operator's focus has shifted from the construction of the communication network to the operation and maintenance of the network. Operators are eager to know the behavior of mobile networks and the real-time experience of users, which requires the using of historical data to accurately predict future network conditions. Big data analysis and computing which is widely adopted can be used as a solution. However, there are still some challenges in data analysis and prediction for mobile network optimization, such as the timeliness and accuracy of the prediction. This paper proposes a traffic analysis and prediction system which is suitable for urban wireless communication networks by combining actual call detail record (CDR) data analysis and multivariate prediction algorithms. Firstly, a spatial-temporal modeling is used for historical traffic data extracting. After that, causality analysis is applied to communication data analysis for the first time. Based on causal analysis, multivariate long short-term memory models are used to predict future data for CDR data. Finally, the prediction algorithm is used to process real data of different scenes in the city to verify the performance of the entire system.
The massive MIMO (multiple-input multiple-output) technology plays a key role in the next-generation (5G) wireless communication systems, which are equipped with a large number of antennas at the base station (BS) of a network to improve cell capacity for network communication systems. However, activating a large number of BS antennas needs a large number of radio-frequency (RF) chains that introduce the high cost of the hardware and high power consumption. Our objective is to achieve the optimal combination subset of BS antennas and users to approach the maximum cell capacity, simultaneously. However, the optimal solution to this problem can be achieved by using an exhaustive search (ES) algorithm by considering all possible combinations of BS antennas and users, which leads to the exponential growth of the combinatorial complexity with the increasing of the number of BS antennas and active users. Thus, the ES algorithm cannot be used in massive MIMO systems because of its high computational complexity. Hence, considering the trade-off between network performance and computational complexity, we proposed a low-complexity joint antenna selection and user scheduling (JASUS) method based on Adaptive Markov Chain Monte Carlo (AMCMC) algorithm for multi-cell multi-user massive MIMO downlink systems. AMCMC algorithm is helpful for selecting combination subset of antennas and users to approach the maximum cell capacity with consideration of the multi-cell interference. Performance analysis and simulation results show that AMCMC algorithm performs extremely closely to ES-based JASUS algorithm. Compared with other algorithms in our experiments, the higher cell capacity and near-optimal system performance can be obtained by using the AMCMC algorithm. At the same time, the computational complexity is reduced significantly by combining with AMCMC.
Carrier aggregation (CA) is considered to be a potential technology in next generation wireless communications. While boosting system throughput, CA has also put forward challenges to the resource allocation problems. In this paper, we firstly construct the energy efficiency optimization problem and prove that the function is strictly quasi concave. Then we propose a binary search-based power allocation algorithm to solve the strictly quasi concave optimization problem. Simulation results show that the proposed algorithm can greatly improve the system energy efficiency while keeping low computation complexity.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.