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

Shun Koba

dblp:131/0472 · 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

Computer networks · 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
Wireless networking · 56% Transport protocols and congestion control · 44%

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

TopicWeightPapersLastEvidence papers
Wireless networking › cognitive radio
cognitive radio ad hoc network
0.212015
Cognitive Radio-Aware Transport Protocol for Mobile Ad Hoc Networks · IEEE Trans. Mob. Comput. 2015
Wireless networking
channel switching
0.112015
Cognitive Radio-Aware Transport Protocol for Mobile Ad Hoc Networks · IEEE Trans. Mob. Comput. 2015

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

simulation · 0.2
YearPublicationVenuePosition
2015 Cognitive Radio-Aware Transport Protocol for Mobile Ad Hoc Networks
abstract
With the proliferation of new wireless service, scarce wireless resources is expected to become a critical issue. For this reason, cognitive radio mobile ad hoc networks (CogMANET) are being developed as a promising solution to this problem. However, in CogMANET, channel switching is inherently necessary whenever a primary user with a license appears on the channel. Allowing secondary users to choose an available channel from among a wide spectrum range thus enables reliable communication in this context, but communication characteristics such as bottleneck bandwidth and RTT will change with channel switch. In response to this change, TCP has to adaptively update its congestion window (cwnd) to make an efficient use of the available resources. For this purpose, TCP CRAHN was proposed for CogMANET. In this paper, TCP CRAHN is first evaluated in cases where bottleneck bandwidth and RTT drastically change. Based on these results, TCP CoBA is proposed to further improve the throughput of the above use cases. TCP CoBA updates the cwnd based upon the available buffer space in the relay node upon channel switch, as well as other communication characteristics. Through simulations, we show that compared with TCP CRAHN, TCP CoBA improves the throughput by up to 200 percent.
Kazuya Tsukamoto, Shun Koba, Masato Tsuru 0001, Yuji Oie
IEEE Trans. Mob. Comput.2