In this subsection, we present the results of our experiments used to verify the effectiveness of our algorithm in MWNs using three different scenarios, namely chain, grid, and dumbbell topologies.
The field sampled plots for the preliminary sample (199 plots) were a random selection of a 400 m by 400 m (20 by 20 chain) grid.
A random sample of points located at the intersections of a 400 m by 400 m (20 by 20 chain) grid was chosen to cover a broad spatial area.
Most recently (2006 to 2008), all cruising occurred on a 400 by 400 meter (20 by 20 chain) grid that covered the full ownership using 4.6 Basal Area Factor prisms (Table 2).
Our simulations include a number of chains, grids, and random multihop network topologies, including both upstream and downstream flows, with up to a maximum of 35 simultaneously active nodes transmitting via a single gateway.
For decades network systems have been modeled either as chains, grids, lattices and fully-connected graphs which are completely regular or as random Erdős-Rényi network whose node degrees follow a Poisson distribution [ 3].
The NS2-based simulation results demonstrate that D2OFC2 outperforms default TCP and ATCP to achieve an efficient and fair resource allocation in Ad Hoc networks under three scenarios, including chain topology, grid topology, and random topology.
We measured throughput in terms of the number of hops, number of flows, varying bandwidths, different packet loss rates, and varying delays using chain and grid topologies.
These compounds feature a high diversity of topologies that include linear, zigzag, double, triple and quadruple 1D chains, rectangular grids, flat and undulating 2D layers, as well as layer-pillared, octahedral, zeolite-like, honeycomb-like and other complex 3D nets, in which hmt acts as a linker or spacer, pillar or connector, stabilizer and/or supporting ligand.
We evaluate several performance metrics like throughput, packet loss, and delay, under three different topologies: a chain topology, a grid topology, and a linear topology.
Through experiments, we aimed to evaluate how much our algorithm improves the performance of TCP in MWNs. Figure 9 Network topologies (a) chain and (b) grid.
