A DTN Oriented Adaptive Routing Algorithm Based on Node Load

Hongyan Cui

doi:10.23919/JCC.2022.00.021

A DTN Oriented Adaptive Routing Algorithm Based on Node Load

2022-12-01

1

PRE

AI

DOI：10.23919/JCC.2022.00.021

原文链接

原文求助

摘要

En 中文

In recent years, Delay Tolerant Networks (DTN) have received more and more attention. At the same time, several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceive changes in the network environment. This paper proposes an AdaptiveSpray routing algorithm. The algorithm can dynamically control the initial maximum message copy number according to the cache occupancy rate of the node itself, and the cache occupancy rate is added as an impact factor to the calculation of the probability of each node meeting the destination node. In the forwarding phase, the node will first compare the meeting probability of itself and the meeting node to the destination node, and then choose different forwarding strategies. The simulation shows that the AdaptiveSpray algorithm proposed in this paper has obvious advantages compared with the existing routing algorithms in terms of message delivery rate and average delay.

Keyword:

DTN

routing algorithm

adaptive

cache management

A DTN Oriented Adaptive Routing Algorithm Based on Node Load

摘要

期刊

机构

引用论文