A Node Performance and Encountering Probability-Based Adaptive Routing for Delay Tolerant Networks

Fang, Lu; Li, Jianbo

doi:10.1109/msn.2016.044

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A probabilistic routing algorithm based on node communication capability and message strength

Chang

Wan

Cui

et al. 2022

Satell Commun Network

View full text Add to dashboard Cite

In delay-tolerant networks (DTN), node connection time and message transmission time are two important influencing factors that can improve the delivery rate. In this paper, we first define a new concept called communication capability (CC) and then apply this concept to the delivery predictability formulation in Prophet and improve it. Then, in Prophet, the selection of relay nodes relies only on the delivery predictability and ignores the caching and forwarding capability of the node. Therefore, we combine delivery predictability, buffering, and forwarding capability to develop a new adaptive relay node selection strategy. Subsequently, we define two metrics called message priority (MP) and message strength (MS). The node forwards messages sequentially based on message priority and discards messages based on message strength. Finally, we present a probabilistic routing algorithm based on node communication capability and message strength (CAMS). The simulation results show that compared with traditional routing algorithms, the CAMS can effectively improve the message delivery rate, reduce the overhead ratio, and keep average hop counts low.

show abstract