2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI) 2019
DOI: 10.1109/kbei.2019.8734972
|View full text |Cite
|
Sign up to set email alerts
|

RBCRP: A Routing Approach Based on Crowded Rendezvous Points in Delay Tolerant Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…Currently, one-time data sending is very small amount, so it takes quite a long time to transfer even 1MB data. To solve this problem, [5] proposes a new DTN routing algorithm called Routing Based on Crowded Rendezvous Points (RBCRP). In their work, they reduce the network overhead and nodes of the network not require large quantities of memory for data buffering.…”
Section: B Delay Tolerant Networking (Dtn)mentioning
confidence: 99%
See 1 more Smart Citation
“…Currently, one-time data sending is very small amount, so it takes quite a long time to transfer even 1MB data. To solve this problem, [5] proposes a new DTN routing algorithm called Routing Based on Crowded Rendezvous Points (RBCRP). In their work, they reduce the network overhead and nodes of the network not require large quantities of memory for data buffering.…”
Section: B Delay Tolerant Networking (Dtn)mentioning
confidence: 99%
“…IoP is also based on the Internet and is a concept for data communication in a very large space such as outer space and Galaxy. There are many technical challenges in designing IoP routing protocols such as high latency, limited resources, frequent disconnections, and predictable or opportunistic connections [5]. In several research projects, the performance of IoPs in terms of delay, overhead, throughput buffer size and number of nodes has been investigated.…”
Section: Introductionmentioning
confidence: 99%