Dong Liu

Dong Liu

Auto-generated profile, based on publicly available information

Dong Liu

Beihang University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 March 2016 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Open access
DLDong Liu
Dong Liu
CYChenyang Yang
Chenyang Yang
Caching popular contents at base stations (BSs) can reduce the backhaul cost and improve the network throughput. Yet whether locally caching at the BSs can improve the energy efficiency (EE), a major goal for fifth generation cellular networks, remains unclear. Due to the entangled impact of various factors on EE such as interference level, backhaul capacity, BS density, power consumption parameters, BS sleeping, content popularity, and cache capacity, another important question is what are the key factors that contribute more to the EE gain from caching. In this paper, we attempt to explore the potential of EE of the cache-enabled wireless access networks and identify the key factors. By deriving closed-form expression of the approximated EE, we provide the condition when the EE can benefit from caching, find the optimal cache capacity that maximizes the network EE, and analyze the maximal EE gain brought by caching. We show that caching at the BSs can improve the network EE when power efficient cache hardware is used. When local caching has EE gain over not caching, caching more contents at the BSs may not provide higher EE. Numerical and simulation results show that the caching EE gain is large when the backhaul capacity is stringent, interference level is low, content popularity is skewed, and when caching at pico BSs instead of macro BSs.

9 March 2017 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
DLDong Liu
Dong Liu
CYChenyang Yang
Chenyang Yang
In this paper, we investigate the optimal caching policy, respectively, maximizing the success probability and area spectral efficiency (ASE) in a cache-enabled heterogeneous network (HetNet), where a tier of multi-antenna macro base stations (MBSs) is overlaid with a tier of helpers with caches. Under the probabilistic caching framework, we resort to stochastic geometry theory to derive the success probability and ASE. After finding the optimal caching policies, we analyze the impact of critical system parameters and compare the ASE with traditional HetNet where the MBS tier is overlaid by a tier of pico BSs (PBSs) with limited-capacity backhaul. Analytical and numerical results show that the optimal caching probability is less skewed among helpers to maximize the success probability when the ratios of MBS-to-helper density, MBS-to-helper transmit power, user-to-helper density, or the rate requirement are small, but is more skewed to maximize the ASE in general. Compared with traditional HetNet, the helper density is much lower than the PBS density to achieve the same target ASE. The helper density can be reduced by increasing cache size. With given total cache size within an area, there exists an optimal helper node density that maximizes the ASE.

26 June 2019 in IEEE Access
Verified
Journal Article
Open access
DLDong Liu
Dong Liu
CYChenyang Yang
Chenyang Yang
The gain from proactive caching at mobile devices highly relies on the accurate prediction of user demands and mobility, which, however, is hard to achieve due to the random user behavior. In this paper, we leverage personalized content recommendation to reduce the uncertainty of user demands in sending requests. We formulate a joint content pushing and recommendation problem that maximizes the net profit of a mobile network operator. To cope with the challenges in modeling and learning user behavior, we establish a reinforcement learning (RL) framework to resolve the problem. To circumvent the curse of dimensionality of reinforcement learning for the joint problem, that is, with very large action and state spaces, we decompose the original problem into two RL problems, where two agents with different goals operate together, and we limit the number of possible actions in each state of the pushing agent by harnessing the well-learned recommendation policy. To enable the generalization of action values from experienced states to the unexperienced states with function approximation, we find a proper way to represent the state and action of the pushing agent. Then, we resort to double deep-Q network with dueling architecture to solve the two problems. The simulation results show that the learned recommendation and pushing policies are able to converge and can increase the net profit significantly compared with baseline policies.

19 April 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
DLDong Liu
Dong Liu
JCJingjin Cui
Jingjin Cui
Jiankang ZhangJiankang Zhang
Jiankang Zhang
CYChenyang Yang
Chenyang Yang
LHLajos Hanzo
Lajos Hanzo
Data packet routing in aeronautical ad-hoc networks (AANETs) is challenging due to their high-dynamic topology. In this paper, we invoke deep reinforcement learning for routing in AANETs aiming at minimizing the end-to-end (E2E) delay. Specifically, a deep Q-network (DQN) is conceived for capturing the relationship between the optimal routing decision and the local geographic information observed by the forwarding node. The DQN is trained in an offline manner based on historical flight data and then stored by each airplane for assisting their routing decisions during flight. To boost the learning efficiency and the online adaptability of the proposed DQN-routing, we further exploit the knowledge concerning the system's dynamics by using a deep value network (DVN) conceived with a feedback mechanism. Our simulation results show that both DQN-routing and DVN-routing achieve lower E2E delay than the benchmark protocol, and DVN-routing performs similarly to the optimal routing that relies on perfect global information.

16 October 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
DLDong Liu
Dong Liu
CYChenyang Yang
Chenyang Yang
Existing proactive caching policies are designed by assuming that all users request contents with identical activity level at uniformly-distributed or known locations, among which most of the policies are optimized by assuming that user preference is identical to content popularity. However, these assumptions are not true based on recent data analysis. In this paper, we investigate what happens without these assumptions. To this end, we establish a framework to optimize caching policy for base stations exploiting heterogeneous user preference, activity level, and spatial locality. We derive success probability and average rate of each user as utility function, respectively, and obtain the optimal caching policy maximizing a weighted sum of average utility (reflecting network performance) and minimal utility of users (reflecting user fairness). To investigate the intertwined impact of individual user request behavior on caching, we provide an algorithm to synthesize user preference from given content popularity and activity level with controlled preference similarity, and validate the algorithm with real datasets. Analysis and simulation results show that exploiting individual user behavior can improve both network performance and user fairness, and the gain increases with the skewness of spatial locality, and the heterogeneity of user preference and activity level.

16 August 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
DLDong Liu
Dong Liu
Jiankang ZhangJiankang Zhang
Jiankang Zhang
JCJingjin Cui
Jingjin Cui
SNSoon Xin Ng
Soon Xin Ng
RMRobert G. Maunder
Robert G. Maunder
LHLajos Hanzo
Lajos Hanzo
Data packet routing in aeronautical ad hoc networks (AANETs) is challenging due to their high-dynamic topology. In this article, we invoke deep learning (DL) to assist routing in AANETs. We set out from the single objective of minimizing the end-to-end (E2E) delay. Specifically, a deep neural network (DNN) is conceived for mapping the local geographic information observed by the forwarding node into the information required for determining the optimal next hop. The DNN is trained by exploiting the regular mobility pattern of commercial passenger airplanes from historical flight data. After training, the DNN is stored by each airplane for assisting their routing decisions during flight relying solely on local geographic information. Furthermore, we extend the DL-aided routing algorithm to a multiobjective scenario, where we aim for simultaneously minimizing the delay, maximizing the path capacity, and maximizing the path lifetime. Our simulation results based on real flight data show that the proposed DL-aided routing outperforms existing position-based routing protocols in terms of its E2E delay, path capacity, as well as path lifetime, and it is capable of approaching the Pareto front that is obtained using global link information.