Dr. Fei Dai

Simulation

Wireless Routing Simulation Suite (WRSS)

Two toolkits are developped for simulation study of ad hoc routing protocols, both under the umbrella of a SourceForge project called wireless routing simulation suit (WRSS), and are free for downloading and reusing as long as you agree with the open source licence agreement (GPL).

Dominating Set (ds)

Dr. Jie Wu and Ms. Hailan Li proposed a simple and yet efficient algorithm called marking process that constructs a connected Dominating Set (DS), which acts as a backbone in routing activities. This algorithm is later enhanced by a pruning scheme called Rule k, proposed by myself and Dr. Wu. An extension of the marking process and Rule k is our generic localized broadcast scheme that accommodates more than 10 existing localized broadcast protocols. Our simulation program, called ds, compares different algorithms on their efficiency, in terms of the DS size, and formation overhead, in terms of the message and time complexity.

ds is written in C++ code, including a main module and a bunch of components (i.e., C++ classes), which can be roughly divided into three groups: (1) infrastructure: queue, heap, set, graph, topology and mobility generators, (2) algorithms: marking process, Rules 1, 2, and k, MCDS, clustering, generic broadcasting, link reversal, etc, (3) simulation suits: basic (Rules 1-k), comparison (with other schemes), locality (effects of a topology change), movement, energy, self-pruning, generic broadcasting, link reversal, and dense mode.

Generic Distributed Broadcasting (gdb)

In ds, we assume an ideal network without network mobility or MAC layer contension. A more realistic environment can be simulated via ns2, the well-known network simulator by UCB, USC, & CMU.