Dong Qin

Dr. Dong Qin

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
23 March 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
TZTianqing Zhou
Tianqing Zhou
YYYali Yue
Yali Yue
DQDong Qin
Dong Qin
Xuefang NieXuefang Nie
Xuefang Nie
XLXuan Li
Xuan Li
Chunguo LiChunguo Li
Chunguo Li
With the emergence of more and more applications of Internet of Things (IoT) mobile devices (IMDs), a contradiction between mobile energy demand and limited battery capacity becomes increasingly prominent. In addition, in ultradense IoT networks, the ultradensely deployed small base stations (SBSs) will consume a large amount of energy. To reduce the network-wide energy consumption and prolong the standby time of IMDs and SBSs, under the proportional computation resource allocation and devices’ latency constraints, we jointly perform the device association, computation offloading, and resource allocation to minimize the network-wide energy consumption for ultradense multidevice and multitask IoT networks. To further balance the network loads and fully utilize the computation resources, we take account of multistep computation offloading. Considering that the finally formulated problem is in a nonlinear and mixed-integer form, we develop an improved hierarchical adaptive search (IHAS) algorithm to find its solution. Then, we give the convergence, computational complexity, and parallel implementation analyses for such an algorithm. By comparing with other algorithms, we can easily find that such an algorithm can greatly reduce the network-wide energy consumption under devices’ latency constraints.

1 October 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
TZTianqing Zhou
Tianqing Zhou
DQDong Qin
Dong Qin
Xuefang NieXuefang Nie
Xuefang Nie
XLXuan Li
Xuan Li
Chunguo LiChunguo Li
Chunguo Li
To meet the demand of green communications of ultradense mobile devices (MDs), an energy-efficient mechanism, jointly considering the computation offloading and resource management, is designed to minimize the network-wide weighted energy consumption under the delay constraints of MDs for ultradense heterogeneous networks. Such a mechanism tightly integrates with the adjustment of computation capability and transmission power of MDs. Considering that the finally formulated problem is in a nonlinear and mixed-integer form, we design an effective algorithm to solve it. Specifically, by utilizing the powerful global searching capability of genetic algorithm (GA) and the accurate local searching capability of particle swarm optimization (PSO), the adaptive GA with diversity-guided is firstly used for coarse-grained search, and then adaptive PSO is utilized for fine-grained search. After that, some detailed analyses on the convergence, computation complexity and parallel implement are provided for algorithms. Simulation results show that the designed algorithm can achieve a lower network energy consumption than other offloading algorithms in general. At the same time, the numerical simulation also reveals that the designed algorithm may be more suitable for ultradense networks than existing algorithms.

7 April 2022 in IEEE Systems Journal
Verified
Journal Article
Closed access
TZTianqing Zhou
Tianqing Zhou
YYYali Yue
Yali Yue
DQDong Qin
Dong Qin
Xuefang NieXuefang Nie
Xuefang Nie
XLXuan Li
Xuan Li
Chunguo LiChunguo Li
Chunguo Li
To meet the need of computation-sensitive (CS) and high-rate (HR) communications, the mobile edge computing and caching framework has been widely regarded as a promising solution. When such a framework is implemented in heterogeneous cellular networks (HCNs), it is a key and open topic how to assign mobile edge computing and caching servers to mobile devices (MDs) with CS and HR communications. In this article, under the resource partitioning and resource constraints, joint MD association and resource allocation is performed to minimize the total delay of MDs. In such a formulated problem, the MD association and resource allocation parameters are in a coupling form. In addition, it is also in nonlinear mixed-integer one and hard to tackle. To solve it, we try to develop an alternating optimization algorithm according to the coalitional game and convex optimization theorems. As for the designed algorithm, we provide some detailed convergence, stability, parallel implement, and computation complexity analyses. At last, in the simulation, we introduce other association algorithms for comparison, and investigate the impacts of MD density, time, and frequency partitioning factors on the delay of MDs. Simulation results show that the designed algorithm can achieve lower network delay than existing algorithms in general.

