Classroom 1 on the 20th Floor (Room # 2005) National Institute of Informatics
MAP
|
Professor Leonidas Guibas Computer Science Department Stanford University
|
Leonidas Guibas obtained his Ph.D. from Stanford in 1976, unfer 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 AI 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.
|
Lecture Series on Information Processing in Sensor Networks |
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 physics world and creating a network poses many new challenges, both because of bandwidth and energy limitations (untethered nodes are common), but also because tracking
physical phenomena generates traffic patterns that are fundamentally different from the more familiar peer-to-peer networks. Those constraints dictate that sensor network problems are best approached in a holistic
mannar, by jointly considering the physical, networking, and application layers and making major design trade-offs across the layers. |
This set of lectures will examine how to design and analyze the implementation of information processing tasks on sensor netowrks, including routing,
information brokerage, service establishement, sensor tasking and control, and distributed data storage. A special challenge is the integration of techniques from a variety of disciplines that comes into
play in supporting high-level sensor netowrk information management - including signal processing, networking, energy-aware computing, distributed databases and algorithms, and embedded systems and platforms.
|
Lecture Schedule (Eight Lectures): |
Tuesday, February 7 (13:00pm-14:30pm) |
L1. Introduction to Wireless Sensor Networks |
Distributed monitoring applications; Sensor network hardware; Architectural challenges; Research issues in sensor networks. |
|
Thursday, February 9 (10:00am-11:30am) |
L2.Networking Sensor Nodes: Naming and Routing |
Proactive vs. reactive routing; Greedy methods and geographic routing schemes; Routing without localization; Energy-aware routing. |
|
Monday, February 13 (13:30pm-15:00pm) |
L3. Low-level Networking; Data Dissemination and Aggregation |
Sensor network MAC protocols; Broadcast; Aggregation trees; Network sweeps. |
|
Tuesday, February 14 (13:30pm-15:00pm) |
L4. In-Network Processing and Information Brokerage |
Directed diffusion; Distance-sensitive information brokerage. |
|
Thursday, February 16 (10:00am-11:30am) |
L5. Sensor Tasking and Control |
Sensor collaboration groups; Information-driven sensor querying; Tracking and counting moving objects; Identity management. |
|
Monday, February 20 (13:30pm-15:00pm) |
L6. Infrastructure Establishment |
Time synchronization; Localization using ranging; Non-ranging methods. |
|
Tuesday, February 21 (13:30pm-15:00pm) |
L7. Sensor Network Programming Models |
TinyOS and nesC; Beyond node-centric programming; programming sensor nets with services. |
|
Thursday, February 23 (10:00am-11:30am) |
L8. Distributed Storage in Sensor Netowrks |
Geographic hash tables; Data-base view of sensor networks; TinyDB; Acquisitional query processing |
|