Accuracy-Speedup Tradeoffs for a Time-Parallel Simulation of Wireless Ad hoc Networks

We introduce a scalable algorithm for time-parallel simulations of wireless ad hoc networks and report on our results. Our approach decomposes the simulation into overlapping temporal components; the individual components are computed using an unmodified sequential network simulator such as NS-2. Our algorithm is iterative and the accuracy of the results increases with the number of iterations. We find that the approach allows the simulation of ad hoc networks with a number of nodes larger than those feasible with sequential network simulators on single CPUs. The algorithm is scalable, we can simulate larger time intervals by increasing the number of virtual processors carrying out the simulation. We identify the parameters that can be investigated with the algorithm and report on the accuracy of our results and on the achieved simulation speedup.

• Type: Conference
• Year: 2006
• Where: LCN
• Authors: Guoqiang Wang, Damla Turgut, Ladislau Bölöni, Dan C. Marinescu
• Keywords: Ad Hoc Networks, Algorithm, LCN 2006, Sequential Network Simulators