… theoretical bounds on the packet propagation speed with generic opportunistic routing …
; • we verify the accuracy of our bounds in numerous scenarios using numerical simulations: …

… Therefore, it is necessary to give k an upper bound, this bound turns out to be the maximum
number of blocks that can be sent over during a contact duration. The performance of R-EC, …

… The upper bound on the algorithm’s convergence time (in number of iterations) is the same
as for single-path Bellman-Ford. The complexity of the LCOR algorithm is however greater, …

… We identify an upper bound of EOT and proof its concavity. Based on the EOT, we also
propose a local candidate selection and prioritization algorithm. Simulation results validate our …

… priority of a routing task, a higher priority routing task should … is used as a low bound for the
maxOpRENU OR scheme … scheme is used as an upper bound. The simulation results show …

… Before establishing our trade-off results, we start from the following lemma, which shows
lower and upper bounds on the number of nodes in each cell available as potential relays. …

… (EBR) [85] a quota-based protocol in which an upper bound on the number of replicas
allowed in the network is fixed during message creation. Similar to Delegation Forwarding, EBR …

… In this section we compute an upper bound for the expected number of transmissions by …
computed for such network will be an upper bound to the minimum expected number of …

… This has led to the latest genre of Replication based protocols—Quota based routing protocols.
In all the quota based protocols an upper bound on the number of replicas allowed in the …

… We first analyze a cut-set upper bound on the throughput scaling law of the network. It is …
upper bound almost matches the throughput scaling achieved by parallel opportunistic routing; …