Mengqi Yang

Mengqi Yang

Auto-generated profile, based on publicly available information

Mengqi Yang

School of Information Engineering, Hangzhou Dianzi University, Hangzhou, China

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
24 May 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
MYMengqi Yang
Mengqi Yang
JCJian Chen
Jian Chen
ZDZhiguo Ding
Zhiguo Ding
YLYuanwei Liu
Yuanwei Liu
LLLu Lv
Lu Lv
LYLong Yang
Long Yang
We investigate joint power allocation and decoding order selection (PA-DOS) aimed at enhancing the outage performance of non-orthogonal multiple access (NOMA) systems. By considering the diverse target rates of users, new important properties of NOMA are revealed: When users’ target rates satisfy certain conditions, the channel state information (CSI) is not required by PA-DOS to minimize the system outage probability, and different users’ outage probabilities can be minimized simultaneously; When such conditions are not satisfied, the opposite situation occurs. Following these properties, two PA-DOS strategies are designed regarding distinct user priorities, which ensure the minimization of the system outage probability and the user outage probability of the high-priority user. Especially, these strategies do not require CSI or only require one-bit CSI feedback depending on users’ target rates. Analytical and numerical results are provided to demonstrate that the proposed strategies significantly outperform the existing strategies in terms of both system and user outage performance. Furthermore, the results show that although under some target rates the minimum user outage probabilities cannot be simultaneously achieved, they can be closely approached at the same time in the high-signal-to-noise-ratio regime by the proposed strategies.

3 March 2017 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
CRChao Ren
Chao Ren
JCJian Chen
Jian Chen
YKYonghong Kuo
Yonghong Kuo
DWDi Wu
Di Wu
MYMengqi Yang
Mengqi Yang

24 September 2020 in IEEE Communications Letters
Verified
Journal Article
Closed access
MYMengqi Yang
Mengqi Yang
JCJian Chen
Jian Chen
RHRose Hu
Rose Hu
LYLong Yang
Long Yang
In this letter, we investigate the coordinated direct and user-assisted transmission in a non-orthogonal multiple access (NOMA) system. By integrating the coordinated direct transmission into user-cooperative NOMA, one far user (FU) is served along with two near users (NUs) that are opportunistically selected from a pool of K NUs. For the considered system, an NU scheduling strategy is proposed to minimize the outage probabilities of the NUs whilst ensuring the performance requirement of the FU. Exact and asymptotic outage probability of each served user is derived. Results demonstrate that the FU and one of the scheduled NUs can both achieve the full diversity order K, and the other scheduled NU achieves a diversity order equal to K-1 or K, depending on the transmit rate of the base station.

5 July 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MYMengqi Yang
Mengqi Yang
JCJian Chen
Jian Chen
ZDZhiguo Ding
Zhiguo Ding
LLLu Lv
Lu Lv
NANaofal Al-Dhahir
Naofal Al-Dhahir
LYLong Yang
Long Yang
To enhance the outage performance of downlink non-orthogonal multiple access (NOMA) systems, we investigate opportunistic user pair scheduling (UPS) as well as the joint power allocation and decoding order selection (PA-DOS) for the scheduled user pair. Unlike most existing literature where the UPS and PA-DOS schemes are solely driven by channel conditions, we consider the impact of both the channel conditions and users’ target rates in the scheme design, since these two factors jointly determine the occurrence of transmission outages. Specifically, a two-stage rate-aware scheme for joint UPS and PA-DOS is proposed, which is proved to achieve the minimum system outage probability and guarantee fair access opportunities among users. For performance evaluation, the exact system outage probability achieved by the proposed scheme is derived in closed form, based on which a high-signal-to-noise-ratio asymptotic result is further derived for meaningful insights. Our analytical results reveal a new finding: The diversity order achieved by our proposed scheme, which is also the maximum achievable diversity order of the considered NOMA system, varies with the users’ target rates. Simulations confirm our findings and demonstrate that the proposed scheme can achieve a significant outage performance gain over the existing benchmark schemes.

3 November 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CFChunhui Feng
Chunhui Feng
MYMengqi Yang
Mengqi Yang
Zewei JingZewei Jing
Zewei Jing
TQTony Q. S. Quek
Tony Q. S. Quek
Muyu MeiMuyu Mei
Muyu Mei
The integration of edge computing and satellite networks has emerged as a promising solution to support remote terrestrial computation with wide coverage and low latency. However, single-satellite computing leads to uneven resource utilization and degraded service quality. To address this, peer offloading is required to improve both service quality and resource efficiency. Asides from peer offloading, diverse service requests also call for an appropriate service deployment strategy, which should be jointly optimized with the offloading decision. In this article, taking into processing cost and service update cost, we formulate a long-term optimization for service deployment and peer offloading. To pursue long-term performance, the problem is first reformulated into a sequence of time-invariant problems. Since frequent service deployment adjustments incur overhead and may cause service interruption, we decompose the time-invariant problem into a service deployment subproblem and a peer offloading subproblem, optimized at different timescales. A hierarchical method iteratively solves the two subproblems. In particular, we propose an online distributed algorithm for small-timescale peer offloading. Each local peer offloading problem is transformed into a capacity-constrained minimum cost maximum flow (C-MCMF) problem, enabling a low-complexity solution via the successive shortest path algorithm. We provide a theoretical analysis showing that the proposed algorithm asymptotically approaches the offline optimum at the expense of system congestion. Moreover, we show that the performance bound grows with the large-timescale interval. Simulation results validate the theoretical analysis and demonstrate the effectiveness of the proposed algorithm in terms of processing cost and service update cost.

26 August 2025 in Engineering
Verified
Journal Article
Open access
GFGuangteng Fan
Guangteng Fan
PWPeng Wu
Peng Wu
MYMengqi Yang
Mengqi Yang
JWJian Wang
Jian Wang
DRDechao Ran
Dechao Ran
PZPing Zhang
Ping Zhang