| REQUIRED TEXT: F. Zhao and L. Guibas, Wireless Sensor Networks: An Information Processing Approach, Morgan Kaufman, 2004.
REFERENCE TEXTS:
W. Stallings, Wireless Communications and Networks, 2nd Edition, Prentice Hall, 2005.
I. Stojmenovic (editor) Handbook of Sensor Networks: Algorithms and Architectures, John Wiley and Sons, 2005.
(Copies will be available under "Reserve" in the Engineering Library).
COURSE OBJECTIVES: This course will provide coverage of the basic hardware and software platforms for sensor networks and will address in detail several algorithmic techniques for data routing, querying processing, and topology management. The students will obtain hands-on experience through programming projects involving TinyOS or MantisOS, running on Telos/MicaZ platforms. In addition, a number of prototype systems, such as TinyDB will be studied, in the context of various application domains of sensor networks.
PREREQUISITES BY COURSES: EECS 343 or EECS 340 (or permission from the instructors).
DETAILED COURSE TOPICS:
| 1.Introduction/Applications |
Application domains of sensor networks.
Enabling technologies: hardware/software platforms.
Performance metrics. |
| 2. Communication Model |
Wireless sensor architecture and protocol stack.
Basics of RF communication and the role of MAC.
Popular protocols (802.11, 802.15, Bluetooth). |
| 3. Localization and Coverage |
Global location (GPS-based) and relative location (Beacon-based).
Localization methods: anchor-free, anchor-based, range-free, range-based.
Timing/synchronization
Coverage and connectivity: properties and quality aspects. |
| 4. Routing |
Data centric-protocols: gossiping, rumor routing, directed diffusion.
Hierarchical protocols: LEACH.
Location-based (Geographical) protocols and energy-aware routing: GPSR, geometric spanners, distributed topology routing (PRADA).
Multipath-routing
|
| 5. Query Processing in Sensor Networks |
Fundamentals of query approaches: push vs. pull based processing.
Review of SQL.
In-network processing and aggregation: TinyDB and TAG.
Statistical approaches to computing aggregates: quantile-digest.
Robust aggregation: ODI synopses. |
| 6. Mobility and Tracking |
Tracking with Binary Sensors
Distributed trajectory tracking and data reduction
Selection of tracking principals. |
| 7. RFID Systems |
Tag identification protocols
Reader anti-collision algorithms
In-door localization with RFIDs |
| 8. Advanced Topics |
Security in WSN.
Real-time query scheduling
Integrating event-streams with signal processing operations |
WORKLOAD and EVALUATION:
-
Programming Projects (40%): The first programming assignment will involve programming in nesC for the purpose of basic tasks being executed on actual TelosB motes under TinyOS. The second assignment will require an implementation of routing and/or network aggregation techniques, using a wireless sensor network simulator.
-
Midterm (30%):
-
Presentation of technical paper(s) and preparing written summaries (20%): Papers from relevant recent conferences and journals addressing contemporary aspects related to the topics presented in the class/lectures. These presentations will take place in the last two/three weeks of the course.
-
Class participation (10%): Students will be expected to read the papers covered in the last two weeks of class and participate in the discussions following the presentations. They will also have to submit concise write-ups summarizing the pros and cons of the (most, of the) papers presented during the student-presentation-session.
AFTER COMPLETING THE COURSE: the students should have a thorough understanding of the different issues involved in the information management in wireless sensor networks, and be comfortable with programming motes for actual applications.
|