Experimental results demonstrate that adding the refinement-based routing protocol to AODV significantly reduces the number of broken paths and the end-to-end packet latency when compared with the pure on-demand routing protocol, AODV.
The difference between AODV and AODV_DT is due to the reduction in the number of broken paths.
The number of broken paths introduced by a knock-out is taken here as a measure of the essentiality of the protein in maintaining the network.
For each KO performed, the number of completely broken paths as well as the number of paths perturbed as a result of increased path cost was calculated.
A total of 323 genes (Additional file 1: Table S1) when knocked out showed broken paths in the network.
Dynamic local stitching algorithm has a major difference with other existing routing algorithms in rectifying broken paths; despite others that reroute whole paths, our algorithms only stitch broken fragments of the original path spending minimum amount of energy as well as recovery time.
When Q k is between the -1 and 0, we should do some research on how to sliding the barriers to change the break paths in a rolling time to prevent the risk of an intruder following a fix one.
"They speak as if Imam [Khomeini] belongs to them only and others have broken path with the imam".
Recall that Lr is the average length of the path from the broken link to the source (Lr < Lh).
When Q k ≤0, the smaller value of Q k, the more break paths are existing in the belt.
