Proximity Detection in Distributed Simulation of Wireless Mobile Systems

The distributed and the Grid Computing architectures for the simulation of massively populated wireless systems have recently been considered of interest, mainly for cost reasons. Solutions for generalized proximity detection for mobile objects is a relevant problem, with a big impact on the design and the implementation of parallel and distributed simulations of wireless mobile systems. In this paper, a set of solutions based on tailored data structures, new techniques and enhancements of the existing algorithms for generalized proximity detection are proposed and analyzed, to increase the efficiency of distributed simulations. The paper includes the analysis of computation complexity of the proposed solutions and the performance evaluation of a testbed distributed simulation of ad hoc network models. Recent works have shown that the performance of distributed simulation of dynamic complex systems could benefit from a runtime migration mechanism of model entities, which reduces the communication overheads. Such migration mechanisms may interfere with the generalized proximity detection implementations. The analysis performed in this paper illustrates the effects of many possible compositions of the proposed solutions, in a real testbed simulation framework.