Feng Shu

Prof. Dr. Feng Shu

avatar
Co-authors
avatar
Following
avatar
Followers

Research Focus & Metrics

Explore full metrics on Scilit

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
23 March 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
QLQian Liu
Qian Liu
Long ShiLong Shi
Long Shi
LSLinlin Sun
Linlin Sun
JLJun Li
Jun Li
MDMing Ding
Ming Ding
FSFeng Shu
Feng Shu
In this letter, we study an unmanned aerial vehicle (UAV)-mounted mobile edge computing network, where the UAV executes computational tasks offloaded from mobile terminal users (TUs) and the motion of each TU follows a Gauss-Markov random model. To ensure the quality-of-service (QoS) of each TU, the UAV with limited energy dynamically plans its trajectory according to the locations of mobile TUs. Towards this end, we first formulate the problem as a Markov decision process, wherein the UAV trajectory and UAV-TU association are modeled as the parameters to be optimized. To maximize the system reward and meet the QoS constraint, we develop a QoS-based action selection policy in a double deep Q-network (DDQN). Simulations show that the proposed algorithm converges more quickly and achieves a higher sum throughput than conventional algorithms.
1 November 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
KSKhurram Shahzad
Khurram Shahzad
XZXiangyun Zhou
Xiangyun Zhou
Shihao YanShihao Yan
Shihao Yan
JHJinsong Hu
Jinsong Hu
FSFeng Shu
Feng Shu
JLJun Li
Jun Li
Covert communications hide the transmission of a message from a watchful adversary while ensuring a certain decoding performance at the receiver. In this paper, a wireless communication system under fading channels is considered where covertness is achieved by using a full-duplex receiver. More precisely, the receiver of covert information generates artificial noise with a varying power causing uncertainty at the adversary, Willie, regarding the statistics of the received signals. Given that Willie's optimal detector is a threshold test on the received power, we derive a closed-form expression for the optimal detection performance of Willie averaged over the fading channel realizations. Furthermore, we provide guidelines for the optimal choice of artificial noise power range, and the optimal transmission probability of covert information to maximize the detection errors at Willie. Our analysis shows that the transmission of artificial noise, although causing self-interference, provides the opportunity of achieving covertness but its transmit power levels need to be managed carefully. We also demonstrate that the prior transmission probability of 0.5 is not always the best choice for achieving the maximum possible covertness when the covert transmission probability and artificial noise power can be jointly optimized.
18 February 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XZXiaobo Zhou
Xiaobo Zhou
QWQingqing Wu
Qingqing Wu
Shihao YanShihao Yan
Shihao Yan
FSFeng Shu
Feng Shu
JLJun Li
Jun Li
This paper studies the physical layer security of an unmanned aerial vehicle (UAV) network, where a UAV base station (UAV-B) transmits confidential information to multiple information receivers (IRs) with the aid of a UAV jammer (UAVJ) in the presence of multiple eavesdroppers. We formulate an optimization problem to jointly design the trajectories and transmit power of UAV-B and UAV-J in order to maximize the minimum average secrecy rate over all IRs. The optimization problem is non-convex and the optimization variables are coupled, which leads to the optimization problem being mathematically intractable. As such, we decompose the optimization problem into two subproblems and then solve it by employing an alternating iterative algorithm and the successive convex approximation technique. Our results show that the average secrecy rate performance of the proposed scheme provides about 20% and 150% performance gains over the joint trajectory and transmit power optimization without UAV-J scheme and the transmit power optimization with fixed trajectory scheme at flight period T = 150 s, respectively.
16 July 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
XZXiaobo Zhou
Xiaobo Zhou
Shihao YanShihao Yan
Shihao Yan
JHJinsong Hu
Jinsong Hu
JSJiande Sun
Jiande Sun
JLJun Li
Jun Li
FSFeng Shu
Feng Shu
This paper considers covert communications in the context of unmanned aerial vehicle (UAV) networks, aiming to hide a UAV for transmitting critical information out of an area that is monitored and where communication is not allowed. Specifically, the UAV as a transmitter intends to transmit information to a legitimate receiver (Bob) covertly while avoiding being detected by a warden (Willie), where location uncertainty exists at Bob and/or Willie. In order to enhance the considered covert communication performance, we jointly optimize the UAV's trajectory and transmit power in terms of maximizing the average covert transmission rate from the UAV to Bob subject to transmission outage constraint and covertness constraint. The formulated optimization problem is difficult to tackle directly due to the intractable constraints. As such, we first employ conservative approximation to transform a constraint into a deterministic form and then apply the first-order restrictive approximation to transform the optimization problem into a convex form. By applying the successive convex approximation technique, an efficient iterative algorithm is developed to solve the optimization problem. Our examination shows that the developed joint trajectory and transmit power optimization scheme achieves significantly better covert communication performance as compared to a benchmark scheme.
7 May 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JHJinsong Hu
Jinsong Hu
Shihao YanShihao Yan
Shihao Yan
XZXiangyun Zhou
Xiangyun Zhou
FSFeng Shu
Feng Shu
JLJun Li
Jun Li
JWJiangzhou Wang
Jiangzhou Wang
Covert wireless communication aims to hide the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this work, we examine the possibility and achievable performance of covert communication in amplify-and-forward one-way relay networks. Specifically, the relay is greedy and opportunistically transmits its own information to the destination covertly on top of forwarding the source’s message, while the source tries to detect this covert transmission to discover the illegitimate usage of the resource (e.g., power, spectrum) allocated only for the purpose of forwarding the source’s information. We propose two strategies for the relay to transmit its covert information, namely rate-control and powercontrol the transmission schemes, for which the source’s detection limits are analysed in terms of detection error probability and the achievable effective covert rates from the relay to destination are derived. Our examination determines the conditions under which the rate-control transmission scheme outperforms the powercontrol transmission scheme, and vice versa, which enables the relay to achieve the maximum effective covert rate. Our analysis indicates that the relay has to forward the source’s message to shield its covert transmission and the effective covert rate increases with its forwarding ability (e.g., its maximum transmit power).
26 July 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
XZXiaobo Zhou
Xiaobo Zhou
Shihao YanShihao Yan
Shihao Yan
QWQingqing Wu
Qingqing Wu
FSFeng Shu
Feng Shu
DNDerrick Wing Kwan Ng
Derrick Wing Kwan Ng
This work examines the performance gain achieved by deploying an intelligent reflecting surface (IRS) in covert communications. To this end, we formulate the joint design of the transmit power and the IRS reflection coefficients by taking into account the communication covertness for the cases with global channel state information (CSI) and without a warden’s instantaneous CSI. For the case of global CSI, we first prove that perfect covertness is achievable with the aid of the IRS even for a single-antenna transmitter, which is impossible without an IRS. Then, we develop a penalty successive convex approximation (PSCA) algorithm to tackle the design problem. Considering the high complexity of the PSCA algorithm, we further propose a low-complexity two-stage algorithm, where analytical expressions for the transmit power and the IRS’s reflection coefficients are derived. For the case without the warden’s instantaneous CSI, we first derive the covertness constraint analytically facilitating the optimal phase shift design. Then, we consider three hardware-related constraints on the IRS’s reflection amplitudes and determine their optimal designs together with the optimal transmit power. Our examination shows that significant performance gain can be achieved by deploying an IRS into covert communications.