Modelling the delay distribution of Binary Spray and Wait routing protocol

Abstract

This article proposes a stochastic model to obtain the end-to-end delay law between two nodes of a Delay Tolerant Network (DTN). We focus on the commonly used Binary Spray and Wait (BSW) routing protocol and propose a model that can be applied to homogeneous or heterogeneous networks (i.e. when the inter-contact law parameter takes one or several values). To the best of our knowledge, this is the first model allowing to estimate the delay distribution of Binary Spray and Wait DTN protocol in heterogeneous networks. We first detail the model and propose a set of simulations to validate the theoretical results. Index Terms-DTN routing, modelling, binary spray and wait I. INTRODUCTION Delay Tolerant Networks (DTN) is a concept initially created for interplanetary networks [6]. However, it also receives a great success for intermittently connected networks and particularly for opportunistic networks [5]. In these networks, a node can send data to another if they are within the transmission range of each other. Due to the dynamic character of these networks, there is no guarantee that a direct connected path from a given source to a given destination exists at any time. As a result, routing protocols using relay nodes and replication such as MaxProp [3], Spray and Wait [14], PRoPHET [13] and RAPID [2] have been proposed to increase the message delivery ratio over such intermittently connected networks.The performance evaluation of such protocols in terms of message delivery ratio, end-to-end delay or throughput is a difficult task due to the complexity to drive mobile network simulations. Several efforts have been done in order to assess the performance of routing schemes with simulations. Today, The ONE simulator became a reference tool in this area [1]. Other approaches have proposed Markovian and ordinary differential equations (ODEs) models to study the performance of some basic routing protocols such as Epidemic, Epidemic limited, 2-hop routing and 2-hop limited routing protocols [16], [7], [11] while others focus on the ressource constraints issues in these networks [17], [10]. However, none of these models consider both Binary Spray and Wait (BSW) routing protocol and different inter-contact law parameters (qualified in this study as heterogeneous case). As real cases are usually not homogeneous, it is important to handle this aspect.In this paper, we introduce a Markovian model to obtain the end-to-end delay law and the average delivery ratio of an intermittently connected network. Compare to previous existing works, we propose to fill a gap by introducing a model

An Analytical Model for Information Centric Internet of Things Networks in Opportunistic Scenarios

“…Although SnW allows every node to forward the content copies, the copies will not over consume much resources due to limited maximum number of copies. Besides, Diana et al and other researchers extended the Markovian model to more realistic cases where mobile nodes have heterogeneous mobility models [23], [24].…”

“…It is worth pointing out that both [11] and [24] only produce a mean end-to-end delay without further investigating on the influences of other factors, such as content lifetime, etc. Moreover, only one-way transmission is modelled in [11], [23], [24] to reflect that one node sends a content to another node. When considering ICNs, data transmission normally composes of both requesting and responding phases, which has been overlooked by above mentioned works.…”

Empirical capacity modeling and evaluation of delay tolerant network routing protocols

“…Previous analytical treatments to DTNs, e.g., [2], [6], have mostly been dealing with Markovian models using states monitoring the number of copies of a message. Previous studies have pointed out that joint factors such as random motions of nodes and their short transmission ranges, the inter-arrival time of messages in a DTN displays Poisson distributions [2].…”

“…for 2-hop and unlimited multi-copy routers [2], [3], [4], and for Spray-and-Wait [5], [6]. These deal mostly with Markovian models using states monitoring the number of copies of a message.…”

A Markov chain model for drop ratio on one-packet buffers DTNs

“…A pioneering work in the field of DTN performance modeling was [3], where the authors provide a Markov model for the 2-hop and unrestricted multicopy routing protocols in the case of homogeneous exponentially distributed intercontact times (ICTs). Markov modeling was subsequently applied to Epidemic routing [4]- [6], Spray And Wait [7], [8] and Binary Spray and Wait [9]. Other modeling tools include Ordinary Differential Equations [10], [11] or Petri Nets [12].…”