Fang Jiang

Fang Jiang

Auto-generated profile, based on publicly available information

Fang Jiang

Key Laboratory of Intelligent Computing and Signal Processing, Anhui University, Hefei, 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
23 March 2023 in IEEE Communications Letters
Verified
Journal Article
Closed access
FJFang Jiang
Fang Jiang
DCDa-Wei Chang
Da-Wei Chang
SMSong Ma
Song Ma
YHYan-Jun Hu
Yan-Jun Hu
姚徐姚华 徐
姚华 徐
Sparse code multiple access (SCMA) is a code-domain non-orthogonal multiple access (NOMA) technology proposed to meet the access needs of large-scale intelligent terminal devices with high spectrum utilization. To improve the accuracy and computational complexity of SCMA to accommodate the internet of things (IoT) scenario, we design a new end-to-end autoencoder combining convolutional neural networks (CNNs) and residual networks. A residual network with multitask learning improves the decoding accuracy, and CNN units are used for SCMA codeword mapping, with sparse connectivity and weight-sharing to reduce the number of trainable parameters. Simulations show that this scheme outperforms existing autoencoder schemes in bit error rate (BER) and computational complexity.

6 April 2024 in Computer Networks
Verified
Journal Article
Closed access
YWYi Wang
Yi Wang
YDYu Deng
Yu Deng
LKLing Kang
Ling Kang
FJFang Jiang
Fang Jiang
FJFulin Jiang
Fulin Jiang

10 October 2023 in IEEE Communications Letters
Verified
Journal Article
Closed access
FJFang Jiang
Fang Jiang
SMSong Ma
Song Ma
TYTian-Yu Yin
Tian-Yu Yin
YWYi Wang
Yi Wang
YHYan-Jun Hu
Yan-Jun Hu
The satellite Internet of Things (IoT) covers a vast area with multiple nodes and has limited resources for random access, which leads to low throughput. In this paper, we propose a Q-learning combined with diversity slotted compressive random access control scheme (QDCC) to enhance resource utilization and throughput. Moreover, we address the issue of reduced throughput during network overload by introducing an adaptive frame length QDCC (AFL-QDCC) scheme. This scheme adjusts the frame length by utilizing the support sets estimated by the compressive sensing (CS) reconstruction algorithm. Simulation results demonstrate that the proposed QDCC scheme outperforms conventional schemes in terms of throughput. Furthermore, the AFL-QDCC scheme can maintain stable and high throughput performance even with a large number of nodes.

31 August 2023 in IEEE Communications Letters
Verified
Journal Article
Closed access
YWYi Wang
Yi Wang
FJFulin Jiang
Fulin Jiang
姚徐姚华 徐
姚华 徐
FJFang Jiang
Fang Jiang
YDYu Deng
Yu Deng
As unmanned aerial vehicles (UAVs) are being used in more complex scenarios, Multi-UAV networking such as flying ad hoc networks (FANET) has become an important focus of UAV applications. To solve the problem that FANET’s performance is limited by spectrum resources, this letter examines collaborative spectrum sharing between FANET and cellular networks (CN). In order to optimize the transmission rate of the FANET and address incentive and security issues related to collaborative spectrum sharing, this letter proposes a blockchain-based secure cooperative spectrum-sharing auction scheme.

1 February 2023 in Sensors
Verified
Journal Article
Open access
PDF file
LKLing Kang
Ling Kang
YWYi Wang
Yi Wang
YHYANJUN HU
YANJUN HU
FJFang Jiang
Fang Jiang
NBNa Bai
Na Bai
YDYu Deng
Yu Deng
Mobile edge computing (MEC) is a promising technique to support the emerging delay-sensitive and compute-intensive applications for user equipment (UE) by means of computation offloading. However, designing a computation offloading algorithm for the MEC network to meet the restrictive requirements towards system latency and energy consumption remains challenging. In this paper, we propose a joint user-association, task-partition, and resource-allocation (JUTAR) algorithm to solve the computation offloading problem. In particular, we first build an optimization function for the computation offloading problem. Then, we utilize the user association and smooth approximation to simplify the objective function. Finally, we employ the particle swarm algorithm (PSA) to find the optimal solution. The proposed JUTAR algorithm achieves a better system performance compared with the state-of-the-art (SOA) computation offloading algorithm due to the joint optimization of the user association, task partition, and resource allocation for computation offloading. Numerical results show that, compared with the SOA algorithm, the proposed JUTAR achieves about 21% system performance gain in the MEC network with 100 pieces of UE.

27 July 2020 in IEEE Access
Verified
Journal Article
Open access
FJFang Jiang
Fang Jiang
GZGuoliang Zheng
Guoliang Zheng
YHYanjun Hu
Yanjun Hu
YWYi Wang
Yi Wang
YXYaohua Xu
Yaohua Xu
Massive machine type communication (mMTC) serves an irreplaceable role in the development process of the Internet of Things (IoT). Because of its characteristics of massive connection and sporadic transmission, compressed sensing (CS) has been applied in joint user activity and data detection in the uplink grant-free non-orthogonal multiple access (NOMA) system. In previous work, greedy iterative-based multi-user detection (MUD) algorithms were developed in mMTC scenarios because of the computational benefit and competitive performance. However, conventional greedy iterative-based MUD algorithms still suffer from high computational complexity due to the process of large-size matrix inversion with the accession of massive devices into the system. In this paper, gradient information is used to address this problem. A low-complexity gradient descent-based gradient pursuit MUD (GDGP-MUD) algorithm is proposed, which uses the gradient information of error function in the process of iteration as a new updating direction, instead of the matrix inversion process. Then, a multi-step quasi-Newton MUD (MSQN-MUD) algorithm is proposed to improve the precision of detection while maintaining low complexity. In the algorithm, high-order information in the process of adjacent iteration is used effectively to update data values more accurately. Moreover, the convergence and complexity analysis of both algorithms are derived. The analysis shows that both proposed algorithms have lower computational consumption than most of the state-of-the-art greedy-based MUD algorithms. It is worth noting that in comparison to most existing CS-based MUD algorithms, the two proposed algorithms do not require the exact user sparsity level and, thus, reduce the dependence on prior knowledge. The numerical experiments demonstrate that the proposed algorithms have better real-time performance than existing greedy-based MUD algorithms with similar symbol error rate performance.