Fig 1.
An example of the benefits of OR compared to traditional routing.
Table 1.
Related works comparison.
Table 2.
Notations used in this paper.
Table 3.
Probabilistic analysis of Ys(AN[i]).
Fig 2.
Candidate set selection and packet forwarding of Node SRC.
Fig 3.
Candidate set selection and packet forwarding of Node C.
Fig 4.
Candidate set selection and packet forwarding of Node F.
Fig 5.
Candidate set selection and packet forwarding of Node I.
Fig 6.
Packets header.
Table 4.
Simulation parameters.
Fig 7.
Average network throughput in the 10-node scenario.
Fig 8.
Average network throughput in the 15-node scenario.
Fig 9.
Average network throughput in the 20-node scenario.
Fig 10.
Average network throughput in the 50-node scenario.
Fig 11.
The average throughput of D-ORCD in different network loads and densities.
Fig 12.
The average throughput of BORA in different network loads and densities.
Fig 13.
The average throughput of the proposed algorithm in different network loads and densities.
Fig 14.
Average end-to-end delay in the 10-node scenario.
Fig 15.
Average end-to-end delay in the 15-node scenario.
Fig 16.
Average end-to-end delay in the 20-node scenario.
Fig 17.
Average end-to-end delay in the 50-node scenario.
Fig 18.
Network scalability in different network densities and different offered loads.