29 January 2021 in IEEE/ACM Transactions on Networking
To meet the ever increasing mobile traffic demand in 5G era, base stations (BSs) have been densely deployed in radio access networks (RANs) to increase the network coverage and capacity. However, as the high density of BSs is designed to accommodate peak traffic, it would consume an unnecessarily large amount of energy if BSs are on during off-peak time. To save the energy consumption of cellular networks, an effective way is to deactivate some idle base stations that do not serve any traffic demand. In this paper, we develop a traffic-aware dynamic BS sleep control framework, named DeepBSC, which presents a novel data-driven learning approach to determine the BS active/sleep modes while meeting lower energy consumption and satisfactory Quality of Service (QoS) requirements. Specifically, the traffic demands are predicted by the proposed GS-STN model, which leverages the geographical and semantic spatial-temporal correlations of mobile traffic. With accurate mobile traffic forecasting, the BS sleep control problem is cast as a Markov Decision Process that is solved by Actor-Critic reinforcement learning methods. To reduce the variance of cost estimation in the dynamic environment, we propose a benchmark transformation method that provides robust performance indicator for policy update. To expedite the training process, we adopt a Deep Deterministic Policy Gradient (DDPG) approach, together with an explorer network, which can strengthen the exploration further. Extensive experiments with a real-world dataset corroborate that our proposed framework significantly outperforms the existing methods.
5 March 2019 in IEEE Internet of Things Journal
Recently, location prediction has attracted considerable research effort because of the popularity of location-based services, such as mobile advertising and recommendations. With the unprecedented proliferation of mobile social networks, such as WeChat and Twitter, we are able to use location service to bridge the online and offline worlds, which is of great significance to many smart city applications. Different from existing studies, in this paper we promote a user-centric location prediction approach by leveraging a user’s local mobile social information without involving other users’ location privacy. We propose a factor graph learning model that integrates not only user’s social and network information, but also the correlations between a user’s locations into a unified framework. Furthermore, we use ReliefF algorithm to select user-specific significant features for location prediction and define the measure of location entropy to study the similarity between location, network status and social behavior. To show the benefit of precise location prediction, we further apply it to personalized service migration in mobile edge computing (MEC) and accordingly propose prediction based amortizing algorithm and lazy migration algorithm that can well balance the trade-off between migration cost and non-migration latency in a cost-efficient manner. We conduct extensive experiments using a real-world data trace, which shows that our model performs much better in location prediction compared with several classic methods and the MEC service quality can be significantly enhanced by leveraging the location prediction.
9 November 2020 in IEEE Transactions on Knowledge and Data Engineering
Graph Neural Networks (GNNs) have led to state-of-the-art performance on a variety of machine learning tasks such as recommendation, node classification and link prediction. Graph neural network models generate node embeddings by merging nodes features with the aggregated neighboring nodes information. Most existing GNN models exploit a single type of aggregator (e.g., mean-pooling) to aggregate neighboring nodes information, and then add or concatenate the output of aggregator to the current representation vector of the center node. However, using only a single type of aggregator is difficult to capture the different aspects of neighboring information and the simple addition or concatenation update methods limit the expressive capability of GNNs. Not only that, existing supervised or semi-supervised GNN models are trained based on the loss function of the node label, which leads to the neglect of graph structure information. In this paper, we propose a novel graph neural network architecture, Graph Attention & Interaction Network (GAIN), for inductive learning on graphs. Unlike the previous GNN models that only utilize a single type of aggregation method, we use multiple types of aggregators to gather neighboring information in different aspects and integrate the outputs of these aggregators through the aggregator-level attention mechanism. Furthermore, we design a graph regularized loss to better capture the topological relationship of the nodes in the graph. Additionally, we first present the concept of graph feature interaction and propose a vector-wise explicit feature interaction mechanism to update the node embeddings. We conduct comprehensive experiments on two node-classification benchmarks and a real-world financial news dataset. The experiments demonstrate our GAIN model outperforms current state-of-the-art performances on all the tasks.