* Faculty       * Staff       * Students & Alumni       * Committees       * Contact       * Institute Directory
* Undergraduate Program       * Graduate Program       * Courses       * Institute Catalog      
* Undergraduate       * Graduate       * Institute Admissions: Undergraduate | Graduate      
* Colloquia       * Seminars       * News       * Events       * Institute Events      
* Overview       * Lab Manual       * Institute Computing      
No Menu Selected

* News


Lightweight Distributed Reasoning in Sensor Networks

Leonidas J. Guibas
Stanford University

Friday, February 25, 2005
AE 214 - 4:00 p.m. to 5:00 p.m.
Refreshments at 3:30 p.m.

The distribution of networked sensors in the environment offers exciting new possibilities for sensing and monitoring. Sensors can be placed close to multiple signal sources so that, collaboratively, they can sense and reason about wide-area phenomena, while providing a distributed awareness that no centralized system can attain. To bring this vision to fruition, however, several technological challenges remain. One of these is the design of lightweight distributed algorithms and protocols that enable the network to self-organize and then aggregate local information as needed, in order to reach global conclusions. This must be done in a scalable and robust way to allow systems with a large and variable number of relatively frail nodes that are able to deal with uncertainty and incomplete information. In this talk we discuss a number of algorithmic paradigms that address these issues, at least in part. We present examples such as tracking wide-area phenomena, counting people or vehicles, and performing identity management on moving objects.

Short Bio: Leonidas Guibas obtained his Ph.D. from Stanford in 1976, under the supervision of Donald Knuth. His main subsequent employers were Xerox PARC, MIT, and DEC/SRC. He has been at Stanford since 1984 as Professor of Computer Science, where he heads the Geometric Computation group within the Graphics Laboratory. He is also part of the Robotics Laboratory and the Bio-X Program. Professor Guibas' interests span computational geometry, geometric modeling, computer graphics, computer vision, robotics, ad hoc communication and sensor networks, and discrete algorithms --- all areas in which he has published and lectured extensively. At Stanford he has developed new courses in algorithms and data structures, geometric modeling, geometric algorithms, sensor networks, and biocomputation. Professor Guibas is an ACM Fellow.

Last updated: February 1, 2005