Due to the increased capabilities of mobile devices and through wireless opportunistic contacts, users can experience new ways to share and retrieve content anywhere and anytime, even in the presence of link intermittency. Due to the significant number of available routing solutions, it is difficult to understand which one has the best performance, since all of them follow a different evaluation method. This paper proposes an assessment model, based on a new taxonomy, which comprises an evaluation guideline with performance metrics and experimental setup to aid designers in evaluating solutions through fair comparisons. Simulation results based on the proposed model revisit the performance results published by Epidemic, PROPHET, and BubbleRap, showing how they perform under the same set of metrics and scenario.
Zhang (2006) @cite_14 provides a classification with two main categories, deterministic and stochastic, which also considers the type of knowledge used for routing. The main goal is to solely categorize routing solutions based on the information used to perform data exchange.
@cite_14
2398179450
We consider the stochastic on-time arrival (SOTA) problem of finding the optimal routing strategy for reaching a given destination within a pre-specified time budget and provide the first results on using preprocessing techniques for speeding up the query time. We start by identifying some properties of the SOTA problem that limit the types of preprocessing techniques that can be used in this setting, and then define the stochastic variants of two deterministic shortest path preprocessing techniques that can be adapted to the SOTA problem, namely reach and arc-flags. We present the preprocessing and query algorithms for each technique, and also present an extension to the standard reach based preprocessing method that provides additional pruning. Finally, we explain the limitations of this approach due to the inefficiency of the preprocessing phase and present a fast heuristic preprocessing scheme. Numerical results for San Francisco, Luxembourg and a synthetic road network show up to an order of magnitude improvement in the query time for short queries, with even larger gains expected for longer queries.