Tianbao Hao
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
Tianbao Hao has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Dehan Kong
Department of Information Engineering
3 shared publications - Xiang Gong
Department of Information Engineering, Hebei University of Environmental Engineering, Qinhuangdao 066102, China
3 shared publications Yongshan Liu
Department of Information Science and Engineering, Yanshan University, Hebei Street No. 438, Qinhuangdao 066004, Hebei, China
3 shared publicationsJianjun Wang
Department of Information Science and Engineering, Yanshan University, Hebei Street No. 438, Qinhuangdao 066004, Hebei, China
2 shared publicationsHaiyan Yang
Network Technology Center, Hebei Normal University of Science and Technology, Qinhuangdao, Hebei, China
1 shared publication- Jianjun Wang
Department of Information Science and Engineering, Yanshan University, Qinhuangdao, China
1 shared publication
Latest Publications
- Open Access
- 24 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 58473-58489
Research on Energy Consumption and Identifying Critical Nodes of Weighted Scale-Free Topology in Wireless Sensor Network
To address the problem of non-uniform energy consumption in wireless sensor networks, a weighted scale-free topological evolution model with localized energy isomers has been proposed. The relationship between node energy and strength and weight is established by modeling the relationship between node energy, load and energy consumption. A wireless sensor network energy balance topology control algorithm that conforms to power-law characteristics is established for degree distribution, node weight, and edge weight distribution. The energy balance of the network is achieved by controlling the energy parameters. Based on the intensity and weights obtained from the topology, we analyze the propagation index of node importance from both local and global perspectives, with the aim of avoiding the one-sidedness of a single attribute. The multi-attribute decision function is established using the influence indicators of neighboring nodes (Katz), the weighted mixed decomposition algorithm (W-MDD) and the weighted web page link algorithm (W-PageRank). The multi-attribute decision function is evolved into a multi-attribute weighted decision matrix using the TOPSIS method. The importance index of the nodes of the network is then obtained from the distance from the good-bad solution. Simulation results show that the proposed model not only accurately computes the load on nodes and edges, but also alleviates the imbalance in the energy consumption of nodes in scale-free networks. Moreover, the proposed critical node decision algorithm is more efficient than the single decision algorithm.
- 24 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 58473-58489
Open AccessResearch on Energy Consumption and Identifying Critical Nodes of Weighted Scale-Free Topology in Wireless Sensor Network
To address the problem of non-uniform energy consumption in wireless sensor networks, a weighted scale-free topological evolution model with localized energy isomers has been proposed. The relationship between node energy and strength and weight is established by modeling the relationship between node energy, load and energy consumption. A wireless sensor network energy balance topology control algorithm that conforms to power-law characteristics is established for degree distribution, node weight, and edge weight distribution. The energy balance of the network is achieved by controlling the energy parameters. Based on the intensity and weights obtained from the topology, we analyze the propagation index of node importance from both local and global perspectives, with the aim of avoiding the one-sidedness of a single attribute. The multi-attribute decision function is established using the influence indicators of neighboring nodes (Katz), the weighted mixed decomposition algorithm (W-MDD) and the weighted web page link algorithm (W-PageRank). The multi-attribute decision function is evolved into a multi-attribute weighted decision matrix using the TOPSIS method. The importance index of the nodes of the network is then obtained from the distance from the good-bad solution. Simulation results show that the proposed model not only accurately computes the load on nodes and edges, but also alleviates the imbalance in the energy consumption of nodes in scale-free networks. Moreover, the proposed critical node decision algorithm is more efficient than the single decision algorithm.
- Open Access
- 16 June 2022
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2022, 1-14
Visibility Detection of 3D Objects and Visual K-Nearest Neighbor Query Based on Convex Hull Model
With the rapid development of the technologies of virtual reality (VR) and augmented reality (AR), the accurate visual query of 3D objects which are closer to real world has become a hotspot of study. There are a lot of redundancy problems in the existing axis-aligned bounding box model (AABB) and oriented bounding box model (OBB), which are used to represent 3D objects mostly at present, and cannot be used for the accurate visual query. For example, the results of the visual query must be accurate, and without any error in automatic driving technology in the automotive industry, otherwise, serious safety problems would be caused. The convex hull model could be used to solve those problems. However, there are few studies on visual query based on the convex hull model. A visual query method for 3D obstacle space based on the convex hull model is proposed in this paper. Firstly, the definitions of “query point-object visual body” and “combined obstacle” are proposed. Secondly, the visibility detection algorithm of the convex hull model is given in detail. The collision detection method of “query point-object visible body” combined with other obstacles and line-plane geometric calculation operations are used to detect the visibility of the convex hull model. Then, a 3D visual k-nearest neighbor algorithm based on the convex hull model is given in the paper. Finally, the algorithm is verified by experiments and compared with the traditional visibility detection algorithm, and the analysis of experimental results shows that the algorithm has a great performance and higher accuracy. The growth rate of the query time is smaller, and the speed is faster; especially, when there are fewer query points, the query speed can be increased by more than 50%.
- 16 June 2022
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2022, 1-14
Open AccessVisibility Detection of 3D Objects and Visual K-Nearest Neighbor Query Based on Convex Hull Model
With the rapid development of the technologies of virtual reality (VR) and augmented reality (AR), the accurate visual query of 3D objects which are closer to real world has become a hotspot of study. There are a lot of redundancy problems in the existing axis-aligned bounding box model (AABB) and oriented bounding box model (OBB), which are used to represent 3D objects mostly at present, and cannot be used for the accurate visual query. For example, the results of the visual query must be accurate, and without any error in automatic driving technology in the automotive industry, otherwise, serious safety problems would be caused. The convex hull model could be used to solve those problems. However, there are few studies on visual query based on the convex hull model. A visual query method for 3D obstacle space based on the convex hull model is proposed in this paper. Firstly, the definitions of “query point-object visual body” and “combined obstacle” are proposed. Secondly, the visibility detection algorithm of the convex hull model is given in detail. The collision detection method of “query point-object visible body” combined with other obstacles and line-plane geometric calculation operations are used to detect the visibility of the convex hull model. Then, a 3D visual k-nearest neighbor algorithm based on the convex hull model is given in the paper. Finally, the algorithm is verified by experiments and compared with the traditional visibility detection algorithm, and the analysis of experimental results shows that the algorithm has a great performance and higher accuracy. The growth rate of the query time is smaller, and the speed is faster; especially, when there are fewer query points, the query speed can be increased by more than 50%.
- Open Access
- 11 May 2022
- Published by Wiley in Scientific Programming
- Vol. 2022, 1-13
Skyline-Like Query in Three-Dimensional Obstacle Space
Skyline query, as a query method to solve typical multiobjective optimization problems, has a wide range of applications in market analysis and data mining. Many scholars’ attention has been attracted since it was proposed. However, the correct result set cannot be obtained easily by traditional skyline query when nonspatial and spatial attributes of the data set need to be considered at the same time, and there are differences in the importance of each attribute. To solve this problem, a skyline-like query was proposed in three-dimensional obstacle space based on the traditional skyline query. In the skyline-like query algorithm, nonspatial skyline-like points were obtained according to the traditional algorithm. The spatial attribute dominated region of the obtained points was used to filter the data set, and then the shielding of obstacles was considered in the three-dimensional obstacle space. By constructing a three-dimensional visible graph, the Dijkstra algorithm was used to obtain the skyline-like points of spatial attribute. After sorting, the skyline-like point set was obtained based on the value of user’s preference. Compared with B2S2 algorithm, the experimental results show that the skyline-like algorithm had a better performance. Then, the comparative experiments within three-dimensional obstacle skyline query were carried out by setting different sizes of data sets and different numbers of obstacles. According to the results, it is shown that the algorithm had a great performance.
- 11 May 2022
- Published by Wiley in Scientific Programming
- Vol. 2022, 1-13
Open AccessSkyline-Like Query in Three-Dimensional Obstacle Space
Skyline query, as a query method to solve typical multiobjective optimization problems, has a wide range of applications in market analysis and data mining. Many scholars’ attention has been attracted since it was proposed. However, the correct result set cannot be obtained easily by traditional skyline query when nonspatial and spatial attributes of the data set need to be considered at the same time, and there are differences in the importance of each attribute. To solve this problem, a skyline-like query was proposed in three-dimensional obstacle space based on the traditional skyline query. In the skyline-like query algorithm, nonspatial skyline-like points were obtained according to the traditional algorithm. The spatial attribute dominated region of the obtained points was used to filter the data set, and then the shielding of obstacles was considered in the three-dimensional obstacle space. By constructing a three-dimensional visible graph, the Dijkstra algorithm was used to obtain the skyline-like points of spatial attribute. After sorting, the skyline-like point set was obtained based on the value of user’s preference. Compared with B2S2 algorithm, the experimental results show that the skyline-like algorithm had a better performance. Then, the comparative experiments within three-dimensional obstacle skyline query were carried out by setting different sizes of data sets and different numbers of obstacles. According to the results, it is shown that the algorithm had a great performance.
- Open Access
- 24 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 146010-146022
Research on Hybrid Index Based on 3D Multi-Level Adaptive Grid and R+ Tree
With the widespread application of Geographic Information System (GIS), three-dimensional spatial data, as the reflection of the real world entity, has an increasing amount of data, and the phenomenon of uneven data distribution appears. If a single spatial index structure is used to store and manage these data, there will be a waste of storage space and low query efficiency. A hybrid index structure based on 3D multi-level adaptive grid and R+ tree was proposed to solve these problems. The index structure was mainly composed of two structures, multi-level grid and R+ tree. Firstly, the data set was processed by the multi-level automatic grid algorithm based on normal distribution, and the length, width and height of the grid were obtained. Secondly, a multi-level adaptive grid structure was used to partition the data space quickly and effectively, and the advantage of zero overlap of the intermediate nodes of the R+ tree was used for efficient indexing. Finally, the maintenance and query algorithms of the index structure were given in detail, which solved the problem of low index establishment and retrieval efficiency under the condition of uneven distribution of massive data sets. In this paper, a data set subject to Gauss distribution was used to simulate the distribution of three-dimensional data. Through a large number of experimental comparison tests, it was proved that the hybrid index structure based on 3D multi-level adaptive grid-R+ tree proposed in this paper had good performance in both index structure construction and query in the case of massive data sets or uneven data distribution.
- 24 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 146010-146022
Open AccessResearch on Hybrid Index Based on 3D Multi-Level Adaptive Grid and R+ Tree
With the widespread application of Geographic Information System (GIS), three-dimensional spatial data, as the reflection of the real world entity, has an increasing amount of data, and the phenomenon of uneven data distribution appears. If a single spatial index structure is used to store and manage these data, there will be a waste of storage space and low query efficiency. A hybrid index structure based on 3D multi-level adaptive grid and R+ tree was proposed to solve these problems. The index structure was mainly composed of two structures, multi-level grid and R+ tree. Firstly, the data set was processed by the multi-level automatic grid algorithm based on normal distribution, and the length, width and height of the grid were obtained. Secondly, a multi-level adaptive grid structure was used to partition the data space quickly and effectively, and the advantage of zero overlap of the intermediate nodes of the R+ tree was used for efficient indexing. Finally, the maintenance and query algorithms of the index structure were given in detail, which solved the problem of low index establishment and retrieval efficiency under the condition of uneven distribution of massive data sets. In this paper, a data set subject to Gauss distribution was used to simulate the distribution of three-dimensional data. Through a large number of experimental comparison tests, it was proved that the hybrid index structure based on 3D multi-level adaptive grid-R+ tree proposed in this paper had good performance in both index structure construction and query in the case of massive data sets or uneven data distribution.