ospf-5----Page:15
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
|
Simulation in Mobile Networks Algorithm simulated: Essential CDS algorithm, persistent version. Mobile network model: Nodes are placed randomly in unit square. Random direction is selected initially for each node. At each step, each node moves 1/10 of transmission radius in its selected direction, bouncing off sides of square as in billiards. Simulation is run for 500 steps. (Each step can be 1 sec for very fast mobility.) Two values used for transmission radius: 0.3 and 0.5. Performance measures: Average number of DRs and BDRs. Average number of adjacencies, compared to average number of total edges. Average rate of new adjacencies per step, compared to average rate of new edges per step. (Important since database exchange must be performed for each new adjacency.) |