An Adaptive Routing Algorithm Based on Relation Tree in DTN
Author(s)
Chen, Diyue; Cui, Hongyan; Welsch, Roy E
Downloadsensors-21-07847.pdf (2.202Mb)
Publisher with Creative Commons License
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
It is found that nodes in Delay Tolerant Networks (DTN) exhibit stable social attributes similar to those of people. In this paper, an adaptive routing algorithm based on Relation Tree (AR-RT) for DTN is proposed. Each node constructs its own Relation Tree based on the historical encounter frequency, and will adopt different forwarding strategies based on the Relation Tree in the forwarding phase, so as to achieve more targeted forwarding. To further improve the scalability of the algorithm, the source node dynamically controls the initial maximum number of message copies according to its own cache occupancy, which enables the node to make negative feedback to network environment changes. Simulation results show that the AR-RT algorithm proposed in this paper has significant advantages over existing routing algorithms in terms of average delay, average hop count, and message delivery rate.
Date issued
2021-11Department
Sloan School of ManagementPublisher
Multidisciplinary Digital Publishing Institute
Citation
Sensors 21 (23): 7847 (2021)
Version: Final published version