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.

Prashanth Aravinda Kumar Acharya

dblp:83/4580 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 7 · 4 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
Network measurement and analytics · 56% Wireless networking · 44%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics › network performance measurement
congestion measurement
0.112010
Rate Adaptation in Congested Wireless Networks through Real-Time Measurements · IEEE Trans. Mob. Comput. 2010
Wireless networking › link adaptation
rate adaptation
0.112010
Rate Adaptation in Congested Wireless Networks through Real-Time Measurements · IEEE Trans. Mob. Comput. 2010

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

testbed · 0.1simulation · 0.1passive measurement · 0.1active probing · 0.1
YearPublicationVenuePosition
2011 MARS: Link-layer rate selection for multicast transmissions in wireless mesh networks
Prashanth Aravinda Kumar Acharya, Elizabeth M. Belding
Ad Hoc Networks1
2011 MeshMon: a multi-tiered framework for wireless mesh network monitoring
abstract
Abstract Monitoring and troubleshooting a large wireless mesh network (WMN) presents several challenges. Diagnosis of problems related to wireless access in these networks requires a comprehensive set of metrics and network monitoring data. Collection and offloading of a large amount of data are infeasible in a bandwidth constrained mesh network. Additionally, the processing required to analyze data from the entire network restricts the scalability of the system and impacts the ability to perform real‐time fault diagnosis. To this end, we propose MeshMon, a network monitoring framework that includes a multi‐tiered method of data collection. MeshMon, dynamically controls the granularity of data collection based on observed events in the network, thereby achieving significant bandwidth savings and enabling real‐time automated management. Our evaluation of MeshMon on a real testbed shows that we can diagnose a majority (87%) of network faults with a 66% savings in bandwidth required for network monitoring. Copyright © 2010 John Wiley & Sons, Ltd.
Ramya Raghavendra, Prashanth Aravinda Kumar Acharya, Elizabeth M. Belding, Kevin C. Almeroth
Wirel. Commun. Mob. Comput.2
2010 Gateway-aware routing for wireless mesh networks
abstract
Wireless mesh networks (WMNs) provide an attractive method to provide Internet connectivity in developing regions. Traditional mesh routing protocols are designed to find high quality/throughput multihop routes in the network. However, these solutions do not consider constraints imposed by the capacity at the gateway, often the bottleneck in such rural area networks. In this paper, we demonstrate the importance of intelligent choice of gateways in WMNs. We present the design of a new gateway-aware routing metric that picks high throughput routes in the presence of heterogeneous gateways. Our evaluation in simulations as well as on a testbed show significant increase in network throughput.
Prashanth Aravinda Kumar Acharya, David L. Johnson 0001, Elizabeth M. Belding
MASS1
2010 Rate Adaptation in Congested Wireless Networks through Real-Time Measurements
abstract
Rate adaptation is a critical component that impacts the performance of IEEE 802.11 wireless networks. In congested networks, traditional rate adaptation algorithms have been shown to choose lower data-rates for packet transmissions, leading to reduced total network throughput and capacity. A primary reason for this behavior is the lack of real-time congestion measurement techniques that can assist in the identification of congestion-related packet losses in a wireless network. In this work, we first propose two real-time congestion measurement techniques, namely an active probe-based method called Channel Access Delay, and a passive method called Channel Busy Time. We evaluate the two techniques in a testbed network and a large WLAN connected to the Internet. We then present the design and evaluation of Wireless cOngestion Optimized Fallback (WOOF), a rate adaptation scheme that uses congestion measurement to identify congestion-related packet losses. Through simulation and testbed implementation we show that, compared to other well-known rate adaptation algorithms, WOOF achieves up to 300 percent throughput improvement in congested networks.
Prashanth Aravinda Kumar Acharya, Ashish Sharma 0006, Elizabeth M. Belding, Kevin C. Almeroth, Konstantina Papagiannaki
IEEE Trans. Mob. Comput.1
2008 Congestion-Aware Rate Adaptation in Wireless Networks: A Measurement-Driven Approach
abstract
Traditional rate adaptation solutions for IEEE 802.11 wireless networks perform poorly in congested networks. Measurement studies show that congestion in a wireless network leads to the use of lower transmission data rates and thus reduces overall network throughput and capacity. The lack of techniques to reliably identify and characterize congestion in wireless networks has prevented development of rate adaptation solutions that incorporate congestion information in their decision framework. To this end, our main contributions in this paper are two-fold. First, we present a technique that identifies and measures congestion in an 802.11 network in real time. Second, we design Wireless congestion Optimized Fallback (WOOF), a measurement-driven rate adaptation scheme for 802.11 devices that uses the congestion measurement to identify congestion related packet losses. Through experimental evaluation, we show that WOOF achieves up to 300% higher throughput in congested networks, compared to other well-known adaptation algorithms.
Prashanth Aravinda Kumar Acharya, Ashish Sharma 0006, Elizabeth M. Belding, Kevin C. Almeroth, Konstantina Papagiannaki
SECON1
2008 Measurement-driven admission control on wireless backhaul networks
Irfan Sheriff, Prashanth Aravinda Kumar Acharya, Elizabeth M. Belding
Comput. Commun.2
2007 Sticky CSMA/CA: Implicit synchronization and real-time QoS in mesh networks
Sumit Singh 0001, Prashanth Aravinda Kumar Acharya, Upamanyu Madhow, Elizabeth M. Belding
Ad Hoc Networks2