18 August 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
TZTianqing Zhou
Tianqing Zhou
YFYanyan Fu
Yanyan Fu
DQDong Qin
Dong Qin
Xuefang NieXuefang Nie
Xuefang Nie
NJNan Jiang
Nan Jiang
Chunguo LiChunguo Li
Chunguo Li
Ultradense networks are widely regarded as a promising solution to explosively growing applications of Internet of Things (IoT) mobile devices (IMDs). However, complicated and severe interferences need to be tackled properly in such networks. To this end, both orthogonal multiple access (OMA) and non-OMA (NOMA) are considered under base station (BS) clustering. Then, in order to attain a goal of green and secure computation offloading, under the proportional allocation of computation resources, and the constraints of latency and security cost, joint device association, channel selection, security service assignment, power control, and computation offloading are performed for minimizing the overall energy consumed by all IMDs. It is noteworthy that multistep computation offloading is concentrated to balance the network loads and fully utilize computation resources. Since the finally formulated problem is in a nonlinear mixed-integer form, it may be very difficult to find its closed-form solution. To solve it, an improved whale optimization algorithm (IWOA) is designed. As for this algorithm, the convergence, computation complexity, and parallel implementation are analyzed in detail. Simulation results show that the designed algorithm may achieve lower energy consumption than other existing algorithms under strictly satisfying constraints of latency and security cost.

11 December 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
TZTianqing Zhou
Tianqing Zhou
XZXinliang Zeng
Xinliang Zeng
DQDong Qin
Dong Qin
NJNan Jiang
Nan Jiang
Xuefang NieXuefang Nie
Xuefang Nie
Chunguo LiChunguo Li
Chunguo Li
When many users offload computation tasks to edge servers in mobile edge computing (MEC) networks, how to economically utilize edge nodes with limited computation resources to ensure users' quality of experiences (QoEs) is a vital issue, especially for an ultra-dense multi-cell, multi-user, and multi-task framework. To minimize the task processing cost of all users, we try jointly optimizing computational offloading decisions, task offloading proportion, and allocation of communication and computation resources in this paper. Herein, the task processing cost is mainly caused by local energy consumption, wireless communication, and edge computing. Although the proposed optimization problem is non-convex, we design an efficient algorithm to find its optimum solution. Specifically, by taking advantage of both the improved artificial fish swarm algorithm (IAFSA) and the improved particle swarm optimization (IPSO), a hierarchical algorithm used for computation offloading (HACO) is designed. Then, the convergence, complexity, and parallel implementation of such an algorithm are analyzed. Finally, compared with other existing algorithms through simulation experiments, it is verified that the designed algorithm may achieve better performance in reducing the task processing cost under strict delay constraints.

27 September 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
TZTianqing Zhou
Tianqing Zhou
YFYanyan Fu
Yanyan Fu
DQDong Qin
Dong Qin
XLXuan Li
Xuan Li
Chunguo LiChunguo Li
Chunguo Li
Ultra-dense heterogeneous networks (UDHNs) have been widely regarded as a long-term and reliable solution for enhancing system performance and reducing cost efficiency. To guarantee these gains in UDHNs, some problems need to be properly tackled, which include more capital/operational expenditures, more complicated, severe and average interferences, and more energy consumption caused by network densification. To this end, in this paper, the BS (base station) on/off operation is introduced into the design of user association mechanisms in UDHNs with a general multi-slope channel model. Specifically, we jointly perform the BS (on/off) operation and user association to maximize the sum of weighted downlink long-term rates. Such rates are closely related to users' signal strengths and the load levels of associated BSs. Considering the finally formulated problem is in a mixed-integer and fractional form, we first need to convert it into a parameterized polynomial one. Then, we design a three-layer iterative algorithm to find the solution to a transformed problem, where the first layer tries to find the introduced Lagrangian multipliers and parameters using a Newton-like method, the second layer optimizes the user association and on/off indices alternately, and the third layer optimizes these indices separately. Simulation results show that the designed algorithm can achieve better user association performance than other existing ones.