Pei-Qiu Huang

Dr. Pei-Qiu Huang

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
11 September 2019 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
YWYong Wang
Yong Wang
ZRZhi-Yang Ru
Zhi-Yang Ru
Kezhi WangKezhi Wang
Kezhi Wang
PHPei-Qiu Huang
Pei-Qiu Huang
This article establishes a new multiunmanned aerial vehicle (multi-UAV)-enabled mobile edge computing (MEC) system, where a number of unmanned aerial vehicles (UAVs) are deployed as flying edge clouds for large-scale mobile users. In this system, we need to optimize the deployment of UAVs, by considering their number and locations. At the same time, to provide good services for all mobile users, it is necessary to optimize task scheduling. Specifically, for each mobile user, we need to determine whether its task is executed locally or on a UAV (i.e., offloading decision), and how many resources should be allocated (i.e., resource allocation). This article presents a two-layer optimization method for jointly optimizing the deployment of UAVs and task scheduling, with the aim of minimizing system energy consumption. By analyzing this system, we obtain the following property: the number of UAVs should be as small as possible under the condition that all tasks can be completed. Based on this property, in the upper layer, we propose a differential evolution algorithm with an elimination operator to optimize the deployment of UAVs, in which each individual represents a UAV's location and the entire population represents an entire deployment of UAVs. During the evolution, we first determine the maximum number of UAVs. Subsequently, the elimination operator gradually reduces the number of UAVs until at least one task cannot be executed under delay constraints. This process achieves an adaptive adjustment of the number of UAVs. In the lower layer, based on the given deployment of UAVs, we transform the task scheduling into a 0-1 integer programming problem. Due to the large-scale characteristic of this 0-1 integer programming problem, we propose an efficient greedy algorithm to obtain the near-optimal solution with much less time. The effectiveness of the proposed two-layer optimization method and the established multi-UAV-enabled MEC system is demonstrated on ten instances with up to 1000 mobile users.

20 August 2020 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
Muhammad AsimMuhammad Asim
Muhammad Asim
YWYong Wang
Yong Wang
Kezhi WangKezhi Wang
Kezhi Wang
PHPei-Qiu Huang
Pei-Qiu Huang
Cloud computing (CC) is a centralized computing paradigm that accumulates resources centrally and provides these resources to users through Internet. Although CC holds a large number of resources, it may not be acceptable by real-time mobile applications, as it is usually far away from users geographically. On the other hand, edge computing (EC), which distributes resources to the network edge, enjoys increasing popularity in the applications with low-latency and high-reliability requirements. EC provides resources in a decentralized manner, which can respond to users’ requirements faster than the normal CC, but with limited computing capacities. As both CC and EC are resource-sensitive, several big issues arise, such as how to conduct job scheduling, resource allocation, and task offloading, which significantly influence the performance of the whole system. To tackle these issues, many optimization problems have been formulated. These optimization problems usually have complex properties, such as non-convexity and NP-hardness, which may not be addressed by the traditional convex optimization-based solutions. Computational intelligence (CI), consisting of a set of nature-inspired computational approaches, recently exhibits great potential in addressing these optimization problems in CC and EC. This article provides an overview of research problems in CC and EC and recent progresses in addressing them with the help of CI techniques. Informative discussions and future research trends are also presented, with the aim of offering insights to the readers and motivating new research directions.

1 January 2020 in Information Sciences
Verified
Journal Article
Closed access
ZLZhi-Zhong Liu
Zhi-Zhong Liu
YWYong Wang
Yong Wang
PHPei-Qiu Huang
Pei-Qiu Huang

