Research
Approximate Queries in Data Streams
In a data stream query system, memory is always at a premium. My work focuses on fast space-efficient representations of streams.
- Chiranjeeb Buragohain, Nisheeth Shrivastava, Subhash Suri and Divyakant Agrawal, Space-efficient Histogram Algorithms for Data Streams Under Submission
Data Summarization and Queries in Sensor Networks
A sensor network is a very efficient data gathering machine: but processing this data efficiently can be pretty hard due to bandwidth and power constraints on the nodes. My work focuses on designing distributed algorithms to process various types of queries on sensor network data.
- Contour Approximation in Sensor Networks , Chiranjeeb Buragohain,
Sorabh Gandhi, John Hershberger, Subhash Suri: To appear in the
2nd
International Conference on Distributed Computing in Sensor Systems
(DCOSS 2006)
We designed and implemented the first known distributed data compression algorithms for sensor networks which can represent geometric shapes, such as contours in small space.
- Distributed Navigation Algorithms for Sensor Networks, Chiranjeeb Buragohain,
Divyakant Agrawal, Subhash Suri, To appear in the Proc. of
INFOCOM 2006
We wish to navigate our way through an area instrumented with sensors, while avoiding obstacles inside the area. We give distributed algorithms which compute approximate shortest paths with minimal communication cost.
- Medians and Beyond: New Aggregation Techniques for Sensor Networks
Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal,
Subhash Suri,
Proc. of the Second ACM Conference on Embedded Networked Sensor
Systems (SenSys 2004)
In a sensor network, computing aggregates like MIN,MAX or AVG over sensor values is easy and incur very low communication overhead. On the other hand computing the MEDIAN is complex and communication intensive. We give a distributed approximation algorithm to compute MEDIAN and other related aggregates using limited memory.
Routing in Wireless and Sensor Networks
Traditional route discovery algorithms for wireless networks such as AODV/DSR have two drawbacks: (i) high route discovery overhead and (ii) not optimized for route quality. My research concentrates on designing efficient and quality conscious routing algorithms.
- Improved Throughput Bounds for Interference-aware Routing in Wireless Networks , Chiranjeeb Buragohain, Subhash Suri, Csaba Toth, Yunhong Zhou: Under submission
- High Throughput Wireless Routing with Geographic Information , Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri : Under submission
- Power Aware Routing for Sensor Databases,
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri, Proc. of
INFOCOM 2005
A sensor database collects data from a sensor network using a routing tree rooted at the base station. We show that the problem of computing the optimal lifetime routing tree is NP complete and provide approximation algorithms.
Economics of Distributed Systems
Traditional models of computer nodes are either cooperative (TCP sender and receiver), or adversarial (cryptography). With the advent of the internet, we now encounter a third type of node: selfish nodes which want to maximize network utility for themselves. Game theory can help design algorithms which perform well in the presence of selfish users.
- A Game Theoretic Framework for Incentives in P2P Systems
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri,
Proc. of the Third International Conference on P2P Computing
(P2P2003), Linkoping Sweden, 2003
In a P2P system, the performance of the system often suffers from free riders, who do not contribute to the system. We show that a simple incentive scheme can lead to a game where the Nash equilibrium will eliminate all free riders. This paper was one of the first papers to demonstrate the use of game theory is analyzing incentives in P2P systems.