Qing Li

Qing Li

Auto-generated profile, based on publicly available information

Qing Li

School of Information System Engineering, PLA Strategic Support Force Information Engineering University, Zhengzhou, China

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
1 April 2016 in IET Communications
Verified
Journal Article
Open access
PDF file
STSiyu Tao
Siyu Tao
HYHongyi Yu
Hongyi Yu
QLQing Li
Qing Li
Protocol message format extraction is a principal process of automatic network protocol reverse engineering when target protocol specifications are not available. However, binary protocol reverse engineering has been a new challenge in recent years for approaches that traditionally have dealt with text‐based protocols rather than binary protocols. In this study, the authors propose a novel approach called PRE‐Bin that automatically extracts binary‐type fields of binary protocols based on fine‐grained bits. First, a silhouette coefficient is introduced into the hierarchical clustering to confirm the optimal clustering number of binary frames. Second, a modified multiple sequence alignment algorithm, in which the matching process and back‐tracing rules are redesigned, is also proposed to analyse binary field features. Finally, a Bayes decision model is invoked to describe field features and determine bit‐oriented field boundaries. The maximum a posteriori criterion is leveraged to complete an optimal protocol format estimation of binary field boundaries. The authors implemented a prototype system of PRE‐Bin to infer the specification of binary protocols from actual traffic traces. Experimental results indicate that PRE‐Bin effectively extracts binary fields and outperforms the existing algorithms.

23 January 2019 in IEEE Access
Verified
Journal Article
Open access
STSiyu Tao
Siyu Tao
HYHong-Yi Yu
Hong-Yi Yu
QLQing Li
Qing Li
YTYanqun Tang
Yanqun Tang
Visible light communication (VLC) is an evolving green communication technology for indoor wireless communication networks. VLC utilizes light emitting diodes (LEDs) for both illumination and communication. To achieve economic and energy-efficient communications, non-orthogonal multiple access (NOMA) improves the system throughput by enhancing spectral efficiency. In indoor VLC networks, the gain ratio power allocation (GRPA) of NOMA allocates greater signal power to users of poor channels to achieve both fairness and high data rate. However, current GRPA strategies developed for radio frequency channels are not necessarily effective in all VLC channel and illumination cases. This study makes the following contributions. First, a GRPA strategy based on VLC channels is proposed that modifies the power counting and channel proportions to enhance the NOMA-VLC throughput. Second, owing to difficulties of directly analyzing NOMA-VLC throughput, an alternative lower bound based on a VLC channel model to facilitate throughput comparisons is proposed. It is proved that the proposed alternative lower bound is asymptotic and compact with respect to NOMA-VLC throughput. Third, for the case of LED heights greater than 1 meter, a local extremum solution using the proposed strategy is analytically demonstrated based on the alternative bound of VLC network throughput. Then, for the case of LED heights smaller than 1 meter, the necessary but not sufficient conditions under which the proposed strategy outperforms previous strategies is provided in VLC scenarios. Finally, experimental results demonstrate the compactness of the proposed alternate lower bound and the advantages of the proposed strategy.

15 June 2018 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
STSiyu Tao
Siyu Tao
HYHongyi Yu
Hongyi Yu
QLQing Li
Qing Li
YTYanqun Tang
Yanqun Tang
Non-orthogonal multiple access (NOMA) is a promising method for enhancing the throughput in visible light communication (VLC) networks. In NOMA, signal power domain control, called gain ratio power allocation (GRPA), can significantly improve the user sum rate with full-time frequency resource utilization. In indoor NOMA-VLC networks, the scenario in which users are covered by VLC illuminants on the ceiling is typical. First, this paper proposes a novel GRPA strategy for a single VLC cell. Second, due to the difficulty of direct comparisons between our and previously reported GRPA strategies, this paper presents an alternative lower bound for comparability. Third, in two- and three- user cases, this paper analytically demonstrates that our NOMA-VLC GRPA strategy outperforms the aforementioned strategy, when successive interference cancellation (SIC) is used. Moreover, in the multi-user case, experimental results show that the average user data rate (AUDR) of multi-user cases under our strategy is better than that under the previous strategy. Finally, our paper provides both analytic and numerical results to prove that VLC single-cell system throughput under our strategy is better than that under the previous strategy. The proposed alternative lower bound is also proved to fit the original NOMA-VLC GRPA target asymptotically based on indoor VLC channels. Furthermore, to achieve the same AUDR, our strategy supports worse received conditions than does the previous strategy.

1 July 2012
Verified
Conference Paper
Closed access
PLPengfei Luo
Pengfei Luo
Min ZhangMin Zhang
Min Zhang
YLYile Liu
Yile Liu
DHDahai Han
Dahai Han
QLQing Li
Qing Li
In this paper, a method to improve the performance of Ultraviolet (UV) communication system without hardware enhancement in the optical link is presented and tested. Three kinds of noises are modeled and their impacts on the UV communication system are measured and analyzed. An FPGA-based moving average filter is utilized to reduce noise. In order to validate the designed filter, we implement a BER tester by using two independent FPGA models. The results show that the filter is able to improve the system performance evidently.

1 October 2017
Verified
Conference Paper
Closed access
XYXiaoyong Yan
Xiaoyong Yan
QLQing Li
Qing Li
STSiyu Tao
Siyu Tao
Binary protocols lack session flow characteristics and its frequent patterns extracting is difficult. In order to achieve binary protocol data frames identification, an unsupervised clustering algorithm based on improved principal component analysis (PCA) and density peaks clustering (DPC) is proposed. We improve PCA by determining the dimensionality for PCA based on information gain. The improved PCA can remove redundant information and retain the characteristics of original data. Meanwhile, we improve DPC based on distance index weighting. The improved DPC can select cluster centers automatically and enhance the distinction between cluster centers and other data frames effectively. Experimental results show that the proposed algorithm works effectively for binary protocol data frames clustering.

1 March 2021 in IEEE Access
Verified
Journal Article
Open access
QLQing Li
Qing Li
YJYonghui Ju
Yonghui Ju
CZChang Zhao
Chang Zhao
XHXintai He
Xintai He
Encrypted network data classification has received considerable attention in the industry and research communities for a long time. However, the emergence of new private applications and encryption protocols has brought more new challenges. The primary task of classification is to determine whether the sample is encrypted. When the specification of private protocol is unpublished, only the whole sample can be processed, and thus the unencrypted field which coexists with the encrypted field will seriously lower the classification effect. To tackle this problem, an algorithm based on data reconstruction and moment eigenvector is proposed, which can not only estimate the encryption result but also locate the encrypted field in each data sample. In the algorithm, the encryption probability sequence is calculated firstly by data reconstruction and CNN (Convolutional Neural Network) model transfer. Then, based on the derivative of the encryption probability sequence, the suspected encrypted field set is generated. Finally, encrypted field matching is performed based on the similarity of the four-dimensional moment eigenvector, and thus the possible encrypted field of each sample is obtained. The proposed algorithm achieved a recall rate of 93% and a precision rate of 72% in an experiment of distinguishing the encrypted/unencrypted ones of complex data. The forward coverage, reverse coverage, and F1 value in identifying encrypted field reached 89%, 90%, and 90%, respectively. Compared with the encrypted field matching methods based on the K-Nearest Neighbor algorithm, Dynamic Time Warping, Runs test, and Frequency test, the method proposed in this paper exhibited salient advantages.