4.7 Article

Learning for Adaptive Multi-Copy Relaying in Vehicular Delay Tolerant Network

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TITS.2023.3292592

关键词

Delay tolerant network; routing; multi-copy; Q-learning

向作者/读者索取更多资源

Multi-copy routing is a method that increases message delivery probability in the Vehicular Delay Tolerant Network (VDTN) by creating and forwarding copies to nodes. Generating too many copies can lead to potential congestion. To solve this problem, a feasible approach is to limit the number of copies generated. However, improper copy distribution can result in copies remaining in a small area and a high local density, which reduces overall performance. This paper proposes an effective Q-learning based VDTN multi-copy routing algorithm that controls the distribution of message copies and alleviates high local density.
Multi-copy routing is a way that creates and forwards copies to the nodes without the copies so that increases the message delivery probability in the Vehicular Delay Tolerant Network (VDTN). The cost of generating many copies is potential congestion. To solve this problem, a feasible approach is to limit the number of copies generated. However, when the mobility of nodes is not sufficient and when the density of nodes near the source node is relatively high, the inappropriate process of copy distribution may result in copies remaining in a small area and too high local density of copies. Consequently, the overall performance is reduced due to low destination encountering probability in the whole area caused by too many local copies distribution. In this paper, by using node encounter rate to describe the activity and density of nodes, an effective Q-learning based VDTN multi-copy routing algorithm is proposed. The Q-learning reward factor is determined by the node encounter rate so that the distribution of message copies is controlled and the too high local density of copies can be alleviated. Simulation results show that the proposed algorithm outperforms the related algorithms, and offers better delivery rate, negligible message latency and network overhead under different network node speeds, node density, and load conditions.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据