Tanghuai Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tanghuai Fan has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Baohong Liu
School of Information Engineering, Jiangxi University of Water Resources and Electric Power Nanchang China
1 shared publication - Baohong Liu
Fudan University
1 shared publication - Kang Ren
Department of Radiation Oncology, Peking Union Medical College Hospital, Chinese Academy of Medical Sciences and Peking Union Medical College, Beijing, China
1 shared publication - Keyong Shen
College of Computer Information and Engineering, Nanchang Institute of Technology, Nanchang, 330044 Jiangxi, China
1 shared publication - Li Lv
School of Information Engineering, Nanchang Institute of Technology, Nanchang, China
1 shared publication Lianguo Li
Jiangxi wudayangfan Technology Co., Ltd, Nanchang 330029, China
1 shared publication
Latest Publications
- Open Access
- 1 November 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2095 (1) , 012033
A Clustering Routing Algorithm for Wireless Sensor Monitoring Network in Irrigation Area
It is the basis for the implementation and scientific management decision of precision irrigation to accurately and comprehensively sense water and rainfall regime, soil moisture content and engineering conditions in irrigation areas and various environmental factors closely related to crop growth. In view of the characteristics of large monitoring range and scattered distribution of measuring points in the irrigation area, based on the analysis of the characteristics of the strip shape layout of the wireless sensor network at the water demand side of the irrigation area, and the limited battery energy and transmission distance under the condition of battery power supply, a clustering routing algorithm based on wireless sensor network for monitoring irrigation area is proposed (known simply as CRAIM algorithm). The formation of clusters, the selection of cluster heads, the routing process between clusters and the sink nodes are studied, and the CRAIM algorithm, EE-LEACH (energy-efficient LEACH) and MMH-LEACH (modified multi-hop LEACH) algorithm are simulated and compared respectively. Experimental results showed that, the new algorithm, CRAIM, has some advantages in the energy consumption of the network.
- 1 November 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2095 (1) , 012033
Open AccessA Clustering Routing Algorithm for Wireless Sensor Monitoring Network in Irrigation Area
It is the basis for the implementation and scientific management decision of precision irrigation to accurately and comprehensively sense water and rainfall regime, soil moisture content and engineering conditions in irrigation areas and various environmental factors closely related to crop growth. In view of the characteristics of large monitoring range and scattered distribution of measuring points in the irrigation area, based on the analysis of the characteristics of the strip shape layout of the wireless sensor network at the water demand side of the irrigation area, and the limited battery energy and transmission distance under the condition of battery power supply, a clustering routing algorithm based on wireless sensor network for monitoring irrigation area is proposed (known simply as CRAIM algorithm). The formation of clusters, the selection of cluster heads, the routing process between clusters and the sink nodes are studied, and the CRAIM algorithm, EE-LEACH (energy-efficient LEACH) and MMH-LEACH (modified multi-hop LEACH) algorithm are simulated and compared respectively. Experimental results showed that, the new algorithm, CRAIM, has some advantages in the energy consumption of the network.
- 25 September 2020
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 33 (5)
Density peaks clustering based on k‐nearest neighbors sharing
Summary: The density peaks clustering (DPC) algorithm is a density‐based clustering algorithm. Its density peak depends on the density‐distance model to determine it. The definition of local density for samples used in DPC algorithm only considers distance between samples, while the environments of samples are neglected. This leads to the result that DPC algorithm performs poorly on complex data sets with large difference in density, flow pattern or cross‐winding. In the meantime, the fault tolerance of allocation strategy for samples is relatively poor. Based on the findings, this article proposes a density peaks clustering based on k‐nearest neighbors sharing (DPC‐KNNS) algorithm, which uses the similarity between shared neighbors and natural neighbors to define the local density of samples and the allocation. Comparison between theoretical analysis and experiments on various synthetic and real data reveal that the algorithm proposed in this article can discover the cluster center of complex data sets with large difference in density, flow pattern or cross‐winding. It can also provide effective clustering.
- 25 September 2020
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 33 (5)
Density peaks clustering based on k‐nearest neighbors sharing
Summary: The density peaks clustering (DPC) algorithm is a density‐based clustering algorithm. Its density peak depends on the density‐distance model to determine it. The definition of local density for samples used in DPC algorithm only considers distance between samples, while the environments of samples are neglected. This leads to the result that DPC algorithm performs poorly on complex data sets with large difference in density, flow pattern or cross‐winding. In the meantime, the fault tolerance of allocation strategy for samples is relatively poor. Based on the findings, this article proposes a density peaks clustering based on k‐nearest neighbors sharing (DPC‐KNNS) algorithm, which uses the similarity between shared neighbors and natural neighbors to define the local density of samples and the allocation. Comparison between theoretical analysis and experiments on various synthetic and real data reveal that the algorithm proposed in this article can discover the cluster center of complex data sets with large difference in density, flow pattern or cross‐winding. It can also provide effective clustering.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2625-2630
Challenges and Statues of Rectifier for Far Field Wireless Energy Harvester in Power Variation of Input RF/microwave Signal
Rectifier is the core of far field wireless energy harvester (FFWEH) and its performances have imposed serious effects on application of FFWEH system. In the real applications, environmental conditions such as absorption, reflection, multipath fading lead to lots of challenges to harvester development, especially its core rectifier. In the paper, challenges and the relative approach of rectifier development for FFWEH in variation of incident RF power are presented. Firstly, the characteristics of rectifier tightly related to the incident wave power are briefly introduced. Then, Challenges in rectifier design are analyzed in details. Lastly, recent approaches for these challenges are reviewed and analyzed in details. Depended on these effective approaches rectifier can get enhancement of performances to mitigate impacts of environment conditions.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2625-2630
Challenges and Statues of Rectifier for Far Field Wireless Energy Harvester in Power Variation of Input RF/microwave Signal
Rectifier is the core of far field wireless energy harvester (FFWEH) and its performances have imposed serious effects on application of FFWEH system. In the real applications, environmental conditions such as absorption, reflection, multipath fading lead to lots of challenges to harvester development, especially its core rectifier. In the paper, challenges and the relative approach of rectifier development for FFWEH in variation of incident RF power are presented. Firstly, the characteristics of rectifier tightly related to the incident wave power are briefly introduced. Then, Challenges in rectifier design are analyzed in details. Lastly, recent approaches for these challenges are reviewed and analyzed in details. Depended on these effective approaches rectifier can get enhancement of performances to mitigate impacts of environment conditions.