13.07.2015 Views

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

30 P. Narayan and V.R. Syrotiukrandom waypo<strong>in</strong>t model [3] with a maximum velocity v, which varies from 0 m/sto 10 m/s. The mobility model is also characterized <strong>by</strong> a pause time.Our experiments use constant bit rate (CBR) data sources over UDP for datacommunication. The primary goal of our current experiments is to illustrate thebehaviour of rout<strong>in</strong>g protocols for simple cases. Therefore, we choose UDP asour transport layer protocol <strong>in</strong> order to elim<strong>in</strong>ate the <strong>in</strong>fluence of congestion andflow control mechanisms on the performance of the rout<strong>in</strong>g protocol.3.2 Traffic and Mobility PatternsFor a typical ns-2 wireless simulation, a connection pattern file designates theconfiguration and behaviour of data connections <strong>in</strong> the network scenario to besimulated. It specifies the end po<strong>in</strong>ts between which the data flow takes place,when the data flow over the connection should start and stop, and the typeof application data sent <strong>by</strong> the source. In our experiments, each connectionpattern file has one s-t pair and a CBR connection between them to elim<strong>in</strong>ateany possibility of collisions or buffer overflow due to high network load.For each s-t pair, the data flow starts and ends at a random time. A script togenerate connection pattern files is provided with the CMU extensions to ns-2[3]. We modify the CMU script to impose the restriction that each connectionlast for at least 100 seconds.A mobility pattern file def<strong>in</strong>es the motion of the nodes <strong>in</strong> the network andthe changes <strong>in</strong> the paths between the nodes over time. A program to generatethe mobility pattern is also provided [3]. By default, this program assumes afixed transmission range of 250 m to denote one hop. The <strong>in</strong>itial positions of thenodes are designated at random and the move sequences are generated accord<strong>in</strong>gto the random waypo<strong>in</strong>t mobility model.Us<strong>in</strong>g an approach similar to Holland and Vaidya [9,10], we generate mobilitypatterns for the network of 20 nodes mov<strong>in</strong>g with a mean speed of 2 m/s for 1800seconds and a pause time of 0 s. We call these mobility pattern files base patterns.We generate 5 such base pattern files. These base pattern scripts are used togenerate mobility patterns for mean speeds of 4, 6, 8 and 10 m/s, respectively.3.3 Extraction of the Mobile GraphIn order to generate the mobile graph for a given scenario, we sample the currentposition of every mobile node at regular <strong>in</strong>tervals and output the l<strong>in</strong>k transitionsthat occurred with<strong>in</strong> each <strong>in</strong>terval. The sampl<strong>in</strong>g <strong>in</strong>terval is such that we obta<strong>in</strong>100 samples before the node travels through its transmission radius once.The <strong>in</strong>itial connectivity matrix translates <strong>in</strong>to the first graph sequence <strong>in</strong> themobile graph. By apply<strong>in</strong>g l<strong>in</strong>k additions and breakages recorded at differenttime <strong>in</strong>tervals, we obta<strong>in</strong> the graphs <strong>in</strong> the graph sequence over the time scaleequal to the total simulation time.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!