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

Prashant Ratanchandani

dblp:66/1280 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

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

Computer networks · 2 · 1 first-author

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 · 30% Internet of things and sensor networks · 30% Internet architecture and protocols · 30%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
group communication
0.012003
Manycast: exploring the space between anycast and multicast in ad hoc networks · MobiCom 2003
Internet architecture and protocols › multicast
manycast
0.012003
Manycast: exploring the space between anycast and multicast in ad hoc networks · MobiCom 2003
Routing and switching
routing protocol
0.012003
Manycast: exploring the space between anycast and multicast in ad hoc networks · MobiCom 2003
Wireless networking
mobile ad hoc networks
0.012003
Manycast: exploring the space between anycast and multicast in ad hoc networks · MobiCom 2003

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

simulation · 0.0
YearPublicationVenuePosition
2003 Manycast: exploring the space between anycast and multicast in ad hoc networks
abstract
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not support the needs of a mobile node that must locate one or more distributed servers. A node should not need detailed knowledge of network topology to choose servers with which it can communicate efficiently.To this end, manycast is a group communication scheme that enables communication with an arbitrary (user specified) number of group members. Anycast and multicast communication are special cases of manycast in which the target number of group members is one and infinity, respectively. We present manycast and discuss its use as a communication primitive, with specific attention to ad hoc networks. We advocate manycast support at the network layer. A manycast routing protocol enables an application to contact several nearby network nodes that implement a distributed service.We analyze some approaches to manycast, including some application layer implementations. This evaluation supports our claim that manycast must be implemented in the network layer for effective operation in ad hoc networks. We present several extensions to ad hoc routing protocols that can provide manycast support with minimal implementation effort. Through analysis and extensive simulation, we explore the behavior of these approaches to manycast, finally providing recommendations to implementors.
Casey Carter, Seung Yi, Prashant Ratanchandani, Robin Kravets
MobiCom3
2003 A hybrid approach to Internet connectivity for mobile ad hoc networks
abstract
Mobile ad hoc networks are autonomous, infrastructureless networks that support multihop communication through IP routing. This paper examines the use of mobile IP in order to provide global Internet connectivity to ad hoc networks that use an on-demand routing protocol. We present a hybrid scheme that uses techniques such as TTL scoping of agent advertisements, eavesdropping and caching agent and advertisements to combine the advantages of proactive and reactive approaches to providing connectivity. We present simulation results to show that our approach achieves excellent connectivity while keeping overhead costs low.
Prashant Ratanchandani, Robin Kravets
WCNC1