An Adaptive Spray and Wait Routing Algorithm Based on Quality of Node in Delay Tolerant Network

Abstract

The Internet of Things is one of the new emerging application domains that require delay tolerant network (DTN) support, where an end-to-end path between the source and the destination may not always exist. Due to the intermittent connectivity of DTN, the design of an efficient routing algorithm is the main challenge. In this paper, we first define a metric called message handling capacity to determine the ability of a node to forward messages. Then, we introduce a concept called connection strength to reflect the connection time between nodes and then integrate the concept into delivery predictability used by Prophet to determine the chance of a node completely delivering a message to the destination. Subsequently, we present a metric called quality of node (QoN), which is calculated by combining the relative weights of the message handling capacity and the improved delivery predictability. Finally, we present an adaptive spray and wait routing algorithm based on QoN (QoN-ASW). The QoN-ASW adaptively allocates the number of message copies between the encountered nodes according to the proportion of quality of node in the spray phase, which avoids the blindness of replica distribution. In addition, a forwarding scheme is implemented in the wait phase, which takes full advantage of encounter opportunities. In the simulation, we demonstrate the efficiency of integrating the connection strength into delivery predictability and compare the QoN-ASW with four existing DTN routing algorithms from four aspects. The simulation results show that the QoN-ASW can significantly improve the delivery rate and reduce the average delay while achieving a relatively low overhead.INDEX TERMS Connection strength, delay tolerant network, message handling capacity, quality of node, spray and wait.

Learning for Multiple-Relay Selection in a Vehicular Delay Tolerant Network

“…The epidemic router based protocol (ER) is a typical multi-copy routing protocol that will transfer as many messages as possible [12,15,16]. In order to alleviate this type of problem, The spray and wait based protocol (SAW) limits the number of message copies [13]. Given the infinite exploration time and partial random strategy, Q-learning can determine the best action selection strategy for any given finite Markov decision process.…”

Cooperative‐routing mechanism based on node classification and task allocation for opportunistic social networks

“…The simulation adopts the opportunistic network environment (ONE) simulation platform to test the NCTA routing algorithm in real environment, and compares it with Spray and Wait [37], Epidemic [38], EIMST(Effective Information Transmission Based on Socialization Nodes) [5], and FCNS (fuzzy routing‐forwarding algorithm) [15] to evaluate the experimental performance of the algorithm. EIMST and FCNS are the latest routing algorithms for opportunistic social networks, while the other two algorithms are traditional, typical algorithms.…”

A Fuzzy‐Logic‐Based Double Q‐Learning Routing in Delay‐Tolerant Networks

“…Based on the store-carry-forward routing, researchers have proposed many routing protocols for DTNs, which can be classified into two types: replication-based routings and forwarding-based routings. However, the replication-based routing protocols (e.g., Epidemic [5] and Spray and Wait [6]) usually cause flooding and exhaust the limited network resources, because they generate excessive message copies in the network. Although the forwarding-based routing protocols (e.g., First Contact [7] and Direct Delivery [8]) can conserve the network resources, they may worsen the deliv-ery ratio and latency of messages.…”