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

Krishna N. Ramachandran

dblp:47/3342 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2008
—ORCID · none

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

Computer networks · 5 · 3 first-authorSecurity and privacy · 1 · 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
3 papers
Wireless networking · 90% Cellular and mobile networks · 5% Network optimization and economics · 5%

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

TopicWeightPapersLastEvidence papers
Wireless networking
channel assignment
0.112006
Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks · INFOCOM 2006
Wireless networking › channel assignment
interference-aware channel assignment
0.112006
Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks · INFOCOM 2006
Wireless networking
wireless mesh network
0.112006
Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks · INFOCOM 2006
Wireless networking › WLAN
IEEE 802.11
0.112005
Understanding Congestion in IEEE 802.11b Wireless Networks · Internet Measurement Conference 2005
Cellular and mobile networks › interference management
interference estimation
0.012006
Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks · INFOCOM 2006
Wireless networking › wireless mesh network
multi-radio mesh networks
0.012006
Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks · INFOCOM 2006
Wireless networking › scheduling › queueing discipline
queue-length-based scheduling
0.012006
IQU: practical queue-based user association management for WLANs · MobiCom 2006
Network optimization and economics
resource allocation
0.012006
IQU: practical queue-based user association management for WLANs · MobiCom 2006
Wireless networking
wireless network performance
0.012005
Understanding Congestion in IEEE 802.11b Wireless Networks · Internet Measurement Conference 2005

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

work period allocation · 0.1testbed evaluation · 0.1simulation · 0.1queue-based association control · 0.1conflict graph modeling · 0.1measurement · 0.1
YearPublicationVenuePosition
2008 A Multi-radio 802.11 Mesh Network Architecture
Krishna N. Ramachandran, Irfan Sheriff, Elizabeth M. Belding, Kevin C. Almeroth
Mob. Networks Appl.1
2007 Routing Stability in Static Wireless Mesh Networks
Krishna N. Ramachandran, Irfan Sheriff, Elizabeth M. Belding, Kevin C. Almeroth
PAM1
2006 Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks
abstract
The capacity problem in wireless mesh networks can be alleviated by equipping the mesh routers with multiple radios tuned to non-overlapping channels. However, channel assignment presents a challenge because co-located wireless networks are likely to be tuned to the same channels. The resulting increase in interference can adversely affect performance. This paper presents an interference-aware channel assignment algorithm and protocol for multi-radio wireless mesh networks that address this interference problem. The proposed solution intelligently assigns channels to radios to minimize interference within the mesh network and between the mesh network and co-located wireless networks. It utilizes a novel interference estimation technique implemented at each mesh router. An extension to the conflict graph model, the multi-radio conflict graph, is used to model the interference between the routers. We demonstrate our solution’s practicality through the evaluation of a prototype implementation in a IEEE 802.11 testbed. We also report on an extensive evaluation via simulations. In a sample multi-radio scenario, our solution yields performance gains in excess of 40% compared to a static assignment of channels.
Krishna N. Ramachandran, Elizabeth M. Belding, Kevin C. Almeroth, Milind M. Buddhikot
INFOCOM1
2006 IQU: practical queue-based user association management for WLANs
abstract
Flash crowds and high concentrations of users in wireless LANs (WLANs) cause significant interference problems and unsustainable load at access points. This leads to poor connectivity for users, severe performance degradation, and possible WLAN collapse. To validate this claim, we present two case studies of large, heavily loaded operational WLANs. These studies provide significant insight into the degraded performance and collapse of a WLAN during heavy use. To address these problems, we propose IQU, a practical queue-based user association management system for heavily loaded WLANs. IQU grants users fair opportunities to access the WLAN while maintaining high overall throughput, even when the WLAN is heavily loaded. The basic premise of IQU is to control user associations with the WLAN through request queues and work period allocations. We implement a prototype of IQU and evaluate it on a wireless testbed. Our evaluation demonstrates that IQU significantly improves network throughput under heavy load; the tradeoff is that users have to wait for network access. We explore the impact of IQU parameters on system performance, and validate the robustness of IQU under heavy load conditions. Through IQU, WLANs can be utilized efficiently and network collapse prevented.
Amit P. Jardosh, Kimaya Mittal, Krishna N. Ramachandran, Elizabeth M. Belding, Kevin C. Almeroth
MobiCom3
2005 Understanding Congestion in IEEE 802.11b Wireless Networks
Amit P. Jardosh, Krishna N. Ramachandran, Kevin C. Almeroth, Elizabeth M. Belding
Internet Measurement Conference2
2004 DAMON: a distributed architecture for monitoring multi-hop mobile networks
abstract
With the advent of small form-factor devices, protocol standardization, and robust protocol implementations, multi-hop mobile networks are witnessing widespread deployment. The monitoring of such networks is crucial for their robust operation. To this end, this paper presents DAMON, a distributed system for monitoring multi-hop mobile networks. DAMON uses agents within the network to monitor network behavior and send collected measurements to data repositories. DAMON's generic architecture supports the monitoring of a wide range of protocol, device, and network parameters. Other key features of DAMON include seamless support for multiple repositories, auto-discovery of sinks by the agents, and resiliency of agents to repository failures. We have implemented DAMON agents that collect statistics on data traffic and the ad hoc on-demand distance vector (AODV) routing protocol. We have used our implementation to monitor an ad hoc network at the 58th Internet Engineering Task Force (IETF) meeting held November 2003 in Minneapolis, MN. In this paper, we describe the architecture of DAMON and report on the performance of the IETF network using monitoring information collected by DAMON. Our network monitoring system is available online for use by other researchers.
Krishna N. Ramachandran, Elizabeth M. Belding, Kevin C. Almeroth
SECON1