… paper, we provide upper bounds on the packet propagation speed for opportunistic routing,
in a … We analyze the performance of various opportunistic routing strategies and we compare …

… 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 …

… 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, …

… (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 …

… 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 …

… Similarly, in Figure 7 (d), the most reliable OR scheme is used as an upper bound. The
simulation results show that the benefit value has a direct impact on the OpRENU, cost, and …

… conventional routing algorithms [10]–[13] whose performance is bounded by … by opportunistic
routing. Fig. 8 compares the expected transmission cost for the three opportunistic routing …

… bounds to the minimum expected number of transmissions that can be achieved in a network
using opportunistic routing. … In this section we compute an upper bound for the expected …

… 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. …

… First, let’s examine a way to compute an upper bound, say Δ, of the expected cost for the
node set Opt+ as follows. If node vk+1 receives the packet and node vk doesn’t, then node vk+1 …