Semi-Probabilistic Routing in Intermittently Connected Mobile Ad Hoc Networks

Abstract

ICMANs (Intermittently Connected Mobile Ad hoc Networks) are wireless networks where most of the time there does not exist a complete path from the source to the destination. In this paper, a novel routing approach, SPR (Semi-Probabilistic Routing), is proposed to address routing problem in ICMANs. SPR takes into account information about host mobility and connectivity changes to produce estimates enabling more accurate message forwarding. These include maintaining proactive routing zones for stable local topology to minimize blind message forwarding, and identifying potential carriers to maximize message delivery despite network partitions and intermittent connectivity. We compare the performance of our protocol against others, using a mobility model validated with real-world traces.

A-Routing for intermittently connected mobile ad hoc networks

“…The Semi Probabilistic Routing (SPR) [5] algorithm considers that the network is partitioned into tiny portions that have a stable topology. The protocol upholds the information about host mobility and connectivity changes for more accurate message forwarding.…”

Bee routing protocol for intermittently connected mobile networks

“…The Semi Probabilistic Routing (SPR) [7] algorithm considers that the network is partitioned into tiny portions that have a stable topology. The protocol upholds the information about host mobility and connectivity changes for more accurate message forwarding.…”

On Rendezvous in Mobile Sensing Networks

“…Many applications of mobile networks leverage node rendezvous for data communication [12] and time synchronization [16]. A large body of work explores temporal connectivity in opportunistic networking, e.g.…”

“…Past research efforts on exploiting rendezvous in mobile networks focused on data communication [12][13][14][15] and network-wide time synchronization [16]. In both cases, a rendezvous depends on the node's communication range and is assessed in terms of successful communication between two nodes.…”