Single-copy routing in intermittently connected mobile networks

Abstract

Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from source to destination, or such a path is highly unstable and may break soon after it has been discovered. In this context, conventional routing schemes would fail.To deal with such networks we propose the use of an opportunistic hop-by-hop routing model. According to the model, a series of independent, local forwarding decisions are made, based on current connectivity and predictions of future connectivity information diffused through nodes' mobility. The important issue here is how to choose an appropriate next hop. To this end, we propose and analyze via theory and simulations a number of routing algorithms. The champion algorithm turns out to be one that combines the simplicity of a simple random policy, which is efficient in finding good leads towards the destination, with the sophistication of utility-based policies that efficiently follow good leads. We also state and analyze the performance of an oracle-based optimal algorithm, and compare it to the online approaches. The metrics used in the comparison are the average message delivery delay and the number of transmissions per message delivered.

Survey and Comparison of Operating Concept for Routing Protocols in DTN

“…Since ER is known to consume lot of network resources (buffer space and bandwidth), this protocol is appropriate for animal monitoring networks such as Zebra Net and Shared Wireless Infostation Model (SWIM), where random mobility patterns and contacts cannot be predicted (Spyropoulos et al, 2004;Suganthe and Balasubramanie, 2008). As the number of duplicated messages will be very large, this routing protocol is not useful for dense networks.…”

“…It may take a very long time before each node receives the delivery predictability of other nodes because of disconnect nature of the networks. Moreover, in case of big networks and as mentioned in (Spyropoulos et al, 2004), the source node may take longer time before finding a message forwarder with high delivery predictability to the destination. Which called the slow start problem.…”

Movement Models Based Performance Comparison of Routing Protocols in Delay Tolerant Networks

“…[10]proposed an effective routing approach named Spray and wait routing scheme to control the flooding in the network. In this routing scheme, there are two different phases: a) Spray phase(only once):L message copies are initially spread to L distinct "relays".…”

Fair content dissemination in participatory DTNs

“…The very first generation of routing proto-cols focused almost entirely on achieving high delivery; they did so by replicating (flooding) messages in the network, while relying on incidental deliveries caused by opportunistic encounters (e.g., [11,12]). However, the traffic they generated caused significant network overhead; to strike a balance between delivery and overhead, probabilistic routing schemes were then developed so to control flooding (e.g., [3,1,13,14,15,16]). These protocols were mainly evaluated by means of simulation, using synthetic movement traces that followed the Random Waypoint Model [17].…”