- Electronic Engineering and Computer Science
Queen Mary University of London
Mile End Road, London E1 4NS, UK - +44 (0) 20 7882 5813
- Yuanwei Liu is a Lecturer (Assistant Professor) in School of Electronic Engineering and Computer Science at Queen Ma... moreYuanwei Liu is a Lecturer (Assistant Professor) in School of Electronic Engineering and Computer Science at Queen Mary University of London (QMUL) , London, U.K. (Sep. 2017-present). He was a Postdoctoral Research Fellow at King's College London (KCL) , London, U.K. (Sep. 2016- Aug. 2017). He received the Ph.D. degree from QMUL in 2016. He received the M.S. and B.S. degrees from Beijing University of Posts and Telecommunications (BUPT) in 2014 and 2011, respectively. He currently serves as an Editor of the IEEE Communications Letters and the IEEE Access.
His research interests include Non-Orthogonal Multiple access (NOMA), Millimeter Wave Communications, Internet of Things (IoT), Resource Allocation in 5G networks, Stochastic Geometry and Matching Theory, Machine Learning and Big Data.edit
In this letter, we investigate the context-aware resource allocation for device-to-device communications accounting for the quality-of-service (QoS) requirements and priorities of different applications based on users' requests. We... more
In this letter, we investigate the context-aware resource allocation for device-to-device communications accounting for the quality-of-service (QoS) requirements and priorities of different applications based on users' requests. We formulate a context-aware optimization problem and implement the matching theory to solve the problem. We propose a novel algorithm where the D2D user equipments and resource blocks (RBs) act as two opposite sets of players and interact with each other to obtain the optimal matching. We analytically prove that the algorithm converges to a two-sided exchange stability within limited number of swap operations. We also demonstrate that the proposed algorithm significantly outperforms the context-unaware resource allocation algorithm by around 62.2%.
Research Interests:
In this letter, we aim at solving the resource allocation problem for device-to-device (D2D) communications underlaying cellular networks. Particularly, multiple D2D pairs are allowed to reuse the same resource block (RB), and one D2D... more
In this letter, we aim at solving the resource allocation problem for device-to-device (D2D) communications underlaying cellular networks. Particularly, multiple D2D pairs are allowed to reuse the same resource block (RB), and one D2D pair is allowed to use the spectrum of multiple RBs. Our objective is to maximize the system sum rate by satisfying the signal-to-interference-plus-noise ratio (SINR) constraints for both D2D and cellular user equipments (UEs). In order to solve this non-deterministic polynomial-time (NP) hard optimization problem, we propose a novel algorithm for obtaining a sub-optimal solution based on the many-to-many two-sided matching game with externalities. To characterize the properties of the proposed algorithm, we prove that it converges to the two-sided exchange stability within limited number of iterations. Additionally, simulation results show that the proposed algorithm can achieve the near-optimal system sum rate and significantly outperforms a one-to-one matching algorithm.
Research Interests:
In this paper, a novel non-orthogonal multiple access (NOMA) enhanced device-to-device (D2D) communication scheme is considered. Our objective is to maximize the system sum rate by optimizing subchannel and power allocation. We propose a... more
In this paper, a novel non-orthogonal multiple access (NOMA) enhanced device-to-device (D2D) communication scheme is considered. Our objective is to maximize the system sum rate by optimizing subchannel and power allocation. We propose a novel solution that jointly assigns subchannels to D2D groups and allocates power to receivers in each D2D group. For the subchannel assignment, a novel algorithm based on the many-to-one two-sided matching theory is proposed for obtaining a suboptimal solution. Since the power allocation problem is non-convex, sequential convex programming is adopted to transform the original power allocation problem to a convex one. The power allocation vector is obtained by iteratively tightening the lower bound of the original power allocation problem until convergence. Numerical results illustrate that: i) the proposed joint subchannel and power allocation algorithm is an effective approach for obtaining near-optimal performance with acceptable complexity; and ii) the NOMA enhanced D2D communication scheme is capable of achieving promising gains in terms of network sum rate and number of accessed users, compared to traditional orthogonal multiple access (OMA) based D2D communication scheme.
Research Interests:
This letter proposes several relay selection policies for secure communication in cognitive decode-and-forward relay networks, where a pair of cognitive relays is opportunistically selected for security protection against eavesdropping.... more
This letter proposes several relay selection policies for secure communication in cognitive decode-and-forward relay networks, where a pair of cognitive relays is opportunistically selected for security protection against eavesdropping. The first relay transmits the secrecy information to the destination, and the second relay, as a friendly jammer, transmits the jamming signal to confound the eavesdropper. We present new exact closed-form expressions for the secrecy outage probability. Our analysis and simulation results strongly support our conclusion that the proposed relay selection policies can enhance the performance of secure cognitive radio. We also confirm that the error floor phenomenon is created in the absence of jamming.
Research Interests:
As the latest member of the multiple access family, non-orthogonal multiple access (NOMA) has been recently proposed for 3GPP Long Term Evolution (LTE) and envisioned to be an essential component of 5th generation (5G) mobile networks.... more
As the latest member of the multiple access family, non-orthogonal multiple access (NOMA) has been recently proposed for 3GPP Long Term Evolution (LTE) and envisioned to be an essential component of 5th generation (5G) mobile networks. The key feature of NOMA is to serve multiple users at the same time/frequency/code, but with different power levels, which yields a significant spectral efficiency gain over conventional orthogonal MA. This article provides a systematic treatment of this newly emerging technology, from its combination with multiple-input multiple-output (MIMO) technologies, to cooperative NOMA, as well as the interplay between NOMA and cognitive radio. This article also reviews the state of the art in the standardization activities concerning the implementation of NOMA in LTE and 5G networks.
Research Interests:
—In this paper, we investigate secure device-to-device (D2D) communication in energy harvesting large-scale cognitive cellular networks. The energy constrained D2D transmitter harvests energy from multi-antenna equipped power beacons... more
—In this paper, we investigate secure device-to-device
(D2D) communication in energy harvesting large-scale cognitive
cellular networks. The energy constrained D2D transmitter
harvests energy from multi-antenna equipped power beacons
(PBs), and communicates with the corresponding receiver using
the spectrum of the primary base stations (BSs). We introduce a
power transfer model and an information signal model to enable
wireless energy harvesting and secure information transmission.
In the power transfer model, three wireless power transfer
(WPT) policies are proposed: 1) cooperative power beacons
(CPB) power transfer, 2) best power beacon (BPB) power
transfer, and 3) nearest power beacon (NPB) power transfer.
To characterize the power transfer reliability of the proposed
three policies, we derive new expressions for the exact power
outage probability. Moreover, the analysis of the power outage
probability is extended to the case when PBs are equipped
with large antenna arrays. In the information signal model, we
present a new comparative framework with two receiver selection
schemes: 1) best receiver selection (BRS), where the receiver
with the strongest channel is selected, and 2) nearest receiver
selection (NRS), where the nearest receiver is selected. To assess
the secrecy performance, we derive new analytical expressions
for the secrecy outage probability and the secrecy throughput
considering the two receiver selection schemes using the proposed
WPT policies. We presented Monte-carlo simulation results to
corroborate our analysis and show: 1) secrecy performance
improves with increasing densities of PBs and D2D receivers
due to larger multiuser diversity gain, 2) CPB achieves better
secrecy performance than BPB and NPB but consumes more
power, and 3) BRS achieves better secrecy performance than
NRS but demands more instantaneous feedback and overhead.
A pivotal conclusion is reached that with increasing number of
antennas at PBs, NPB offers a comparable secrecy performance
to that of BPB but with a lower complexity.
(D2D) communication in energy harvesting large-scale cognitive
cellular networks. The energy constrained D2D transmitter
harvests energy from multi-antenna equipped power beacons
(PBs), and communicates with the corresponding receiver using
the spectrum of the primary base stations (BSs). We introduce a
power transfer model and an information signal model to enable
wireless energy harvesting and secure information transmission.
In the power transfer model, three wireless power transfer
(WPT) policies are proposed: 1) cooperative power beacons
(CPB) power transfer, 2) best power beacon (BPB) power
transfer, and 3) nearest power beacon (NPB) power transfer.
To characterize the power transfer reliability of the proposed
three policies, we derive new expressions for the exact power
outage probability. Moreover, the analysis of the power outage
probability is extended to the case when PBs are equipped
with large antenna arrays. In the information signal model, we
present a new comparative framework with two receiver selection
schemes: 1) best receiver selection (BRS), where the receiver
with the strongest channel is selected, and 2) nearest receiver
selection (NRS), where the nearest receiver is selected. To assess
the secrecy performance, we derive new analytical expressions
for the secrecy outage probability and the secrecy throughput
considering the two receiver selection schemes using the proposed
WPT policies. We presented Monte-carlo simulation results to
corroborate our analysis and show: 1) secrecy performance
improves with increasing densities of PBs and D2D receivers
due to larger multiuser diversity gain, 2) CPB achieves better
secrecy performance than BPB and NPB but consumes more
power, and 3) BRS achieves better secrecy performance than
NRS but demands more instantaneous feedback and overhead.
A pivotal conclusion is reached that with increasing number of
antennas at PBs, NPB offers a comparable secrecy performance
to that of BPB but with a lower complexity.