Moving-intersecting-information-based matching algorithm for dynamic DDM

The HLA Data Distribution Management (DDM) service provides value-based data filtering capability to reduce the transmission and reception of irrelevant data. The performance of DDM relies strongly on the computation of the intersection between update and subscription regions. Currently, there are several typical DDM matching algorithms. Since these algorithms are still not good enough to deal with the scenarios that the regions need to be modified along with the simulation advancement dynamically, this paper proposes a more effective matching algorithm, which is called Moving-Intersecting-Information-Based Matching Algorithm (MIIBM). MIIBM uses range intersecting information during a range moving, and limits the matching computing only in the moving area. Our experiment result shows that MIIBM has the best computational performance and is suitable for the requirements of large-scale distributed simulation that has a large number of dynamic regions.