In this paper we make use of Time Warp for the distribute dsimulation of a dynamic channel allocation scheme known as channel segregation. Channel segregation requires that signal stregnth computation be made continuously, imposing a heavy load on the simulation. We compare the performance of the channel segregation algorithm to a fixed channel allocation algorithm. The main objective of our experiments was to determine limitations on our ability to make use of distributed simulation for wireless networks.
Citation:
C. O. Cismasu, C. Tropper, "Distributed Simulation of Dynamic Channel Access Protocols," mascots, pp.0329, 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02), 2002