Meijie Yang

Meijie Yang

Auto-generated profile, based on publicly available information

Meijie Yang

University of Science & Technology Beijing, Beijing, CHINA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
30 December 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
GCGuang Chen
Guang Chen
YCYueyun Chen
Yueyun Chen
ZMZhiyuan Mai
Zhiyuan Mai
CHConghui Hao
Conghui Hao
MYMeijie Yang
Meijie Yang
LDLiping Du
Liping Du
Computing tasks offloaded from user devices (UDs) can be carried out by one or more mobile edge computing (MEC) servers to alleviate the computing burden of UDs. The incentive is needed to encourage MEC servers to provide their computing services to other network nodes. In this article, inspired by the fact that bargaining games have the available features of incentive, self-enforcement, and satisfaction for all participants, we propose a two-level bargaining-based incentive mechanism for task offloading and collaborative computing in MEC-enabled networks. In the first-level bargaining between UDs and local MEC server (LMECS), both UDs and LMECS try to maximize their respective offloading utilities, which are all defined as a saved-cost function considering the time and energy consumption of task execution, and computing service fees. The task offloading decision, uplink transmitting power of UDs, computing resource allocation of LMECS, and the fees paid by UDs to LMECS are jointly optimized. When large computing tasks are offloaded to LMECS, which results in LMECS overload, the second-level bargaining is proposed to achieve a computing load balance of LMECS and maximize the respective collaboration utilities of LMECS and collaborative MEC server group (CMECG), in which the optimized normalized fees paid by LMECS to CMECG for additional computing resources are obtained. The first-level and the second-level bargainings are proved to be quasi-concave and concave, respectively, and each has a unique Nash bargaining solution (NBS). The simulation results show that the proposed method gets better performance than benchmark methods.

11 April 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
CHConghui Hao
Conghui Hao
YCYueyun Chen
Yueyun Chen
ZMZhiyuan Mai
Zhiyuan Mai
GCGuang Chen
Guang Chen
MYMeijie Yang
Meijie Yang
Unmanned aerial vehicle (UAV) energy consumption and task completion time are two significant aspects in UAV-enabled Internet of Things (IoT) data acquisition. However, while energy consumption and task completion time are not conflicting constraints, optimizing the former often does not automatically lead to optimization of the latter, and vice-versa. In this paper, we aim to further decrease UAV energy consumption while minimizing UAV task completion time. We propose a novel UAV utility function to describe task completion time for data acquisition and energy consumption for propulsion and receiver's circuits. Then, we formulate a mixed-integer nonconvex utility maximization problem, involving joint optimization of UAV trajectory, velocity, acceleration, task completion time and scheduling of IoT devices for data uploading. To tackle this problem, we decompose the original problem into two sub-problems and propose a two-layer joint task time and trajectory optimization (JTTTO) iterative algorithm, which converges in polynomial time. Accordingly, we apply block coordinate descent (BCD) and successive convex approximation (SCA) algorithms to optimize UAV trajectory, and bisection search algorithm to minimize task completion time, respectively. Simulation results show that the proposed data acquisition scheme significantly decreases the UAV's energy consumption while minimizing task completion time, compared with the other time-minimization schemes.

15 April 2019 in IEEE Access
Verified
Journal Article
Open access
MYMeijie Yang
Meijie Yang
YCYueyun Chen
Yueyun Chen
LDLiping Du
Liping Du
Filtered-orthogonal frequency division multiplexing (F-OFDM) is a candidate for 5G new waveform, which has flexible numerologies to support various scenarios and can combat interference of multi-users effectively with filters. However, although longer filter length and higher roll-off factor can suppress out of band radiation, inter-symbol interference (ISI) and inter-carrier interference (ICI) will increase at the same time. Meanwhile, the wider guard band reduce inter-user interference (IUI) at the cost of higher spectrum occupancy. To meet target bit error rate (BER) requirements of all users and maximize the spectrum efficiency, a filter parameter and guard bandwidth optimization model was proposed to design related parameters dynamically for uplink asynchronous F-OFDM system, where users are allocated with different numerologies. We present a detailed theoretical derivation on ISI, ICI, and IUI for BER calculation, and the theoretical derivation of IUI in multi-user scenario with different subcarrier spacing between users is first presented. The formulated problem is proved to be a non-convex NP hard problem and Imperialist Competitive Algorithm (ICA) is applied for a desirable solution. The simulation results show that the theoretical derivations are valid and the proposed filter parameter and guard bandwidth optimization model can achieve higher spectrum efficiency than the fixed filter parameters in F-OFDM while outperforms traditional OFDM.

8 May 2023 in Physical Communication
Verified
Journal Article
Closed access
MYMeijie Yang
Meijie Yang
YCYueyun Chen
Yueyun Chen
LDLiping Du
Liping Du
JWJintao Wang
Jintao Wang
XZXiaoyan Zhang
Xiaoyan Zhang

12 August 2022 in Physical Communication
Verified
Journal Article
Closed access
MYMeijie Yang
Meijie Yang
YCYueyun Chen
Yueyun Chen
LDLiping Du
Liping Du

17 May 2019
Verified
Conference Paper
Open access
YLYangyu Liu
Yangyu Liu
YCYueyun Chen
Yueyun Chen
MYMeijie Yang
Meijie Yang
ZLZushen Liu
Zushen Liu