RABP: Delay/disruption tolerant network routing and buffer management algorithm based on weight

Hezhe Wang,Huiqiang Wang,Hongwu Lv,Guangsheng Feng,Renjie Zhou

doi:10.1177/1550147718757874

Abstract

Delay/disruption tolerant network is a novel network architecture, which is mainly used to provide interoperability for many challenging networks such as wireless sensor network, ad hoc networks, and satellite networks. Delay/disruption tolerant network has extremely limited network resources, and there is typically no complete path between the source and destination. To increase the message delivery reliability, several multiple copy routing algorithms have been used. However, only a few can be applied efficiently when there is a resource constraint. In this article, a delay/disruption tolerant network routing and buffer management algorithm based on weight (RABP) is proposed. This algorithm estimates the message delay and hop count to the destination node in order to construct a weight function of the delay and hop count. A node with the least weight value will be selected as the relay node, and the algorithm implements buffer management based on the weight of the message carried by the node, for efficiently utilizing the limited network resources. Simulation results show that the RABP algorithm outperforms the Epidemic, Prophet, and Spray and wait routing algorithms in terms of the message delivery ratio, average delay, network overhead, and average hop count.

Highlights

A delay/disruption tolerant network (DTN) was initially motivated by the idea of deploying an interplanetary Internet (IPN)[1] for deep space communication
To efficiently utilize limited network resources, we propose a DTN routing and buffer management algorithm based on weight (RABP)
We simultaneously considered the message delay and hop count and proposed a DTN routing algorithm and a buffer management algorithm based on weight to achieve near-optimal network performance in a constrained-resource condition

Summary

Introduction

A delay/disruption tolerant network (DTN) was initially motivated by the idea of deploying an interplanetary Internet (IPN)[1] for deep space communication. Message delay and hop count are the two critical metrics for evaluating the performance of a DTN routing algorithm. Delays are permitted in the DTN,[23] it is important to reduce them for a network in a constrained-resource condition.[24] Hop counts are the number of nodes that the message has experienced in the process of reaching the destination node. To efficiently utilize limited network resources, we propose a DTN routing and buffer management algorithm based on weight (RABP). The RABP algorithm selects a node with the lowest weight value as the relay node and implements buffer management based on the weight of the message carried by the node, to efficiently utilize the limited network resources.

Related works

Conclusion

55. Brussels