Jinchuan Tang

Prof. Dr. Jinchuan Tang


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
19 March 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
GCGaojie Chen
Gaojie Chen
JTJinchuan Tang
Jinchuan Tang
JCJustin Coon
Justin Coon
With the development of wireless communications and the intellectualization of machines, the Internet of Things (IoT) has been of interest to both industry and academia. Multihop routing and relaying are key technologies that will underpin IoT mesh networks in the future. This paper investigates optimal routing based on the trusted connectivity probability (T-CP) for multihop, underlay, device-to-device (D2D) communications with decode-and-forward relaying. Both random and fixed locations for base stations (BSs) are considered, where the former case assumes that the locations of the BSs are modeled as a Poisson point process (PPP). First, we derive two expressions for the connectivity probability (CP): 1) a tight lower bound and 2) an exact closed-form. Analysis is carried out for the cases where the channel state information (CSI) between BSs and the D2D transmitter is known (CSI-aware) and unknown (noCSI). Interference from active cellular user equipments (CUEs) is characterized by modeling CUE locations as a PPP. Moreover, motivated by results that have shown that social behavior leads to D2D devices communicating with nearby neighbors, we derive the trust probability for D2D connections by using a rank-based model. Finally, we propose a novel routing algorithm that can achieve the highest T-CP for any pair of D2D devices in a distributed manner. The derived analytical results are verified by Monte Carlo simulations. We show that the proposed routing algorithm achieves almost the same performance as that attained through an exhaustive search. When BSs are located randomly, the optimal path based on the CP is the shortest path between the D2D transmitter and receiver. However, for fixed BSs, the optimal path selection depends on the locations of the BSs, which provides a very useful insight in designing the multihop D2D system for 5G IoT.

28 April 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
CLChun Liu
Chun Liu
YTYouliang Tian
Youliang Tian
JTJinchuan Tang
Jinchuan Tang
SDShuping Dang
Shuping Dang
GCGaojie Chen
Gaojie Chen

2 August 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CHChong Huang
Chong Huang
GCGaojie Chen
Gaojie Chen
JTJinchuan Tang
Jinchuan Tang
Pei XiaoPei Xiao
Pei Xiao
ZHZhu Han
Zhu Han
This article proposes a novel machine-learning-based routing optimization for the multiple reconfigurable intelligent surfaces (M-RIS)-assisted multihop cooperative networks, in which a practical phase model for reconfigurable intelligent surface (RIS) with the amplitude variation based on the corresponding discrete phase shift is considered. We aim to maximize the end-to-end data rate in the proposed network by jointly optimizing the data transmission path, the passive beamforming design of RIS, and transmit power allocation. To tackle this complicated nonconvex problem, we divide it into two subtasks: 1) the passive beamforming design of the RIS and 2) joint routing and power allocation optimization. First, for the passive beamforming design of RIS, we develop a distributed learning algorithm that employs a cascade forward backpropagation network in each relay node to solve the RIS coefficients optimization problem by directly using the optimization target to train the cascade networks. This solution can avoid the curse of dimensionality of traditional reinforcement learning algorithms in the RIS optimization problem. Then, based on the result of RIS optimization, we introduce the proximal policy optimization (PPO) algorithm with the clipping method to find solutions for joint optimization of routing and power allocation via achieving the long-term benefit in the Markov decision process (MDP). Simulation results show that the proposed learning-based scheme can learn from the environment to improve its policy stability and efficiency in the iterative training process for optimizing routing and RIS and significantly outperform the benchmark schemes.

12 February 2018 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
JTJinchuan Tang
Jinchuan Tang
GCGaojie Chen
Gaojie Chen
JCJustin Coon
Justin Coon
This letter studies the meta distribution of the secrecy rate for a legitimate link in the presence of eavesdroppers (EDs) with locations modeled as a Poisson point process (PPP). Both colluding and non-colluding EDs are considered. The meta distribution of the secrecy rate can provide the fraction of the realizations of EDs fulfilling a target secrecy rate. It can either be formulated using the Gil-Pelaez theorem with the imaginary moments of the conditional secrecy success probability (CSSP) given the realization of eavesdroppers or approximated by the beta distribution with the first two moments only. Hence, we first derive the bth moment of the CSSP for the colluding scenario. Then, we formulate the exact first moment and the approximated second moment of the CSSP for the non-colluding scenario using the Fortuin-Kasteleyn-Ginibre inequality. Finally, simulations are used to validate the analytic results.

4 July 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
QWQihong Wu
Qihong Wu
JTJinchuan Tang
Jinchuan Tang
SDShuping Dang
Shuping Dang
GCGaojie Chen
Gaojie Chen

28 March 2018 in IEEE Systems Journal
Verified
Journal Article
Closed access
JTJinchuan Tang
Jinchuan Tang
GCGaojie Chen
Gaojie Chen
JCJustin Coon
Justin Coon
Recently, the mission-critical push-to-talk (MCPTT) system has emerged as the new broadband technology for public safety networks. In this paper, we propose a route selection method based on the connectivity, delay, and trust in the MCPTT system to offer the best connectivity-delay-trust performance. To begin with, the connection probability between a pair of user equipment (UE) has been analyzed with the interference from other MCPTT groups. Then, the timeliness probability is studied to capture the level of confidence for the delay requirement. Moreover, the trust probability is calculated by a beta reputation system to prevent potential attacks from malicious nodes and ensure secure interactions among the forwarding UE. By combining three probabilistic results, we investigate the optimal path route selection method based on the Dijkstra’s algorithm to find the path, which can meet the requirement of the MCPTT system. The simulation results validate our models and theoretical analysis. The results provide a useful insight into designing the MCPTT system for 5G public safety and disaster relief networks.