[Nrg-l] CISE Seminar: Leonidas Guibas, Routing in Sensor Networks

Azer Bestavros best at cs.bu.edu
Thu Mar 20 23:05:24 EDT 2008


Friday, March 21, 2008 at 2:00 p.m.
8 St. Mary's Street, Room 901

Leonidas Guibas
Computer Science and Electrical Engineering
Stanford University

Routing and Information Brokerage in Sensor Networks

Abstract

Wireless sensor networks have recently come into prominence because they
hold the potential to revolutionize many segments of our economy and
life, from environmental monitoring and conservation, to manufacturing
and business asset management, to automation in the transportation and
health-care industries, to battlefield awareness and other defense
applications. Embedding sensors in the physical world and creating a
useful network poses many new challenges, because of bandwidth and
energy limitations (untethered nodes are common), because of the
volatility of wireless links, but also because collaboratively tracking
physical phenomena generates traffic patterns that are fundamentally
different from the more familiar peer-to-peer networks. Since sensor
networks are embedded systems, it is attractive to consider network
algorithms motivated by how one might approach problems in the
continuous physical world the nodes live in. Geographic routing is an
example. However, the discrete nature of the network and the imperfect
sampling of the environment create many difficulties in going from such
continuous high-level ideas to robust discrete and distributed
algorithms. This talk will consider some tools recently developed
towards this goal, in the area of information discovery, brokerage,
delivery, dissemination, and aggregation in sensor networks.
 
Leonidas Guibas obtained his Ph.D. from Stanford under the supervision
of Donald Knuth. His main subsequent employers were Xerox PARC,
Stanford, MIT, and DEC/SRC. He has been at Stanford since 1984 as
Professor of Computer Science (and by courtesy, Electrical Engineering),
where he heads the Geometric Computation group within the Graphics
Laboratory. He is also part of the AI Laboratory the Bio-X Program, and
the Institute for Computational and Mathematical Engineering. 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. Some well-known past accomplishments
include the analysis of double hashing, red-black trees, the quad-edge
data structure, Voronoi-Delaunay algorithms, the Earth Mover's distance,
Kinetic Data Structures (KDS), and Metropolis light transport. 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. 




-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://cs-mailman.bu.edu/pipermail/nrg-l/attachments/20080320/f4801505/attachment.html 


More information about the Nrg-l mailing list