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.
EDBT 2026 Demo / reviewers in the wild / expert

Mahesh K. Das

dblp:94/326 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2001
—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
Routing and switching · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › ad hoc network routing
mobile ad hoc network routing		 0.012001
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks · ICNP 2001
Routing and switching
multipath routing		 0.012001
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks · ICNP 2001
Routing and switching › ad hoc network routing
on-demand distance vector routing		 0.012001
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks · ICNP 2001
Routing and switching › routing algorithms
loop-free routing		 0.012001
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks · ICNP 2001
Routing and switching
routing protocol		 0.012001
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks · ICNP 2001

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

discrete-event simulation · 0.0
YearPublicationVenuePosition
2001 On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
abstract
We develop an on-demand multipath distance vector protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand distance vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath distance vector (AOMDV). The protocol computes multiple loop-free and link-disjoint paths. Loop-freedom is guaranteed by using a notion of "advertised hopcount". Link-disjointness of multiple paths is achieved by using a particular property of flooding. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to achieve a remarkable improvement in the end-to-end delay-often more than a factor of two, and is also able to reduce routing overheads by about 20%.
Mahesh K. Marina, Mahesh K. Das
 ICNP2