Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Asato Takahashi

dblp:150/8414 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 56% Routing and switching · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
delay tolerant networks
0.212015
Dynamic Replication and Forwarding Control Based on Node Surroundings in Cooperative Delay-Tolerant Networks · IEEE Trans. Parallel Distributed Syst. 2015
Routing and switching
routing
0.212015
Dynamic Replication and Forwarding Control Based on Node Surroundings in Cooperative Delay-Tolerant Networks · IEEE Trans. Parallel Distributed Syst. 2015
Internet of things and sensor networks › opportunistic networks
message replication
0.112015
Dynamic Replication and Forwarding Control Based on Node Surroundings in Cooperative Delay-Tolerant Networks · IEEE Trans. Parallel Distributed Syst. 2015

Methods — techniques the papers use, named apart from their topics

simulation · 0.2reliability analysis · 0.2
YearPublicationVenuePosition
2015 Dynamic Replication and Forwarding Control Based on Node Surroundings in Cooperative Delay-Tolerant Networks
abstract
Delay-tolerant networks (DTNs) are a promising network architecture which can provide reliable multi-hop message transmission between participating mobile nodes in an unfavorable environment that is prone to link disruption and disconnection by replicating and relaying messages without any need of physical infrastructure. Additionally, DTNs can also operate as cooperative DTNs to extend the coverage of other type of networks by carrying the messages that originate from farther away base station in a multi-hop fashion to the base station. In this paper, we focus on these cooperative DTNs and propose a novel routing scheme, ring distribution routing (RDR), that controls the replication and forwarding based on the source node surroundings. This paper also analyzes the reliability and buffer efficiency in RDR. Furthermore, we show that RDR provides the reliable and immediate message delivery in any environment through extensive computer simulations.
Hiroki Nishiyama 0001, Asato Takahashi, Nei Kato, Katsuya Nakahira, Takatoshi Sugiyama
IEEE Trans. Parallel Distributed Syst.2