19 June 2019 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
PHPei-Qiu Huang
Pei-Qiu Huang
YWYong Wang
Yong Wang
Kezhi WangKezhi Wang
Kezhi Wang
ZLZhizhong Liu
Zhizhong Liu
This paper studies a multiuser cooperative mobile edge computing offloading (called CoMECO) system in a multiuser interference environment, in which delay-sensitive tasks may be executed on local devices, cooperative devices, or the primary MEC server. In this system, we jointly optimize the offloading decision and computation resource allocation for minimizing the total energy consumption of all mobile users under the delay constraint. If this problem is solved directly, the offloading decision and computation resource allocation are generally generated separately at the same time. Note, however, that they are closely coupled. Therefore, under this condition, their dependency is not well considered, thus leading to poor performance. We transform this problem into a bilevel optimization problem, in which the offloading decision is generated in the upper level, and then the optimal allocation of computation resources is obtained in the lower level based on the given offloading decision. In this way, the dependency between the offloading decision and computation resource allocation can be fully taken into account. Subsequently, a bilevel optimization approach, called BiJOR, is proposed. In BiJOR, candidate modes are first pruned to reduce the number of infeasible offloading decisions. Afterward, the upper-level optimization problem is solved by ant colony system (ACS). Furthermore, a sorting strategy is incorporated into ACS to construct feasible offloading decisions with a higher probability and a local search operator is designed in ACS to accelerate the convergence. For the lower-level optimization problem, it is solved by the monotonic optimization method. In addition, BiJOR is extended to deal with a complex scenario with the channel selection. Extensive experiments are carried out to investigate the performance of BiJOR on two sets of instances with up to 400 mobile users. The experimental results demonstrate the effectiveness of BiJOR and the superiority of the CoMECO system.

30 September 2019 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
PHPei-Qiu Huang
Pei-Qiu Huang
YWYong Wang
Yong Wang
Kezhi WangKezhi Wang
Kezhi Wang
KYKun Yang
Kun Yang
This paper studies an unmanned aerial vehicle (UAV)-assisted Internet of Things (IoT) data collection system, where a UAV is employed as a data collection platform for a group of ground IoT devices. Our objective is to minimize the energy consumption of this system by optimizing the UAV’s deployment, including the number and locations of stop points of the UAV. When using evolutionary algorithms to solve this UAV’s deployment problem, each individual usually represents an entire deployment. Since the number of stop points is unknown a priori, the length of each individual in the population should be varied during the optimization process. Under this condition, the UAV’s deployment is a variable-length optimization problem and the traditional fixed-length mutation and crossover operators should be modified. In this paper, we propose a differential evolution algorithm with a variable population size, called DEVIPS, for optimizing the UAV’s deployment. In DEVIPS, the location of each stop point is encoded into an individual, and thus the whole population represents an entire deployment. Over the course of evolution, differential evolution is employed to produce offspring. Afterward, we design a strategy to adjust the population size according to the performance improvement. By this strategy, the number of stop points can be increased, reduced, or kept unchanged adaptively. In DEVIPS, since each individual has a fixed length, the UAV’s deployment becomes a fixed-length optimization problem and the traditional fixed-length mutation and crossover operators can be used directly. The performance of DEVIPS is compared with that of five algorithms on a set of instances. The experimental studies demonstrate its effectiveness.

14 February 2022 in IEEE Wireless Communications Letters
Verified
Journal Article
Open access
PHPei-Qiu Huang
Pei-Qiu Huang
YZYu Zhou
Yu Zhou
Kezhi WangKezhi Wang
Kezhi Wang
Bing-Chuan WangBing-Chuan Wang
Bing-Chuan Wang
Using intelligent reflecting surfaces (IRSs) is a promising approach to enhance the performance of wireless communication systems. In this letter, the placement optimization of multi-IRSs is investigated in multi-IRS-aided wireless communication systems, with the aim of minimizing the number of IRSs subject to the average achievable data rate. Then, an adaptive differential evolution algorithm is developed to jointly optimize the number, locations, and phase shift coefficients of IRSs, in which a novel strategy is devised to adaptively select the mutation operator for each individual. Compared with other algorithms, the proposed algorithm performs well in reducing the number of IRSs while satisfying the average achievable data rate.