R3

Abstract

Our work is motivated by a simple question: can we design a simple routing protocol that ensures robust performance across networks with diverse connectivity characteristics such as meshes, MANETs, and DTNs? We identify packet replication as a key structural difference between protocols designed for opposite ends of the connectivity spectrum-DTNs and meshes. We develop a model to quantify under what conditions and by how much replication improves packet delays, and use these insights to drive the design of R3, a routing protocol that self-adapts replication to the extent of uncertainty in network path delays. We implement and deploy R3 on a mesh testbed and a DTN testbed. To the best of our knowledge, R3 is the first routing protocol to be deployed and evaluated on both a DTN testbed and a mesh testbed. We evaluate its performance through deployment, trace-driven simulations, and emulation experiments. Our results show that R3 achieves significantly better delay and goodput over existing protocols in a variety of network connectivity and load conditions.

An Adaptive Anycasting Solution for Crowd Sensing in Vehicular Environments

“…Anyway, such highly mutable and heterogeneous context represents a problem for network protocols, which are typically designed for more homogeneous scenarios: state-ofthe-art routing protocols designed for one environment either work poorly or are unsuitable in others; limitations have been demonstrated, see [7]. For example, protocols based on traditional link-state or distance vector routing cannot work in DTNs where a contemporaneous end-to-end path is unavailable.…”

Cooperative opportunistic data delivery solutions for challenging wireless networks

“…A batch of data delivery solutions for intermittent or partially disconnected networks also known as opportunistic networks (OppNets) or delay tolerant networks (DTNs) were proposed in early 2000s [16,17] and new solutions are evolving [18,19,20,21,22,23,24,25,26,27,28]. The fundamental idea behind these protocols is the store-carry-forward (SCF) routing paradigm.…”

“…Longer data delivery delay, resource consumption and information epidemics become the major problems in SCF routing. Various forms of SCF routing protocols have been proposed and can be broadly classified as epidemicsbased routing [29,30,21], quota-based routing [31,20,24], probabilisticbased routing [32,33], mobility-based routing [34,35], and social-based routing [26,18,22,36].…”

“…SCFbased forwarding is used when the end-to-end connection breaks or the path cannot be found. Some select multiple forwarding paths and replicate data packet copies along the predetermined multiple paths [21]. In short, these approaches combine end-to-end routing and SCF-based routing to shorten delivery delay and minimize resource consumption and information epidemic.…”

“…Extensive research on routing in mobile wireless networks has been carried out. These includes end-to-end routing [10], cooperative forwarding [41,14], and SCF routing [19,18,28,21,30,23,31,33,43,24,29,48,54]. The summary of the related works is also given in [31,33,24].…”