Chen Te-fang

Research of UAV communication relay deployment problems in target reconnaissance mission

When UAVs carry out reconnaissance mission, it needs a reliable communication link as a guarantee for the purpose of transmitting the target intelligence data back to the ground control station. In most cases, is impossible to meet the demand of data transmission relying only on the Communication ability of one UAV. Through the use of multiple UAVs to build a communication relay link, is a feasible method to realize remote data transmission. In the presence of communication blind area and the limited number of available UAV, how to locate UAV reasonably, in order to get better communication relay link quality, is the focus of concern. The UAV deployment problem with single target and multi targets is modeled as AHOP problem and Steiner tree problem respectively. We propose the IBF algorithm based on Bellman-Ford algorithm, and propose the PGA algorithm based on the combination of Pareto solution and GA algorithm, to solve the problem of deploying UAV in the communication relay link with single and multi target respectively, carries out simulation test and analysis results, which shows the effectiveness of the IBF algorithm and PGA algorithm.

A Data Mapping Strategy of Parallel Data Mining in Grid

In order to achieve data load balancing of mining nodes in parallel data mining based on grid, this paper proposes a data mapping strategy based on minimum time cost: MapND. Firstly, MapND strategy divided data sets referenced in the data mining into data blocks; Then, the strategy respectively estimated the sum of transmission time and data mining time between each mining node and each data block, and mapped each data block to corresponding mining node according to the minimum time sum. Experimental results show that the proposed MapND strategy can solve the problem of data load balancing for data mining nodes, and improve the performance of parallel data mining in grid.