G. Wang, D. Turgut, L. Bölöni, and D.C. Marinescu

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


Cite as:

G. Wang, D. Turgut, L. Bölöni, and D.C. Marinescu. Accuracy-Speedup Tradeoffs for a Time-Parallel Simulation ofWireless Ad hoc Networks. In Proceedings of Second IEEE International Workshop on Performance and Management of Wireless and Mobile Networks (P2MNet), pp. 730–737, November 2006.

Download:

Download 

Abstract:

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.

BibTeX:

@inproceedings{Wang-2006-P2MNet,
author = "G. Wang and D. Turgut and L. B{\"o}l{\"o}ni and D.C. Marinescu",
title = "Accuracy-Speedup Tradeoffs for a Time-Parallel Simulation of
Wireless Ad hoc Networks",
booktitle = "Proceedings of Second IEEE International Workshop on Performance and Management of Wireless and Mobile Networks (P2MNet)",
location = "Tampa, Florida",
month = "November",
year = "2006",
pages = "730-737",
abstract = {
  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.
 },
}

Generated by bib2html.pl (written by Patrick Riley, Lotzi Boloni ) on Thu Sep 26, 2019 13:02:58