Xingjie Li

Mr. Xingjie Li

Chongqing University of Posts and Telecommunications, School of Communication and Information Engineering
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
27 December 2020 in Sensors
Verified
Journal Article
Open access
PDF file
Ruyan WangRuyan Wang
Ruyan Wang
Ailing ZhongAiling Zhong
Ailing Zhong
Zhidu LiZhidu Li
Zhidu Li
Hong ZhangHong Zhang
Hong Zhang
Xingjie LiXingjie Li
Xingjie Li
How to guarantee the data rate and latency requirement for an application with limited energy is an open issue in wireless virtualized sensor networks. In this paper, we integrate the wireless energy transfer technology into the wireless virtualized sensor network and focus on the stochastic performance guarantee. Firstly, a joint task and resource allocation optimization problem are formulated. In order to characterize the stochastic latency of data transmission, effective capacity theory is resorted to study the relationship between network latency violation probability and the transmission capability of each node. The performance under the FDMA mode and that under the TDMA mode are first proved to be identical. We then propose a bisection search approach to ascertain the optimal task allocation with the objective to minimize the application latency violation probability. Furthermore, a one-dimensional searching scheme is proposed to find out the optimal energy harvesting time in each time block. The effectiveness of the proposed scheme is finally validated by extensive numerical simulations. Particularly, the proposed scheme is able to lower the latency violation probability by 11.6 times and 4600 times while comparing with the proportional task allocation scheme and the equal task allocation scheme, respectively.

2 January 2021 in Sensors
Verified
Journal Article
Open access
PDF file
Ailing ZhongAiling Zhong
Ailing Zhong
Zhidu LiZhidu Li
Zhidu Li
Ruyan WangRuyan Wang
Ruyan Wang
Xingjie LiXingjie Li
Xingjie Li
Boren GuoBoren Guo
Boren Guo
How to support massive access efficiently is one of the challenges in the future Internet of Things (IoT) systems. To address such challenge, this paper proposes an effective preamble collision resolution scheme to sustain massive random access (RA) for an IoT system. Specifically, a new sub-preamble structure is first proposed to reduce the preamble collision probability. To identify different devices that send the same preamble to the gNB on the same physical random access channel (PRACH), a multiple timing advance (TA) capturing scheme is then proposed. Thereafter, an RA scheme is designed to sustain massive access and the performance of the scheme is studied analytically. Finally, the effectiveness of the proposed RA scheme is validated by extensive simulation experiments in terms of preamble detection probability, preamble collision probability, RA success probability, resource efficiency and TA capturing.