Computing Functions in Random Networks
Tuesday, June 29, 11am
Location: BA1180 (Bahen Centre Basement)
Distributed computation of functions is interesting in the context
of sensor networks. The interest here is to compute some function of the
data at the nodes rather than the data itself. In-network computation of the
function can potentially increase the rate of computation of the function.
The topology generated by a random distribution of the nodes generates a
random graph. Further, transmissions can cause errors. In this talk we
provide an overview of the different problem formulations and the results
for some of these formulations. In this talk the emphasis will be on
asymptotics of achievable computation rates.
D. Manjunath received his BE from Mysore University, MS from IIT Madras and
PhD from Rensselaer Polytechnic Inst, Troy NY in 1986, 1989 and 1993
respectively. He has worked in the Corporate R \& D Center of General
Electric in Scehenectady NY (1990), Computer and Information Sciences Dept
of the University of Delaware (1992-93) and the Computer Science Dept,
University of Toronto (1993-94). He was with the Department of Electrical
Engineering of IIT Kanpur during 1994-98. He has been with the Electrical
Engineering Department of IIT Bombay since July 1998 where he is now a
Professor. His research interests are in the general areas of communication
networks and performance analysis. His recent research has concentrated on
network traffic and performance measurement, analysis of random wireless
data and sensor networks, network pricing and queue control. He is a
coauthor of "Communication Networking: An Analytical Approach" (2004) and
"Wireless Networking" (2008) both of which are published by Morgan-Kaufman.
He is the TPC Co-Chair of the COMSNETS-2011 conference to be held in
Bangalore INDIA during January 4--8, 2011.
Host of Talk:
Ravi Adve (email@example.com)