This course will cover algorithms and lower bound results in the area of wireless and mobile networks. We will study algorithms from a theoretical perspective and focus on proofs of correctness, fault-tolerance and complexity analysis. We will identify important and well-defined problems in wireless ad hoc networks and study the existing algorithms for these problems.

What are the ``right'' complexity measures to use? What realistic assumptions can we make? We will identify areas where more algorithmic work is needed. We will study inherent limitations (lower bounds and impossibility results) on the solvability of problems in wireless networks.

There is no textbook for the course. All material will be taken from current papers. The course grade will be based on reading papers and producing written summaries and presenting papers in class. There will be no exams in the course. There may be some short problem solving assignments.

As a pre-requisite for the course, you will be expected to be familiar with the basic concepts behind the design and analysis of sequential algorithms. This familiarity can be obtained from Com S 511 and, to a lesser extent, from Com S 311. Also, you should be comfortable with reasoning through and writing mathematical proofs. Lower bound proofs and impossibility proofs in distributed computing often have the same style as the proofs done in a Theory of Computation course like Com S 531.

A background in distributed systems or networking would be helpful to appreciate the results and applications of the course material, but is not essential.

This course follows the topics of a similar course offered in Spring 2006 by Nancy Lynch at MIT and Jennifer Welch at Texas A & M.

We will be roughly covering the following topics, focussing on theoretical results. To provide background, we will also prove some fundamental results in distributed computing, as they relate to the topics studied.

• MAC layer
• Localization
• Time synchronization
• Topology control
• Local infrastructure (local consensus, local leader election, local reliable broadcast)
• Global broadcast
• Point-to-point routing
• Location-based communication services (location services, location-based routing)
• Global infrastructure (spanning trees, clusters, maximal independent sets)
• Middleware services (token circulation, resource allocation, consensus, group membership)

Your grade will be based on your performance on scribe notes, assignments and paper summaries, and your class presentations.

• Scribe Notes need to be written in latex. They should be complete and go beyond just copying what was presented. The scribe should include interesting points made in the class discussion. Also, clarify any confusing points. You may also include your own perspective. Notes should be ready within a few days of the lecture.

  Refer to the Note-Taking Schedule page and sign up to take notes.

• Assignments will be posted on the Assignments page on a regular basis. This will include paper summaries (for the papers we are reading in class) and written problems (e.g., design an algorithm, prove a lower bound, extend or modify a result presented in class).

  Paper summaries should include the main points of the paper, assumptions made about the model, and what open questions remain. You can also include your own brief critique, including what you think is interesting or significant.

• The presentations will involve presenting papers on one or two of the topics that we cover in class. These student presentations will be interspersed with the lectures by the instructor.

• 30% -- Scribe Notes
• 30% -- Presentations
• 30% -- Assignments/Summaries
• 10% -- Class Participation