| Lecture/Assignment |
Due Date |
Office Hours |
Solution |
Background Reading: Ch. 1-3
---
---
| ---
| | | |
Introduction
8/26
---
| ---
| | | |
Aloha
Background Reading: Ch. 8.1-8.5.1
8/31
---
| ---
| | | |
Renewal-Reward Theory
9/2
---
| ---
| | | |
No Class (Labor Day)
9/7
---
| ---
| | | |
CSMA
Background Reading: Ch. 8.5.2
9/9
---
| ---
| | | |
CSMA/CA
Background Reading: 8.6
9/14
---
| ---
| | | |
Problem Set 1 (posted on Blackboard)
9/16
9/15 9-10
9/16 12:30-2
Solution Set 1
| | | |
Fixed Point Analysis
9/21
---
| ---
| | | |
Discrete-Time Markov Chain
9/23
---
| ---
| | | |
Problem Set 2
9/28
9/28 9-10:30
Solution Set 2
| | | |
DTMC IEEE 802.11
9/30
---
| ---
| | | |
Multihop 802.11
10/5
---
| ---
| | | |
Problem Set 3
10/7
10/7 9-10:30
Solution Set 3
| | | |
No Class (Fall Break)
10/12
---
| ---
| | | |
Paper 1: G. Bianchi, Performance analysis of the IEEE 802.11 distributed coordination function, IEEE JSAC, vol. 18, no. 3, pp. 535-547, Mar. 2000.
10/14
---
| ---
| | | |
Paper 2: M. Garetto, J. Shi, and E. Knightly, Modeling media access in embedded two-flow topologies of multi-hop wireless networks, in ACM MobiCom, Aug. 2005.
10/19
---
| ---
| | | |
Exam I
10/21
---
| ---
| | | |
Max-Min Fairness
Background Reading: Ch. 7.7.1
10/26
---
| ---
| | | |
Weighted Fair Queueing
Background Reading: Ch. 4.3
10/28
---
| ---
| | | |
*Modulation Rate Adaptation
11/2
---
| ---
| | | |
*Routing
Background Reading: Ch. 14
11/4
---
| ---
| | | |
*Paper 3: D.S.J. De Couto, D. Aguayo, J. Bicket, R. Morris, A high-throughput path metric for multi-hop wireless routing, in ACM MobiCom, 2003.
11/9
---
| ---
| | | |
Multihop Scheduling
11/11
---
| ---
| | | |
Congestion Control
Background Reading: Ch. 7
11/16
---
| ---
| | | |
Problem Set 4
11/18
11/11 9-10:30
Solution Set 4
| | | |
TCP Modeling
11/23
---
| ---
| | | |
No Class (Thanksgiving)
11/25
---
| ---
| | | |
Numerical Optimization
11/30
---
| ---
| | | |
Problem Set 5
12/2
12/2 9-10:30
Solution Set 5
Exam II
12/7
---
| ---
| | | |
|
|
|
|
| | | |
Problem sets posted a week in advance. Lectures may or may not occur on the due dates of the problem sets depending on the pace of the material.