Research

Areas of Interest

Distributed Computation over Sensor Networks: We study problems of computing aggregate functions of data distributed over a network. Derive bounds characterizing maximum frequency at which different classes of functions can be computed over different topologies.
Maximizing Lifetime in Sensor Networks: We study how to gather distributed data so as to maximize the lifetime of the network, given energy constraints on individual sensors. We derive a linear programming formulation, and for regular linear topology derive closed form expressions on the lifetime, along with the structure of the optimal strategy. Slightly weaker results, in the form of sharp bounds, are derived for regular planar networks.
Scheduling Algorithms for Automated Traffic (Masters' thesis): Design and implementation of a guaranteed deadlock free algorithm for scheduling vehicular traffic, applied to a vehicular testbed in the IT Convergence Lab at UIUC.

A. Giridhar and P.R. Kumar, ``Scheduling automated traffic on a network of roads'' , accepted for publication in IEEE Transactions on Vehicular Technology.
A. Giridhar and P.R. Kumar, ``Scheduling Algorithms for Automated Traffic" , Conference in Decision and Control, Nassau, 2004. ps
A. Giridhar and P.R. Kumar, ``Computing and Communicating Statistics in Sensor Networks'', International Symposium on Information Theory, Chicago, 2004.
A. Giridhar and P.R. Kumar, ``Computing and Communicating Functions in Sensor Networks'', IEEE Journal on Selected Areas in Communication. ps
A. Giridhar and P.R. Kumar, ``Maximizing the Functional Lifetime of Sensor Networks", Information Processing and Sensor Networks, Los Angeles, 2005. ps
A. Giridhar and P.R. Kumar, ``Towards a Theory of In-Network Computation in Wireless Sensor Networks" , submitted to IEEE Communications Magazine.