Yanqun Tang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yanqun Tang has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Qing Li
Department of Information System Engineering, PLA Strategic Support Force Information Engineering University, Zhengzhou 450001, China
2 shared publications Siyu Tao
National Digital Switching System Engineering and Technological Research Center
2 shared publicationsWei Li
National University of Defense Technology
2 shared publications- Xiangwei Bai
National Digital Switching System Engineering and Technological Research Center (NDSC), Zhengzhou 450001, China
2 shared publications Zhengyu Zhu
Zhengzhou University
2 shared publicationsZhiguo Shi
Zhejiang University
2 shared publications
Latest Publications
- 22 August 2020
- Published by Springer Nature
- p. 607-613
Indoor Visible Light Communication Networks for Camera-Based Mobile Sensing
- 22 August 2020
- Published by Springer Nature
- p. 607-613
Indoor Visible Light Communication Networks for Camera-Based Mobile Sensing
- Open Access
- 2 April 2019
- Published by MDPI AG in Applied Sciences
- Vol. 9 (7) , 1391
A Low-Complexity Resource Allocation Algorithm for Indoor Visible Light Communication Ultra-Dense Networks
In this paper, a low-complexity multi-cell resource allocation algorithm with a near-optimal system throughput is proposed to resolve the conflict between the high system throughput and low complexity of indoor visible light communication ultra-dense networks (VLC-UDNs). First, by establishing the optimal model of the resource allocation problem in each cell, we concluded that the problem is a convex optimization problem. After this, the analytic formula of the normalized scaling factor of each terminal for resource allocation is derived after reasonable approximate treatment. The resource allocation algorithm is subsequently proposed. Finally, the complexity analysis shows that the proposed algorithm has polynomial complexity, which is lower than the classical optimal inter-point method. The simulation results show that the proposed method achieves a improvement of 57% in performance in terms of the average system throughput and improvement of 67% in performance in terms of the quality of service (QoS) guarantee against the required data rate proportion allocation (RDR-PA) method.
- 2 April 2019
- Published by MDPI AG in Applied Sciences
- Vol. 9 (7) , 1391
Open AccessA Low-Complexity Resource Allocation Algorithm for Indoor Visible Light Communication Ultra-Dense Networks
In this paper, a low-complexity multi-cell resource allocation algorithm with a near-optimal system throughput is proposed to resolve the conflict between the high system throughput and low complexity of indoor visible light communication ultra-dense networks (VLC-UDNs). First, by establishing the optimal model of the resource allocation problem in each cell, we concluded that the problem is a convex optimization problem. After this, the analytic formula of the normalized scaling factor of each terminal for resource allocation is derived after reasonable approximate treatment. The resource allocation algorithm is subsequently proposed. Finally, the complexity analysis shows that the proposed algorithm has polynomial complexity, which is lower than the classical optimal inter-point method. The simulation results show that the proposed method achieves a improvement of 57% in performance in terms of the average system throughput and improvement of 67% in performance in terms of the quality of service (QoS) guarantee against the required data rate proportion allocation (RDR-PA) method.
- 23 March 2019
- Published by Springer Nature
- p. 1-7
Indoor Visible Light Communication Networks for Camera-Based Mobile Sensing
- 23 March 2019
- Published by Springer Nature
- p. 1-7
Indoor Visible Light Communication Networks for Camera-Based Mobile Sensing
- Open Access
- 25 July 2018
- Published by MDPI AG in Applied Sciences
- Vol. 8 (8) , 1219
Power Allocation of Non-Orthogonal Multiple Access Based on Dynamic User Priority for Indoor QoS-Guaranteed Visible Light Communication Networks
Non-orthogonal multiple access (NOMA) simultaneously provides multi-user access over the same frequency band or time period, which can significantly improve system throughput in visible light communication (VLC) networks. However, the different interference components of NOMA and the diversified user requirements in VLC are difficult to coordinate. To guarantee both throughput enhancement and quality of service (QoS) satisfaction, this paper presents a power allocation scheme based on dynamic user priority in indoor NOMA-VLC networks. We introduce fuzzy logic (FL) to flexibly analyse user priority and assign signal power using multi-dimensional user features. The experimental results show that our method achieves the best performance in terms of user fairness and satisfaction. In indoor VLC, which has small cells with a high user density, our method outperforms contrastive schemes in terms of the average user data rate (AUDR). Therefore, in comparisons between static and dynamic user priority, our study indicates the fairness advantages of FL for the dynamic evaluation of user priority. In comparisons between NOMA and orthogonal multiple access, our study reflects the AUDR advantages of non-orthogonal methods. Furthermore, in comparisons of user satisfaction, our method outperforms existing methods, indicating the achievement of the QoS guarantee.
- 25 July 2018
- Published by MDPI AG in Applied Sciences
- Vol. 8 (8) , 1219
Open AccessPower Allocation of Non-Orthogonal Multiple Access Based on Dynamic User Priority for Indoor QoS-Guaranteed Visible Light Communication Networks
Non-orthogonal multiple access (NOMA) simultaneously provides multi-user access over the same frequency band or time period, which can significantly improve system throughput in visible light communication (VLC) networks. However, the different interference components of NOMA and the diversified user requirements in VLC are difficult to coordinate. To guarantee both throughput enhancement and quality of service (QoS) satisfaction, this paper presents a power allocation scheme based on dynamic user priority in indoor NOMA-VLC networks. We introduce fuzzy logic (FL) to flexibly analyse user priority and assign signal power using multi-dimensional user features. The experimental results show that our method achieves the best performance in terms of user fairness and satisfaction. In indoor VLC, which has small cells with a high user density, our method outperforms contrastive schemes in terms of the average user data rate (AUDR). Therefore, in comparisons between static and dynamic user priority, our study indicates the fairness advantages of FL for the dynamic evaluation of user priority. In comparisons between NOMA and orthogonal multiple access, our study reflects the AUDR advantages of non-orthogonal methods. Furthermore, in comparisons of user satisfaction, our method outperforms existing methods, indicating the achievement of the QoS guarantee.
- Open Access
Passive Location Resource Scheduling Based on an Improved Genetic Algorithm
With the development of science and technology, modern communication scenarios have put forward higher requirements for passive location technology. However, current location systems still use manual scheduling methods and cannot meet the current mission-intensive and widely-distributed scenarios, resulting in inefficient task completion. To address this issue, this paper proposes a method called multi-objective, multi-constraint and improved genetic algorithm-based scheduling (MMIGAS), contributing a centralized combinatorial optimization model with multiple objectives and multiple constraints and conceiving an improved genetic algorithm. First, we establish a basic mathematical framework based on the structure of a passive location system. Furthermore, to balance performance with respect to multiple measures and avoid low efficiency, we propose a multi-objective optimal function including location accuracy, completion rate and resource utilization. Moreover, to enhance its practicability, we formulate multiple constraints for frequency, resource capability and task cooperation. For model solving, we propose an improved genetic algorithm with better convergence speed and global optimization ability, by introducing constraint-proof initialization, a penalty function and a modified genetic operator. Simulations indicate the good astringency, steady time complexity and satisfactory location accuracy of MMIGAS. Moreover, compared with manual scheduling, MMIGAS can improve the efficiency while maintaining high location precision.
Open AccessPassive Location Resource Scheduling Based on an Improved Genetic Algorithm
With the development of science and technology, modern communication scenarios have put forward higher requirements for passive location technology. However, current location systems still use manual scheduling methods and cannot meet the current mission-intensive and widely-distributed scenarios, resulting in inefficient task completion. To address this issue, this paper proposes a method called multi-objective, multi-constraint and improved genetic algorithm-based scheduling (MMIGAS), contributing a centralized combinatorial optimization model with multiple objectives and multiple constraints and conceiving an improved genetic algorithm. First, we establish a basic mathematical framework based on the structure of a passive location system. Furthermore, to balance performance with respect to multiple measures and avoid low efficiency, we propose a multi-objective optimal function including location accuracy, completion rate and resource utilization. Moreover, to enhance its practicability, we formulate multiple constraints for frequency, resource capability and task cooperation. For model solving, we propose an improved genetic algorithm with better convergence speed and global optimization ability, by introducing constraint-proof initialization, a penalty function and a modified genetic operator. Simulations indicate the good astringency, steady time complexity and satisfactory location accuracy of MMIGAS. Moreover, compared with manual scheduling, MMIGAS can improve the efficiency while maintaining high location precision.