Wenjing Wang

Wenjing Wang


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
7 April 2020 in IEEE Access
Verified
Journal Article
Open access
NQNan Qi
Nan Qi
MWMei Wang
Mei Wang
WWWenjing Wang
Wenjing Wang
TTTheodoros A. Tsiftsis
Theodoros A. Tsiftsis
Rugui YaoRugui Yao
Rugui Yao
Guanghua YangGuanghua Yang
Guanghua Yang
In this paper, an energy-efficient full-duplex (FD) unmanned aerial vehicle (UAV) relaying network is proposed, where UAV acts as a mobile relay and assists information exchange between two transceivers. Specifically, the load-carry-and-delivery scheme is applied to positively take advantage of the time-varying channel gain in delay-tolerant networks; meanwhile, the FD communication policy is used to potentially further increase the energy efficiency (EE). In particular, the self-interference channel gains follow the complex Gaussian distribution instead of being constant. The EE is first rigorously derived and then, the optimum flight speed is determined under the information causality constraint to maximize the EE. Numerical results demonstrate that the proposed scheme outperforms the half-duplex as well as static schemes in terms of the EE. In addition, the impact of the self-interference cancellation factor on the EE is also demonstrated, which provides valuable insights for the system design of UAV-assisted relaying networks.

30 May 2022 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
WWWenjing Wang
Wenjing Wang
KXKangjun Xu
Kangjun Xu
YYYige Yan
Yige Yan
LCLong Chen
Long Chen
In this letter, an optimal time allocation scheme is proposed to improve the throughput of energy harvesting based backscatter communication. The base station (BS) serving as the power supply is transmitting continuously with constant power. All the relays can harvest radio frequency (RF) energy from the transmission of BS while the user performs backscatter transmission, and then the selected relay decodes and forwards the information from user with harvested RF energy. We propose an optimal time allocation scheme that considers the adaptive backscatter coefficient and relay selection to maximize throughput. Simulation results demonstrate that the proposed scheme outperforms the benchmark strategies in system throughput improvement.

5 August 2022 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
LCLong Chen
Long Chen
FWFei Wang
Fei Wang
RYRuijing Yang
Ruijing Yang
fei xiefei xie
fei xie
WWWenjing Wang
Wenjing Wang
Ziyu GuanZiyu Guan
Ziyu Guan

10 April 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
WWWenjing Wang
Wenjing Wang
HYHong-Chuan Yang
Hong-Chuan Yang
MAMohamed-Slim Alouini
Mohamed-Slim Alouini
In this paper, we investigate the transmission time of a large amount of data over fading wireless channel with adaptive modulation and coding (AMC). Unlike traditional transmission systems, where the transmission time of a fixed amount of data is typically regarded as a constant, the transmission time with AMC becomes a random variable, as the transmission rate varies with the fading channel condition. To facilitate the design and optimization of wireless transmission schemes for big data applications, we present an analytical framework to determine statistical characterizations for the transmission time of big data with AMC. In particular, we derive the exact statistics of transmission time over block fading channels. The probability mass function (PMF) and cumulative distribution function (CDF) of transmission time are obtained for both slow and fast fading scenarios. We further extend our analysis to Markov channel, where transmission time becomes the sum of a sequence of exponentially distributed time slots. Analytical expression for the probability density function (PDF) of transmission time is derived for both fast fading and slow fading scenarios. These analytical results are essential to the optimal design and performance analysis of future wireless transmission systems for big data applications.

27 November 2019 in IEEE Access
Verified
Journal Article
Open access
Jing JiangJing Jiang
Jing Jiang
XWXiaojing Wang
Xiaojing Wang
WWWenjing Wang
Wenjing Wang
LZLi Zhen
Li Zhen
JWJunxuan Wang
Junxuan Wang
Deep learning (DL) can effectively handle explosive data and solve the complicated non-convex problems. Recently, it is used to reduce the overhead of channel state information (CSI) feedback and improve the performance of the limited feedback massive MIMO systems. However, the complex wireless environment and the high-dimensional data of massive MIMO channel degrades the performance of the DL based codebook design. To address this issue, we propose a deep clustering (DC) based codebook design for massive MIMO systems. At first, deep neural network (DNN) learns the key propagation characteristics of the wireless channel according to the training model. And then, the clustering algorithm outputs the centroids of each key propagation characteristic, which can be used to reconstruct the valid space of massive MIMO channel. Finally, massive MIMO codebook is constructed by the valid space. Since the amount of the key propagation characteristics are far less than the dimension of massive MIMO channel, the proposed design can significantly simplify the parameters and the structures of DNN. Moreover, the clustering algorithm output the information with minimum sum-distance with the real channel sequences which can acquire the maximum sum-rate of massive MIMO codebook design. The robustness of the proposed codebook design is validated by carrying out extensive simulation in various scenarios and antenna array structures. Simulation results consist with theoretical analysis in terms of the achievable rate, and demonstrate that the proposed codebook design outperforms the traditional schemes.

11 March 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
WWWenjing Wang
Wenjing Wang
HZHui-Sheng Zhang
Hui-Sheng Zhang
In this paper, we propose a discrete-time Markov model to characterize slotted secondary transmission process under interweave cognitive implementation. Stationary distribution is solved in closed form to evaluate SU-to-PU collision probability and SU successful transmission probability. Assuming SU transmission adopts adaptive modulation and coding (AMC), we then carry out the queuing analysis in term of throughput, queuing delay, and packet drop probability, based on a two-dimensional-finite-state Markov chain for small-size packet transmission. The optimal length of secondary slot is solved by maximizing throughput subject to an SU-to-PU collision probability constraint. For large-size packet transmission, the probability mass function of extended delivery time (EDT) for secondary packet transmission is also derived. Selected numerical results are presented to illustrate the mathematical formulas and to validate our research results.