Utilizing correlated node mobility for efficient DTN routing

Abstract

In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly not known. Therefore, effective forwarding based on limited knowledge of contact behavior of nodes is challenging. Most of the previous studies assumed that mobility of a node is independent from mobility of other nodes and looked at only the pairwise node relations to decide routing. In contrast, in this paper, we analyze the temporal correlation between the meetings of each node with other nodes and utilize this correlation for efficient routing. We introduce a new metric called conditional intermeeting time (CIT), which computes the average intermeeting time between two nodes relative to a meeting with a third node. Then, we modify existing DTN routing protocols using the proposed metric to improve their performance. Extensive simulations based on real and synthetic DTN traces show that the modified algorithms perform better than the original ones.

An Optimized Probabilistic Delay Tolerant Network (DTN) Routing Protocol Based on Scheduling Mechanism for Internet of Things (IoT)

“…Some routing protocols calculate transmission reliability by using history information such as encounters [7,12,13]. Bulut et al calculates the average encountering time to select the nodes [14]. Social-based approaches attempt to exploit the social behaviors of DTN nodes to make better routing decisions.…”

Two birds, one stone: Using mobility behavioral profiles both as destinations and as a routing tool

“…Routing protocols, as Prophet [24], use the historic of past contacts between nodes to infer how likely is for them to meet again. Also, in [6], the authors aim to improve the performance of a set of routing protocols based on the idea that two nodes that have frequently contacted at a particular time in previous cycles are likely to meet arount the same time in the next cycles.…”

“…Defined as "the area where someone is more likely to be found, based on his historical whereabouts", the habitat models the area where a node has spent most of his time in the near past, so, it considers both the locations a node visits and the visits' frequency. Considering the power of routine (most of people's lyfe-cicles are repeated on a daily or weekly basis [6]) PrivHab+ assumes that the best place to try to deliver a message to a node is its habitat. Henceforth, we will use nodes' habitats as a representation of their mobility profiles.…”

Methodologies for effective self-adaptive decisions in routing, signaling, cooperation, and other operations in diverse mobile networks

“…In sparsely connected networks, node mobility is exploited to create more forwarding opportunities [26,55]. The carry-based protocols take advantage of mobility information [12,38,61,74] of the nodes in order to progress the routing procedure through the physical motion of each of the routing participants. The selection of efficient carriers leads to a significantly slower data delivery than the forward action (something that is true in a denser environment) but with shortest path (i.e.…”

“…Such protocols exploit the forwarding action, due to the spatial transposition of messages effected by hops from one node to the next, towards the final destination. On the contrary, in sparse topologies carry-based multihop protocols [12,38] fit better. They implement a store-carry-forward mechanism, using information about the velocity of the nodes when selecting the next-hop node to forward the message.…”