ECE 598 NV - Distributed Algorithms for Wired and Wireless Networks

Summer 2009 | Fall 2009 | Spring 2010 | Summer 2010
Section Type Times Days Location Instructor
NV LEC 1100 - 1220 T R   1304 Siebel Center for Comp Sci  Nitin Vaidya

Official Description Subject offerings of new and developing areas of knowledge in electrical and computer engineering intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. May be repeated in the same or separate terms if topics vary.
Hours 0 to 4 hours.
Course Prerequisites Credit in ECE 428 or ECE 438
Course Directors Nitin H Vaidya
Description Distributed algorithms for wired networks, including algorithms for consensus, clock synchronization, mutual exclusion, broadcast; proofs of correctness of distributed algorithms; fault-tolerant distributed algorithms; distributed algorithms for wireless networks.
Notes Grading: homeworks, 10%; mid-term, 30%; final exam, 40%; project and paper presentation 20%.
Credit 4 hours.
Topics
  • Brief overview of wired and wireless networks
  • Leader election, mutual exclusion
  • Consensus
  • Clock synchronization
  • Broadcast
  • Wait-free hierarchy
  • Failure detectors
  • System-level diagnosis
  • Distributed snapshots, checkpointing
  • Distributed localization, location services
  • Routing with location information
  • In-network computation
  • Routing misbehavior
  • Self-stabilization
Texts The course will rely primarily on papers from literature. It will also draw on material presented in the following books:

H. Attiya and J. Welch, Distributed Computing, 2nd edition, John Wiley and Sons, 2004.
N. Lynch and M. Kaufmann, Distributed Algorithms, 1996.