With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

No credit card required

2.5 EXPERIMENTAL SIMULATIONS

We compare the performance of the proposed two Area algorithms, Min ID and Max Degree, with Rule 1&2 [11] and Alzoubi's algorithm [15] in this section. In the simulation scenario, a given number of nodes (ranging from 60 to 200 with an increment step of 20 and from 200 to 1000 with an increment step of 100, respectively) were randomly and uniformly distributed in a square simulation area of size 100 by 100 units. Each node has a fixed transmission range r (r = 15 and 30 units, respectively). All the simulation results presented here were obtained by running these algorithms on 300 connected graphs. This allows us to test these algorithms on increasing density of network from n = 60, r = 15, and μ(r) = 4 (sparse network) to n = 1000, r = 30, and μ(r) = 283 (very dense network).

When the CDS is used for routing in ad hoc networks, the number of nodes responsible for routing can be reduced to the number of nodes in the CDS. Thus, we prefer smaller size of CDS. Figure 2.3(a) and (b) shows the simulation results when the node's transmission range is 15 units. Figure 2.3(a) shows the trend when the number of nodes in the network ranges from 60 to 200 (the corresponding graph is sparse), whereas Figure 2.3(b) shows the trend when the number of nodes in the network ranges from 200 to 1000 (the corresponding graph is dense). The number of nodes in the CDS increases when more nodes join the network because the number of dominators increases and more nodes may ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

No credit card required