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.

Sumit Rangwala

dblp:64/4920 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 4 · 3 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
4 papers
Wireless networking · 47% Transport protocols and congestion control · 26% Network optimization and economics · 14%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
wireless congestion control
0.222011
Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2011
Understanding congestion control in multi-hop wireless mesh networks · MobiCom 2008
Wireless networking › wireless mesh network
multihop wireless network
0.112011
Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2011
Wireless networking
wireless mesh network
0.112011
Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2011
Network optimization and economics › resource allocation › rate allocation
fair rate allocation
0.112008
Understanding congestion control in multi-hop wireless mesh networks · MobiCom 2008
Wireless networking › wireless mesh network
multi-hop wireless mesh networks
0.112008
Understanding congestion control in multi-hop wireless mesh networks · MobiCom 2008
Wireless networking
medium access and scheduling
0.112006
Interference-aware fair rate control in wireless sensor networks · SIGCOMM 2006
Internet of things and sensor networks
wireless sensor network
0.112006
Interference-aware fair rate control in wireless sensor networks · SIGCOMM 2006
Network optimization and economics › fairness
max-min fairness
0.012011
Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2011
Transport protocols and congestion control
reliable transport
0.012004
A wireless sensor network For structural monitoring · SenSys 2004

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

simulation · 0.2distributed rate control · 0.2deployment · 0.2AIMD rate control · 0.1AIMD · 0.1queue length monitoring · 0.1AIMD control law · 0.1wavelet-based compression · 0.0timestamping · 0.0hop-by-hop recovery · 0.0
YearPublicationVenuePosition
2011 Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks
abstract
Complex interference in static multihop wireless mesh networks can adversely affect transport protocol performance. Since TCP does not explicitly account for this, starvation and unfairness can result from the use of TCP over such networks. In this paper, we explore mechanisms for achieving fair and efficient congestion control for multihop wireless mesh networks. First, we design an AIMD-based rate-control protocol called Wireless Control Protocol (WCP), which recognizes that wireless congestion is a neighborhood phenomenon, not a node-local one, and appropriately reacts to such congestion. Second, we design a distributed rate controller that estimates the available capacity within each neighborhood and divides this capacity to contending flows, a scheme we call Wireless Control Protocol with Capacity estimation (WCPCap). Using analysis, simulations, and real deployments, we find that our designs yield rates that are both fair and efficient. WCP assigns rates inversely proportional to the number of bottlenecks a flow passes through while remaining extremely easy to implement. An idealized version of WCPCap is max-min fair, whereas a practical implementation of the scheme achieves rates within 15% of the max-min optimal rates while still being distributed and amenable to real implementation.
Sumit Rangwala, Apoorva Jindal, Ki-Young Jang, Konstantinos Psounis, Ramesh Govindan
IEEE/ACM Trans. Netw.1
2008 Understanding congestion control in multi-hop wireless mesh networks
abstract
Complex interference in static multi-hop wireless mesh networks can adversely affect transport protocol performance. Since TCP does not explicitly account for this, starvation and unfairness can result from the use of TCP over such networks. In this paper, we explore mechanisms for achieving fair and efficient congestion control for multi-hop wireless mesh networks. First, we design an AIMD-based rate-control protocol called Wireless Control Protocol (WCP) which recognizes that wireless congestion is a neighborhood phenomenon, not a node-local one, and appropriately reacts to such congestion. Second, we design a distributed rate controller that estimates the available capacity within each neighborhood, and divides this capacity to contending flows, a scheme we call Wireless Control Protocol with Capacity estimation (WCPCap). Using analysis, simulations, and real deployments, we find that our designs yield rates that are both fair and efficient, and achieve near optimal goodputs for all the topologies that we study. WCP achieves this level of performance while being extremely easy to implement. Moreover, WCPCap achieves the max-min rates for our topologies, while still being distributed and amenable to real implementation.
Sumit Rangwala, Apoorva Jindal, Ki-Young Jang, Konstantinos Psounis, Ramesh Govindan
MobiCom1
2006 Interference-aware fair rate control in wireless sensor networks
abstract
In a wireless sensor network of N nodes transmitting data to a single base station, possibly over multiple hops, what distributed mechanisms should be implemented in order to dynamically allocate fair and efficient transmission rates to each node? Our interferenceaware fair rate control (IFRC) detects incipient congestion at a node by monitoring the average queue length, communicates congestion state to exactly the set of potential interferers using a novel low-overhead congestion sharing mechanism, and converges to a fair and efficient rate using an AIMD control law. We evaluate IFRC extensively on a 40-node wireless sensor network testbed. IFRC achieves a fair and efficient rate allocation that is within 20-40% of the optimal fair rate allocation on some network topologies. Its rate adaptation mechanism is highly effective: we did not observe a single instance of queue overflow in our many experiments. Finally, IFRC can be extended easily to support situations where only a subset of the nodes transmit, where the network has multiple base stations, or where nodes are assigned different transmission weights.
Sumit Rangwala, Ramakrishna Gummadi, Ramesh Govindan, Konstantinos Psounis
SIGCOMM1
2005 Embedded Sensing of Structures: A Reality Check
abstract
With the advent of miniaturized sensing technology, it has become possible to envision smart structures containing millions of sensors embedded in concrete for autonomously detecting and locating incipient damage. Where are we today in our march towards this vision of autonomous structural health monitoring (SHM) using networked embedded sensing? In this paper, we summarize some of the systems we have developed towards this vision. Wisden is a wireless sensor network that allows continuous monitoring of structures and NetSHM is a programmable system that allows civil engineers to implement and deploy SHM techniques without having to understand the intricacies of wireless sensor networking. We highlight our experiences in developing these systems, and discuss the implications of our experiences on the achievability of the overall vision.
Krishna Chintalapudi, Jeongyeup Paek, Nupur Kothari, Sumit Rangwala, Ramesh Govindan, Erik A. Johnson
RTCSA4
2004 A wireless sensor network For structural monitoring
abstract
Structural monitoring---the collection and analysis of structural response to ambient or forced excitation--is an important application of networked embedded sensing with significant commercial potential. The first generation of sensor networks for structural monitoring are likely to be data acquisition systems that collect data at a single node for centralized processing. In this paper, we discuss the design and evaluation of a wireless sensor network system (called Wisden for structural data acquisition. Wisden incorporates two novel mechanisms, reliable data transport using a hybrid of end-to-end and hop-by-hop recovery, and low-overhead data time-stamping that does not require global clock synchronization. We also study the applicability of wavelet-based compression techniques to overcome the bandwidth limitations imposed by low-power wireless radios. We describe our implementation of these mechanisms on the Mica-2 motes and evaluate the performance of our implementation. We also report experiences from deploying Wisden on a large structure.
Sumit Rangwala, Krishna Chintalapudi, Deepak Ganesan, Alan Broad, Ramesh Govindan, Deborah Estrin
SenSys2